Semisupervised clustering for networks based on fast affinity propagation

DOI10.1155/2013/853283MaRDI QIDQ459858zbMATH OpenOpenAlexFDO

Authors Mu Zhu, Fanrong Meng, Yong Zhou

Publication date 13 October 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/853283

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Review text

Summary: 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.

Recommendations

• Semi-supervised clustering based on affinity propagation algorithm
• Active semisupervised community detection based on asymmetric similarity measure
• Effective semisupervised community detection using negative information
• Fast semi-supervised clustering with enhanced spectral embedding
• Fast semi-supervised evidential clustering

Cites work

• A hybrid fractal video compression method
• Fractal video sequences coding with region-based functionality
• Fractal-based image coding with fast decoder convergence

Cited in

(7)

• Effective semisupervised community detection using negative information
• SELP: semi-supervised evidential label propagation algorithm for graph data clustering
• Local community detection in complex networks based on maximum cliques extension
• Feature selection for better identification of subtypes of Guillain-Barré syndrome
• Semi-supervised clustering based on affinity propagation algorithm
• Active semisupervised community detection based on asymmetric similarity measure
• Network-based semisupervised clustering

This page was built for publication: Semisupervised clustering for networks based on fast affinity propagation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459858)