288 pp. per issue
6 x 9, illustrated
2014 Impact factor:

Neural Computation

July 2017, Vol. 29, No. 7, Pages 1902-1918
(doi: 10.1162/NECO_a_00973)
© 2017 Massachusetts Institute of Technology
A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering
Article PDF (1.78 MB)

Graph-based clustering methods perform clustering on a fixed input data graph. Thus such clustering results are sensitive to the particular graph construction. If this initial construction is of low quality, the resulting clustering may also be of low quality. We address this drawback by allowing the data graph itself to be adaptively adjusted in the clustering procedure. In particular, our proposed weight adaptive Laplacian (WAL) method learns a new data similarity matrix that can adaptively adjust the initial graph according to the similarity weight in the input data graph. We develop three versions of these methods based on the L2-norm, fuzzy entropy regularizer, and another exponential-based weight strategy, that yield three new graph-based clustering objectives. We derive optimization algorithms to solve these objectives. Experimental results on synthetic data sets and real-world benchmark data sets exhibit the effectiveness of these new graph-based clustering methods.