The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Spectral Rotation versus K-Means in Spectral Clustering
Open accessAbstract
Spectral clustering has been a popular data clustering algorithm. This category of approaches often resort to other clustering methods, such as K-Means, to get the final cluster. The potential flaw of such common practice is that the obtained relaxed continuous spectral solution could severely deviate from the true discrete solution. In this paper, we propose to impose an additional orthonormal constraint to better approximate the optimal continuous solution to the graph cut objective functions. Such a method, called spectral rotation in literature, optimizes the spectral clustering objective functions better than K-Means, and improves the clustering accuracy. We would provide efficient algorithm to solve the new problem rigorously, which is not significantly more costly than K-Means. We also establish the connection between our method andK-Means to provide theoretical motivation of our method. Experimental results show that our algorithm consistently reaches better cut and meanwhile outperforms in clustering metrics than classic spectral clustering methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Martinez, A. M., & Kak, A. C. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.908974 · Cited by 3,249
Cited by
Clustering and projected clustering with adaptive neighbors
Nie, F., Wang, X., & Huang, H. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623726 · Cited by 981
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-citationAuto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised Classification
Nie, F., Cai, G., Li, J., & Li, X. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2754939 · Cited by 406
Self-citationUnified One-Step Multi-View Spectral Clustering
Tang, C., Li, Z., Wang, J., Liu, X., Zhang, W., & Zhu, E. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3172687 · Cited by 318
Multi-omic integration via similarity network fusion to detect molecular subtypes of ageing
Yang, M., Matan-Lithwick, S., Wang, Y., De Jager, P. L., Bennett, D. A., & Felsky, D. (2023) · Brain Communications · doi:10.1093/braincomms/fcad110 · Cited by 35
Metadata
- Authors
- Huang, J., Nie, F., & Huang, H.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2013-06-30
- Volume
- 27
- Issue
- 1
- Pages
- 431-437
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W62192748
- Cited by
- 188
- References
- 2
- FWCI
- 1.30
- Type
- conference paper
- Language
- en
- Open access
- diamond
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spectral Rotation versus K-Means in Spectral Clustering. https://app.cochat.ai/papers/10.1609/aaai.v27i1.8683
- The paper
- Huang, J., Nie, F., & Huang, H. (2013). Spectral Rotation versus K-Means in Spectral Clustering. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v27i1.8683
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.