Semisupervised clustering for networks based on fast affinity propagation (Q459858): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q364540 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/853283 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2023205171 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A hybrid fractal video compression method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fractal video sequences coding with region-based functionality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fractal-based image coding with fast decoder convergence / rank | |||
Normal rank |
Latest revision as of 04:20, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semisupervised clustering for networks based on fast affinity propagation |
scientific article |
Statements
Semisupervised clustering for networks based on fast affinity propagation (English)
0 references
13 October 2014
0 references
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.
0 references