The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Discriminative cluster analysis
Open accessAbstract
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of programming and because it accomplishes a good trade-off between achieved performance and computational complexity. However, k-means is prone to local minima problems, and it does not scale too well with high dimensional data sets. A common approach to dealing with high dimensional data is to cluster in the space spanned by the principal components (PC). In this paper, we show the benefits of clustering in a low dimensional discriminative space rather than in the PC space (generative). In particular, we propose a new clustering algorithm called Discriminative Cluster Analysis (DCA). DCA jointly performs dimensionality reduction and clustering. Several toy and real examples show the benefits of DCA versus traditional PCA+k-means clustering. Additionally, a new matrix formulation is proposed and connections with related techniques such as spectral graph methods and linear discriminant analysis are provided.
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
Neural networks and principal component analysis: Learning from examples without local minima
Baldi, P., & Hornik, K. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90014-2 · Cited by 1,383
Cited by
Unsupervised deep embedding for clustering analysis
Xie, J., Girshick, R., & Farhadi, A. (2015) · arXiv · doi:10.48550/arxiv.1511.06335 · Cited by 2,476
Image Clustering Using Local Discriminant Models and Global Integration
Yang, Y., Xu, D., Nie, F., Yan, S., & Zhuang, Y. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049235 · Cited by 389
Hierarchical Aligned Cluster Analysis for Temporal Clustering of Human Motion
Zhou, F., De la Torre, F., & Hodgins, J. K. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.137 · Cited by 337
Self-citationSpectral 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
The 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
Metadata
- Authors
- De la Torre, F., & Kanade, T.
- Venue
- Proceedings of the 23rd international conference on Machine learning - ICML '06
- Publisher
- ACM Press
- Published
- 2006
- Pages
- 241-248
- OpenAlex
- W2168466186
- Cited by
- 170
- References
- 1
- FWCI
- 5.52
- Type
- conference paper
- 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: Discriminative cluster analysis. https://app.cochat.ai/papers/10.1145/1143844.1143875
- The paper
- De la Torre, F., & Kanade, T. (2006). Discriminative cluster analysis. Proceedings of the 23rd international conference on Machine learning - ICML '06. https://doi.org/10.1145/1143844.1143875
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.