Semisupervised clustering for networks based on fast affinity propagation

DOI10.1155/2013/853283zbMATH Open1296.68155OpenAlexW2023205171MaRDI QIDQ459858FDOQ459858

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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)