The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Multi-View Clustering
Abstract
We consider clustering problems in which the available attributes can be split into two independent subsets, such that either subset suffices for learning. Example applications of this multi-view setting include clustering of Web pages which have an intrinsic view (the pages themselves) and an extrinsic view (e.g., anchor texts of inbound hyperlinks); multi-view learning has so far been studied in the context of classification. We develop and study partitioning and agglomerative, hierarchical multi-view clustering algorithms for text data. We find empirically that the multi-view versions of k-means and EM greatly improve on their single-view counterparts. By contrast, we obtain negative results for agglomerative hierarchical multi-view clustering. Our analysis explains this surprising phenomenon.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
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
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Unsupervised word sense disambiguation rivaling supervised methods
Yarowsky, D. (1995) · Proceedings of the 33rd annual meeting on Association for Computational Linguistics - · doi:10.3115/981658.981684 · Cited by 2,385
A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
Lance, G. N., & Williams, W. T. (1967) · The Computer Journal · doi:10.1093/comjnl/9.4.373 · Cited by 1,696
Statistics of Directional Data
(1972) · Elsevier eBooks · doi:10.1016/c2013-0-07425-7 · Cited by 1,637
Concept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Analyzing the effectiveness and applicability of co-training
Nigam, K., & Ghani, R. (2000) · Proceedings of the ninth international conference on Information and knowledge management · doi:10.1145/354756.354805 · Cited by 1,005
Unsupervised Models for Named Entity Classification
Collins, M., & Singer, Y. (1999) · Cited by 819
Criterion Functions for Document Clustering: Experiments and Analysis
Zhao, Y., & Karypis, G. (2001) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 581
Statistics of Directional Data
Mardia, K. V. (1975) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1975.tb01550.x · Cited by 525
Active + Semi-supervised Learning = Robust Multi-View Learning
Muslea, I., Minton, S., & Knoblock, C. A. (2002) · Cited by 285
PAC Generalization Bounds for Co-training
Dasgupta, S., Littman, M. L., & McAllester, D. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0053 · Cited by 275
Abney, S. P. (2001) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1073083.1073143 · Cited by 229
Brefeld, U., & Scheffer, T. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015350 · Cited by 197
Self-citationGenerative model-based clustering of directional data
Banerjee, A., Dhillon, I. S., Ghosh, J., & Sra, S. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956757 · Cited by 105
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
A survey of multi-view machine learning
Sun, S. (2013) · Neural Computing and Applications · doi:10.1007/s00521-013-1362-6 · Cited by 878
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
- Bickel, S., & Scheffer, T.
- Venue
- Fourth IEEE International Conference on Data Mining (ICDM'04)
- Publisher
- IEEE
- Published
- 2005-03-31
- Pages
- 19-26
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2108502868
- Cited by
- 710
- References
- 17
- FWCI
- 6.92
- 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.