The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Multi-view clustering via canonical correlation analysis
Abstract
Clustering data in high-dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by projecting the data into a lower-dimensional subspace, e.g. via Principal Components Analysis (PCA) or random projections, before clustering. Such techniques typically require stringent requirements on the separation between the cluster means (in order for the algorithm to be be successful).\nHere, we show how using multiple views of the data can relax these stringent requirements. We use Canonical Correlation Analysis (CCA) to project the data in each view to a lower-dimensional subspace. Under the assumption that conditioned on the cluster label the views are uncorrelated, we show that the separation conditions required for the algorithm to be successful are rather mild (significantly weaker than those of prior results in the literature). We provide results for mixture of Gaussians, mixtures of log concave distributions, and mixtures of product distributions.
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
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
Davis, S., & Mermelstein, P. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163420 · Cited by 5,465 · cited 2×
“The audio features are standard 12-dimensional mel cepstra ( Davis & Mermelstein, 1980 ) and their derivatives and double derivatives computed every 10ms over a 20ms window, and nally concatenated over a window of 440ms centered on the current frame, for a total of 1584 dimensions.”
MethodCanonical Correlation Analysis: An Overview with Application to Learning Methods
Hardoon, D. R., Szedmak, S., & Shawe-Taylor, J. (2004) · Neural Computation · doi:10.1162/0899766042321814 · Cited by 3,202
Learning mixtures of Gaussians
Dasgupta, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814639 · Cited by 588
An Introduction to Mathematical Taxonomy
Dunn, G., & Everitt, B. J. (1982) · Medical Entomology and Zoology · Cited by 348
On Spectral Learning of Mixtures of Distributions
Achlioptas, D., & McSherry, F. (2005) · Lecture notes in computer science · doi:10.1007/11503415_31 · Cited by 237
Correlational spectral clustering
Blaschko, M. B., & Lampert, C. H. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587353 · Cited by 236
Multi-view Regression Via Canonical Correlation Analysis
Kakade, S. M., & Foster, D. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72927-3_8 · Cited by 184
Self-citationA spectral algorithm for learning mixtures of distributions
Vempala, S., & Wang, G. J. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181888 · Cited by 144
A Two-round Variant of EM for Gaussian MixturesPreprint
Dasgupta, S., & Schulman, L. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3850 · Cited by 141
The Spectral Method for General Mixture Models
Kannan, R., Salmasian, H., & Vempala, S. (2005) · Lecture notes in computer science · doi:10.1007/11503415_30 · Cited by 115
Learning Mixtures of Product Distributions using Correlations and Independence
Chaudhuri, K., & Rao, S. B. (n.d.) · Cited by 103
Self-citationBiometric Person Recognition: Face, Speech and Fusion
Sanderson, C. (2008) · Griffith Research Online · Cited by 100
Isotropic PCA and Affine-Invariant Clustering
Brubaker, S. C., & Vempala, S. (2008) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.48 · Cited by 98
Learning mixtures of separated nonspherical Gaussians
Arora, S., & Kannan, R. (2005) · The Annals of Applied Probability · doi:10.1214/105051604000000512 · Cited by 94
Two-view feature generation model for semi-supervised learning
Ando, R. K., & Zhang, T. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273500 · Cited by 90
Isotropic PCA and Affine-Invariant Clustering
Brubaker, S. C., & Vempala, S. (2008) · Bolyai Society mathematical studies · doi:10.1007/978-3-540-85221-6_8 · Cited by 52
Cited by
Multi-view learning overview: Recent progress and new challenges
Zhao, J., Xie, X., Xu, X., & Sun, S. (2017) · Information Fusion · doi:10.1016/j.inffus.2017.02.007 · Cited by 1,002
A Survey on Multi-view Learning
Xu, C., Tao, D., & Xu, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.5634 · Cited by 942
Multi-View Clustering via Joint Nonnegative Matrix Factorization
Liu, J., Wang, C., Gao, J., & Han, J. (2013) · Proceedings of the 2013 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.28 · Cited by 900
Generalized Latent Multi-View Subspace Clustering
Zhang, C., Fu, H., Hu, Q., Cao, X., Xie, Y., Tao, D., & Xu, D. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2877660 · Cited by 739
Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition
Xia, R., Pan, Y., Du, L., & Yin, J. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8950 · Cited by 713
Metadata
- Authors
- Chaudhuri, K., Kakade, S. M., Livescu, K., & Sridharan, K.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 129-136
- OpenAlex
- W2142674578
- Cited by
- 786
- References
- 18
- FWCI
- 13.87
- 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.