The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Tensorized Bipartite Graph Learning for Multi-View Clustering
Abstract
Despite the impressive clustering performance and efficiency in characterizing both the relationship between the data and cluster structure, most existing graph-based multi-view clustering methods still have the following drawbacks. They suffer from the expensive time burden due to both the construction of graphs and eigen-decomposition of Laplacian matrix. Moreover, none of them simultaneously considers the similarity of inter-view and similarity of intra-view. In this article, we propose a variance-based de-correlation anchor selection strategy for bipartite construction. The selected anchors not only cover the whole classes but also characterize the intrinsic structure of data. Following that, we present a tensorized bipartite graph learning for multi-view clustering (TBGL). Specifically, TBGL exploits the similarity of inter-view by minimizing the tensor Schatten p-norm, which well exploits both the spatial structure and complementary information embedded in the bipartite graphs of views. We exploit the similarity of intra-view by using the [Formula: see text]-norm minimization regularization and connectivity constraint on each bipartite graph. So the learned graph not only well encodes discriminative information but also has the exact connected components which directly indicates the clusters of data. Moreover, we solve TBGL by an efficient algorithm which is time-economical and has good convergence. Extensive experimental results demonstrate that TBGL is superior to the state-of-the-art methods. Codes and datasets are available: https://github.com/xdweixia/TBGL-MVC.
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
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
The MNIST Database of Handwritten Digit Images for Machine Learning Research [Best of the Web]
Deng, L. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2211477 · Cited by 4,836
NUS-WIDE: a real-world web image database from National University of Singapore
Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., & Zheng, Y. (2009) · Proceedings of the ACM International Conference on Image and Video Retrieval · doi:10.1145/1646396.1646452 · Cited by 3,025 · cited 3×
“The number of anchors is set to 37, 400, and 1,000 on Reuters, NUS-WIDE, and Noisy MNIST dataset, respectively.”
InfluentialRandom Features for Large-Scale Kernel Machines
Rahimi, A., & Recht, B. (2007) · Cited by 2,783
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
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Co-regularized Multi-view Spectral Clustering
Kumar, A., Rai, P., & Daumé, H. (2011) · neural information processing systems · Cited by 1,467
Spectral grouping using the nystrom method
Fowlkes, C., Belongie, S., Chung, F., & Malik, J. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262185 · Cited by 1,328
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
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
On Deep Multi-View Representation Learning
Wang, W., Livescu, K., & Bilmes, J. (2015) · Cited by 871
Automated learning of decision rules for text categorization
Apté, C., Damerau, F., & Weiss, S. M. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183423 · Cited by 859
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
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
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
Self-citationA Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
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
Zhang, Z., Liu, L., Shen, F., Shen, H. T., & Shao, L. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2847335 · Cited by 588
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-weighted Multiview Clustering with Multiple Graphs
Nie, F., Li, J., & Li, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/357 · Cited by 562
Large Graph Construction for Scalable Semi-Supervised Learning
Liu, W., He, J., & Chang, S. (2010) · Cited by 554
Graph Learning for Multiview Clustering
Zhan, K., Zhang, C., Guan, J., & Wang, J. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2751646 · Cited by 543
LOCUS: 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
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance
Wang, S., Liu, X., Zhu, X., Zhang, P., Zhang, Y., Gao, F., & Zhu, E. (2022) · IEEE Transactions on Image Processing · doi:10.1109/tip.2021.3131941 · Cited by 517
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
Self-citationMultiview 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
Subspace Clustering by Block Diagonal Representation
Lu, C., Feng, J., Lin, Z., Mei, T., & Yan, S. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2794348 · Cited by 472
Consistent and Specific Multi-View Subspace Clustering
Luo, S., Zhang, C., Zhang, W., & Cao, X. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11617 · Cited by 426
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
Large Scale Spectral Clustering Via Landmark-Based Sparse Representation
Cai, D., & Chen, X. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2358564 · Cited by 346
Efficient and Effective Regularized Incomplete Multi-view Clustering
Liu, X., Li, M., Tang, C., Xia, J., Xiong, J., Liu, L., Kloft, M., & Zhu, E. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2974828 · Cited by 306
COMIC: Multi-view Clustering Without Parameter Selection
Peng, X., Huang, Z., Lv, J., Zhu, H., & Zhou, J. T. (2019) · International Conference on Machine Learning · Cited by 265
Scalable Semi-Supervised Learning by Efficient Anchor Graph Regularization
Wang, M., Fu, W., Hao, S., Tao, D., & Wu, X. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2535367 · Cited by 241
Self-citationEnhanced Tensor RPCA and its Application
Gao, Q., Zhang, P., Xia, W., Xie, D., Gao, X., & Tao, D. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3017672 · Cited by 226
Self-citationXie, Y., Zhang, W., Qu, Y., Dai, L., & Tao, D. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2869789 · Cited by 214
Self-citationTensorized Multi-view Subspace Representation Learning
Zhang, C., Fu, H., Wang, J., Li, W., Cao, X., & Hu, Q. (2020) · International Journal of Computer Vision · doi:10.1007/s11263-020-01307-0 · Cited by 153
K-Multiple-Means: A Multiple-Means Clustering Method with Specified K Clusters
Nie, F., Wang, C., & Li, X. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330846 · Cited by 140
Multiview Subspace Clustering by an Enhanced Tensor Nuclear Norm
Xia, W., Zhang, X., Gao, Q., Shu, X., Han, J., & Gao, X. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3052352 · Cited by 135
Self-citationAuto-weighted multi-view co-clustering with bipartite graphs
Huang, S., Xu, Z., Tsang, I. W.-H., & Kang, Z. (2019) · Information Sciences · doi:10.1016/j.ins.2019.09.079 · Cited by 104
Low-rank tensor constrained co-regularized multi-view spectral clustering
Xu, H., Zhang, X., Xia, W., Gao, Q., & Gao, X. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.08.019 · Cited by 92
Self-citationRobust Flexible Feature Selection via Exclusive L21 Regularization
Ming, D., & Ding, C. H. Q. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/438 · Cited by 45
Self-citationMulti-view projected clustering with graph learning
Gao, Q., Wan, Z., Liang, Y., Wang, Q., Liu, Y., & Shao, L. (2020) · Neural Networks · doi:10.1016/j.neunet.2020.03.020 · Cited by 45
Self-citationA Probabilistic Derivation of LASSO and L12-Norm Feature Selections
Ming, D., Ding, C. H. Q., & Nie, F. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014586 · Cited by 41
Self-citationCross-view classification by joint adversarial learning and class-specificity distribution
Deng, S., Xia, W., Gao, Q., & Gao, X. (2020) · Pattern Recognition · doi:10.1016/j.patcog.2020.107633 · Cited by 12
Self-citation
Cited by
Deep Clustering: A Comprehensive Survey
Ren, Y., Pu, J., Yang, Z., Xu, J., Li, G., Pu, X., Yu, P. S., & He, L. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3403155 · Cited by 276
Metadata
- Authors
- Xia, W., Gao, Q., Wang, Q., Gao, X., Ding, C., & Tao, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2023-04-01
- Volume
- 45
- Issue
- 4
- Pages
- 5187-5202
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W4283827931
- Cited by
- 331
- References
- 45
- FWCI
- 20.60
- Type
- journal article
- 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.