The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Robust continuous clustering
Open accessAbstract
Significance: Clustering is a fundamental experimental procedure in data analysis. It is used in virtually all natural and social sciences and has played a central role in biology, astronomy, psychology, medicine, and chemistry. Despite the importance and ubiquity of clustering, existing algorithms suffer from a variety of drawbacks and no universal solution has emerged. We present a clustering algorithm that reliably achieves high accuracy across domains, handles high data dimensionality, and scales to large datasets. The algorithm optimizes a smooth global objective, using efficient numerical methods. Experiments demonstrate that our method outperforms state-of-the-art clustering algorithms by significant factors in multiple domains.
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
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
A framework for feature selection in clustering
Witten, D. M., & Tibshirani, R. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2010.tm09415 · Cited by 696
Cited by
A General and Adaptive Robust Loss Function
Barron, J. T. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00446 · Cited by 689
A Survey of Clustering With Deep Learning: From the Perspective of Network Architecture
Min, E., Guo, X., Liu, Q., Zhang, G., Cui, J., & Long, J. (2018) · IEEE Access · doi:10.1109/access.2018.2855437 · Cited by 553
Deep Spectral Clustering Using Dual Autoencoder Network
Yang, X., Deng, C., Zheng, F., Yan, J., & Liu, W. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00419 · Cited by 313
Deep Gait Recognition: A Survey
Sepas-Moghaddam, A., & Etemad, A. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3151865 · Cited by 307
Deep learning-based clustering approaches for bioinformatics
Karim, M. R., Beyan, O., Zappa, A., Costa, I. G., Rebholz-Schuhmann, D., Cochez, M., & Decker, S. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbz170 · Cited by 297
Metadata
- Authors
- Shah, S. A., & Koltun, V.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2017-08-29
- Volume
- 114
- Issue
- 37
- Pages
- 9814-9819
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2750867444
- Cited by
- 181
- References
- 5
- FWCI
- 12.14
- Type
- journal article
- Language
- en
- Open access
- green
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: Robust continuous clustering. https://app.cochat.ai/papers/10.1073/pnas.1700770114
- The paper
- Shah, S. A., & Koltun, V. (2017). Robust continuous clustering. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1700770114
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.