The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Clustering and projected clustering with adaptive neighbors
Abstract
Many clustering methods partition the data groups based on the input data similarity matrix. Thus, the clustering results highly depend on the data similarity learning. Because the similarity measurement and data clustering are often conducted in two separated steps, the learned data similarity may not be the optimal one for data clustering and lead to the suboptimal results. In this paper, we propose a novel clustering model to learn the data similarity matrix and clustering structure simultaneously. Our new model learns the data similarity matrix by assigning the adaptive and optimal neighbors for each data point based on the local distances. Meanwhile, the new rank constraint is imposed to the Laplacian matrix of the data similarity matrix, such that the connected components in the resulted similarity matrix are exactly equal to the cluster number. We derive an efficient algorithm to optimize the proposed challenging problem, and show the theoretical analysis on the connections between our method and the K-means clustering, and spectral clustering. We also further extend the new clustering model for the projected clustering to handle the high-dimensional data. Extensive empirical results on both synthetic data and real-world benchmark data sets show that our new clustering methods consistently outperforms the related clustering approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
(1967) · Cited by 23,719
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chiang, L. H., Russell, E. L., & Braatz, R. D. (2001) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0347-9_4 · Cited by 6,594
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Hierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
Self-Tuning Spectral Clustering
Zelnik‐Manor, L., & Perona, P. (2004) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,942
Proceedings of the 6th Berkeley Symposium on Mathematical Statistics and Probability
Cam, L. M. L., Neyman, J., & Scott, E. L. (1972) · Medical Entomology and Zoology · Cited by 1,679
Ben‐Hur, A., Horn, D., Siegelmann, H. T., & Vapnik, V. N. (2002) · doi:10.5555/944790.944807 · Cited by 1,330
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I
Fan, K. (1949) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.35.11.652 · Cited by 1,016
(2002) · Springer Series in Statistics · doi:10.1007/b98835 · Cited by 919
Graph theory, combinatorics, and applications
Alavi, Y., Chartrand, G., & Oellermann, O. R. (2017) · Cited by 538
Multi-view K-means clustering on big data
Cai, X., Nie, F., & Huang, H. (2013) · International Joint Conference on Artificial Intelligence · Cited by 524
Self-citationXu, L., Neufeld, J., Larson, B., & Schuurmans, D. (2004) · Cited by 462
Spectral Embedded Clustering: A Framework for In-Sample and Out-of-Sample Spectral Clustering
Nie, F., Zeng, Z., Tsang, I. W., Xu, D., & Zhang, C. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2162000 · Cited by 325
Self-citationThe Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering
Li, T., & Ding, C. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.160 · Cited by 315
Multi-View Clustering and Feature Learning via Structured Sparsity
Wang, H., Nie, F., & Huang, H. (2013) · International Conference on Machine Learning · Cited by 312
Self-citationHeterogeneous image feature integration via multi-modal spectral clustering
Cai, X., Nie, F., Huang, H., & Kamangar, F. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995740 · Cited by 260
Self-citationSpectral Rotation versus K-Means in Spectral Clustering
Huang, J., Nie, F., & Huang, H. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8683 · Cited by 188
Self-citationNeighborhood MinMax projections
Nie, F., Xiang, S., & Zhang, C. (2007) · Cited by 96
Self-citation
Cited by
The Constrained Laplacian Rank Algorithm for Graph-Based Clustering
Nie, F., Wang, X., Jordan, M., & Huang, H. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10302 · Cited by 837
Self-citationLarge-Scale Multi-View Spectral Clustering via Bipartite Graph
Li, Y., Nie, F., Huang, H., & Huang, J. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9598 · Cited by 585
Self-citationSelf-weighted Multiview Clustering with Multiple Graphs
Nie, F., Li, J., & Li, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/357 · Cited by 562
Self-citationMulti-View Clustering and Semi-Supervised Classification with Adaptive Neighbours
Nie, F., Cai, G., & Li, X. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10909 · Cited by 557
Self-citationMultiview Consensus Graph Clustering
Zhan, K., Nie, F., Wang, J., & Yang, Y. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2877335 · Cited by 545
Self-citation
Metadata
- Authors
- Nie, F., Wang, X., & Huang, H.
- Venue
- Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2014-08-24
- Pages
- 977-986
- OpenAlex
- W1979089718
- Cited by
- 981
- References
- 25
- FWCI
- 19.96
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.