The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Self-weighted Multiview Clustering with Multiple Graphs
Open accessAbstract
In multiview learning, it is essential to assign a reasonable weight to each view according to its importance. Thus, for multiview clustering task, a wise and elegant method should achieve clustering multiview data while learning the view weights. In this paper, we address this problem by exploring a Laplacian rank constrained graph, which can be approximately as the centroid of the built graph for each view with different confidences. We start our work with a natural thought that the weights can be learned by introducing a hyperparameter. By analyzing the weakness of it, we further propose a new multiview clustering method which is totally self-weighted. Furthermore, once the target graph is obtained in our models, we can directly assign the cluster label to each data point and do not need any postprocessing such as $K$-means in standard spectral clustering. Evaluations on two synthetic datasets prove the effectiveness of our methods. Compared with several representative graph-based multiview clustering approaches on four real-world datasets, experimental results demonstrate that the proposed methods achieve the better performances and our new clustering method is more practical to use.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
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
Fei-Fei, L., Fergus, R., & Perona, P. (2005) · 2004 Conference on Computer Vision and Pattern Recognition Workshop · doi:10.1109/cvpr.2004.383 · Cited by 2,502
Fei-Fei, L., Fergus, R., & Perona, P. (2007) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2005.09.012 · Cited by 2,359
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization
Nie, F., Huang, H., Cai, X., & Ding, C. H. Q. (2010) · neural information processing systems · Cited by 2,231
Self-citationSelf-Tuning Spectral Clustering
Zelnik‐Manor, L., & Perona, P. (2004) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,942
Co-regularized Multi-view Spectral Clustering
Kumar, A., Rai, P., & Daumé, H. (2011) · neural information processing systems · Cited by 1,467
Iteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I
Fan, K. (1949) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.35.11.652 · Cited by 1,016
Clustering and projected clustering with adaptive neighbors
Nie, F., Wang, X., & Huang, H. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623726 · Cited by 981
Self-citationA Co-training Approach for Multi-view Spectral Clustering
Kumar, A., & Daumé, H. (2011) · International Conference on Machine Learning · Cited by 933
The Constrained Laplacian Rank Algorithm for Graph-Based Clustering
Nie, F., Wang, X., Jordan, M., & Huang, H. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10302 · Cited by 837
Self-citationDocument clustering using locality preserving indexing
Cai, D., He, X., & Han, J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.198 · Cited by 835
Nie, F., Li, J., & Li, X. (2016) · Institutional Repository of Xi'an Institute of Optics and Fine Mechanics, Chinese Academy of Sciences (Xian Institute of Optics and Precision Mechanics) · Cited by 776
Self-citationRobust 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
The Laplacian spectrum of graphs
Newman, M. (2001) · Library and Archives Canada (Government of Canada) · Cited by 674
Large-Scale Multi-View Spectral Clustering via Bipartite Graph
Li, Y., Nie, F., Huang, H., & Huang, J. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9598 · Cited by 585
Self-citationLOCUS: learning object classes with unsupervised segmentation
Winn, J., & Jojic, N. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.148 · Cited by 520
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
Heterogeneous image feature integration via multi-modal spectral clustering
Cai, X., Nie, F., Huang, H., & Kamangar, F. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995740 · Cited by 260
Self-citationMulti-view clustering ensembles
Xie, X., & Sun, S. (2013) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2013.6890443 · Cited by 56
Cited by
GMC: Graph-Based Multi-View Clustering
Wang, H., Yang, Y., & Liu, B. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2903810 · Cited by 952
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
Self-citationCOMPLETER: Incomplete Multi-view Clustering via Contrastive Prediction
Lin, Y., Gou, Y., Liu, Z., Li, B., Lv, J., & Peng, X. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01102 · Cited by 442
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
Multi-level Feature Learning for Contrastive Multi-view Clustering
Xu, J., Tang, H., Ren, Y., Peng, L., Zhu, X., & He, L. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01558 · Cited by 395
Metadata
- Authors
- Nie, F., Li, J., & Li, X.
- Venue
- Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
- Published
- 2017-08
- Pages
- 2564-2570
- OpenAlex
- W2740464254
- Cited by
- 562
- References
- 22
- FWCI
- 14.48
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.