Spectral clustering and transductive learning with multiple views
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web pages or the words occurring in web pages. When each view is represented as a graph, one may convexly combine the weight matrices or the discrete Laplacians for each graph, and then proceed with existing clustering or classification techniques. Such a solution might sound natural, but its underlying principle is not clear. Unlike this kind of methodology, we develop multiview spectral clustering via generalizing the normalized cut from a single view to multiple views. We further build multiview transductive inference on the basis of multiview spectral clustering. Our framework leads to a mixture of Markov chains defined on every graph. The experimental evaluation on real-world web classification demonstrates promising results that validate our method.
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · neural information processing systems · Cited by 4,777
Self-citationSemi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Transductive learning via spectral graph partitioning
Joachims, T. (2003) · Cited by 633
A Random Walks View of Spectral Segmentation.
Meilă, M., & Shi, J. (2001) · Cited by 623
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
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
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
Consistency of the group Lasso and multiple kernel learning
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3390 · Cited by 669
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
Biesbroek, G., Tsivtsivadze, E., Sanders, E. A. M., Montijn, R., Veenhoven, R. H., Keijser, B. J. F., & Bogaert, D. (2014) · American Journal of Respiratory and Critical Care Medicine · doi:10.1164/rccm.201407-1240oc · Cited by 572
Multi-omic and multi-view clustering algorithms: review and cancer benchmark
Rappoport, N., & Shamir, R. (2018) · Nucleic Acids Research · doi:10.1093/nar/gky889 · Cited by 553
Transductive Multi-View Zero-Shot Learning
Fu, Y., Hospedales, T. M., Xiang, T., & Gong, S. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2408354 · Cited by 514
Xia, T., Tao, D., Mei, T., & Zhang, Y. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2039566 · Cited by 508
On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank Minimization
Xie, Y., Tao, D., Zhang, W., Liu, Y., Zhang, L., & Qu, Y. (2018) · International Journal of Computer Vision · doi:10.1007/s11263-018-1086-2 · Cited by 506
Multi-view clustering: A survey
Yang, Y., & Wang, H. (2018) · Big Data Mining and Analytics · doi:10.26599/bdma.2018.9020003 · Cited by 506
Multiview Clustering: A Scalable and Parameter-Free Bipartite Graph Fusion Method
Li, X., Zhang, H., Wang, R., & Nie, F. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3011148 · Cited by 499
Li, S.-Y., Jiang, Y., & Zhou, Z.-H. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8973 · Cited by 431
Neighborhood Repulsed Metric Learning for Kinship Verification
Lu, J., Zhou, X., Tan, Y.-P., Shang, Y., & Zhou, J. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.134 · Cited by 427
A Survey on Multiview Clustering
Chao, G., Sun, S., & Bi, J. (2021) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3065894 · Cited by 427
Essential Tensor Learning for Multi-View Spectral Clustering
Wu, J., Lin, Z., & Zha, H. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2916740 · Cited by 362
Clustering with Multiple Graphs
Tang, W., Lu, Z., & Dhillon, I. S. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.125 · Cited by 316
Learning a Joint Affinity Graph for Multiview Subspace Clustering
Tang, C., Zhu, X., Liu, X., Li, M., Wang, P., Zhang, C., & Wang, L. (2019) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2018.2889560 · Cited by 288
NEMO: cancer subtyping by integration of partial multi-omic data
Rappoport, N., & Shamir, R. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz058 · Cited by 286
Shao, W., He, L., & Yu, P. S. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-23528-8_20 · Cited by 281
Multi-view clustering via multi-manifold regularized non-negative matrix factorization
Zong, L., Zhang, X., Zhao, L., Yu, H., & Zhao, Q. (2017) · Neural Networks · doi:10.1016/j.neunet.2017.02.003 · Cited by 281
Collaborative Fuzzy Clustering From Multiple Weighted Views
Jiang, Y., Chung, F.-L., Wang, S., Deng, Z., Wang, J., & Qian, P. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2334595 · Cited by 279
Ensemble manifold regularized sparse low-rank approximation for multiview feature embedding
Zhang, L., Zhang, Q., Zhang, L., Tao, D., Huang, X., & Du, B. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2014.12.016 · Cited by 278
Dynamic Affinity Graph Construction for Spectral Clustering Using Multiple Features
Li, Z., Nie, F., Chang, X., Yang, Y., Zhang, C., & Sebe, N. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2829867 · Cited by 268
Feature Selection and Kernel Learning for Local Learning-Based Clustering
Zeng, H., & Cheung, Y.-M. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.215 · Cited by 234
“In this respect, the multiview clustering is also a related work whose goal is to learn a consensus result from multiple representations [39], [46].”
BackgroundA General Model for Multiple View Unsupervised Learning
Long, B., Yu, P. S., & Zhang, Z. (. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.74 · Cited by 232
“For example, [6] focuses on the data of two sets of features, which are assumed to be independent of each other and can be handled by the same algorithm such as k-means or multinomial EM; [36] deals with the data of two graphs which all are assumed to be well explained by a mixture of Markov chains.”
BackgroundOptimized Data Fusion for Kernel k-Means Clustering
Yu, S., Tranchevent, L.-C., Liu, X., Glanzel, W., Suykens, J. A. K., De Moor, B., & Moreau, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.255 · Cited by 231
Data Fusion by Matrix Factorization
Zitnik, M., & Zupan, B. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2343973 · Cited by 207
Deep Multimodal Subspace Clustering Networks
Abavisani, M., & Patel, V. M. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2018.2875385 · Cited by 181
“[35], [50].”
Convex Subspace Representation Learning from Multi-View Data
Guo, Y. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8565 · Cited by 160
“…and Scheffer 2004), the canonical correlation analysis (CCA) method (Chaudhuri et al. 2009), the generalized multi-view normalized cut method (Zhou and Burges 2007), the two-view spectral clustering over bipartite graphs (de Sa 2005), and the multiview spectral clustering methods (Kumar and…”
MethodClustering With Multi-Layer Graphs: A Spectral Perspective
Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2212886 · Cited by 158
“[40], the authors have modeled spectral clustering on a single graph as a random walk process, and then proposed a mixed random walk when two graphs are given.”
BackgroundEvaluation and comparison of multi-omics data integration methods for cancer subtyping
Duan, R., Gao, L., Gao, Y., Hu, Y., Xu, H., Huang, M., Song, K., Wang, H., Dong, Y., Jiang, C., et al. (2021) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1009224 · Cited by 122
Metadata
- Authors
- Zhou, D., & Burges, C. J. C.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 1159-1166
- OpenAlex
- W2136294701
- Cited by
- 437
- References
- 21
- FWCI
- 11.28
- 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.