IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/385265.html
   My bibliography  Save this article

Semisupervised Clustering for Networks Based on Fast Affinity Propagation

Author

Listed:
  • Mu Zhu
  • Fanrong Meng
  • Yong Zhou

Abstract

Most of the existing clustering algorithms for networks are unsupervised, which cannot help improve the clustering quality by utilizing a small number of prior knowledge. We propose a semisupervised clustering algorithm for networks based on fast affinity propagation (SCAN-FAP), which is essentially a kind of similarity metric learning method. Firstly, we define a new constraint similarity measure integrating the structural information and the pairwise constraints, which reflects the effective similarities between nodes in networks. Then, taking the constraint similarities as input, we propose a fast affinity propagation algorithm which keeps the advantages of the original affinity propagation algorithm while increasing the time efficiency by passing only the messages between certain nodes. Finally, by extensive experimental studies, we demonstrate that the proposed algorithm can take fully advantage of the prior knowledge and improve the clustering quality significantly. Furthermore, our algorithm has a superior performance to some of the state-of-art approaches.

Suggested Citation

  • Mu Zhu & Fanrong Meng & Yong Zhou, 2013. "Semisupervised Clustering for Networks Based on Fast Affinity Propagation," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-13, July.
  • Handle: RePEc:hin:jnlmpe:385265
    DOI: 10.1155/2013/385265
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2013/385265.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2013/385265.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/385265?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:385265. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.