Constructing affinity matrix in spectral clustering based on neighbor propagation

Authors:
Xin-Ye Li;Li-Jie Guo
Affiliations:
Department of Electronic and Communication Engineering, North China Electric Power University, Baoding, Hebei 071003,China;Department of Electronic and Communication Engineering, North China Electric Power University, Baoding, Hebei 071003,China
Venue:
Neurocomputing
Year:
2012

Citing 7
Cited 1

Spectral Methods for Automatic Multiscale Data Clustering

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Enhancing the Effectiveness of Clustering with Spectra Analysis

IEEE Transactions on Knowledge and Data Engineering
Robust path-based spectral clustering

Pattern Recognition
Spectral clustering with eigenvector selection

Pattern Recognition
On defining affinity graph for spectral clustering through ranking on manifolds

Neurocomputing
Spectral clustering with eigenvector selection based on entropy ranking

Neurocomputing
Spectral clustering for detecting protein complexes in protein-protein interaction (PPI) networks

Mathematical and Computer Modelling: An International Journal

Feedback-Based image retrieval using probabilistic hypergraph ranking augmented by ant colony algorithm

EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Ng-Jordan-Weiss (NJW) spectral clustering method partitions data using the largest K eigenvectors of the normalized affinity matrix derived from a dataset, but when the dataset is of complex structure, the affinity matrix constructed by traditional Gaussian function could not reflect the real similarity among data points, then the decision of clustering number and selection of K largest eigenvectors are not always effective. Constructing a good affinity matrix is very important to spectral clustering. A new affinity matrix generation method is proposed by using neighbor relation propagation principle and a neighbor relation propagation algorithm is also given. The affinity matrix generated can increase the similarity of point pairs that should be in same cluster and can well detect the structure of data. An improved multi-way spectral clustering algorithm is proposed then. We have performed experiments on dataset of complex structure, adopting Tian Xia and his partner's method for a baseline. The experiment result shows that our affinity matrix well reflects the real similarity among data points and selecting the largest K Eigenvectors gives the correct partition. We have also made comparison with NJW method on some common datasets, the results show that our method is more robust.