The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
k -means projective clustering
Abstract
In many applications it is desirable to cluster high dimensional data along various subspaces, which we refer to as projective clustering. We propose a new objective function for projective clustering, taking into account the inherent trade-off between the dimension of a subspace and the induced clustering error. We then present an extension of the k-means clustering algorithm for projective clustering in arbitrary subspaces, and also propose techniques to avoid local minima. Unlike previous algorithms, ours can choose the dimension of each cluster independently and automatically. Furthermore, experimental results show that our algorithm is significantly more accurate than the previous approaches.
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
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Cited by
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Vidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
Low rank subspace clustering (LRSC)
Vidal, R., & Favaro, P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.08.006 · Cited by 482
A geometric analysis of subspace clustering with outliers
Soltanolkotabi, M., & Candés, E. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1034 · Cited by 411
How slow is the k -means method?
Arthur, D., & Vassilvitskii, S. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137880 · Cited by 304
Metadata
- Authors
- Agarwal, P. K., & Mustafa, N. H.
- Venue
- Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 2004-06-14
- Pages
- 155-165
- OpenAlex
- W2118858274
- Cited by
- 184
- References
- 1
- FWCI
- 3.47
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: k -means projective clustering. https://app.cochat.ai/papers/10.1145/1055558.1055581
- The paper
- Agarwal, P. K., & Mustafa, N. H. (2004). k -means projective clustering. Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. https://doi.org/10.1145/1055558.1055581
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.