The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Multi-View Learning With Incomplete Views
Abstract
One underlying assumption of the conventional multi-view learning algorithms is that all examples can be successfully observed on all the views. However, due to various failures or faults in collecting and pre-processing the data on different views, we are more likely to be faced with an incomplete-view setting, where an example could be missing its representation on one view (i.e., missing view) or could be only partially observed on that view (i.e., missing variables). Low-rank assumption used to be effective for recovering the random missing variables of features, but it is disabled by concentrated missing variables and has no effect on missing views. This paper suggests that the key to handling the incomplete-view problem is to exploit the connections between multiple views, enabling the incomplete views to be restored with the help of the complete views. We propose an effective algorithm to accomplish multi-view learning with incomplete views by assuming that different views are generated from a shared subspace. To handle the large-scale problem and obtain fast convergence, we investigate a successive over-relaxation method to solve the objective function. Convergence of the optimization technique is theoretically analyzed. The experimental results on toy data and real-world data sets suggest that studying the incomplete-view problem in multi-view learning is significant and that the proposed algorithm can effectively handle the incomplete views in different applications.
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,411
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
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Canonical 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
A Completed Modeling of Local Binary Pattern Operator for Texture Classification
Guo, Z., Zhang, L., & Zhang, D. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2044957 · Cited by 2,115
Multiple kernel learning, conic duality, and the SMO algorithm
Bach, F. R., Lanckriet, G. R. G., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015424 · Cited by 1,453
Argyriou, A., Evgeniou, T., & Pontil, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0010 · Cited by 1,333
Large Scale Multiple Kernel Learning
Sonnenburg, S., Rätsch, G., Schäfer, C., & Schölkopf, B. (2006) · MPG.PuRe (Max Planck Society) · doi:10.5555/1248547.1248604 · Cited by 1,201
Tri-training: exploiting unlabeled data using three classifiers
Zhou, Z.-H., & Li, M. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.186 · Cited by 1,171
Zhang, W., Shan, S., Gao, W., Chen, X., & Zhang, H. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.147 · Cited by 1,024
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
Multi-view clustering: A survey
Yang, Y., & Wang, H. (2018) · Big Data Mining and Analytics · doi:10.26599/bdma.2018.9020003 · Cited by 506
Revisiting multiple instance neural networks
Wang, X., Yan, Y., Tang, P., Bai, X., & Liu, W. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.08.026 · Cited by 498
COMPLETER: 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
Late Fusion Incomplete Multi-View Clustering
Liu, X., Zhu, X., Li, M., Wang, L., Tang, C., Yin, J., Shen, D., Wang, H., & Gao, W. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2879108 · Cited by 363
Robust Multi-View Clustering With Incomplete Information
Yang, M., Li, Y., Hu, P., Bai, J., Lv, J., & Peng, X. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3155499 · Cited by 332
RGB-D salient object detection: A survey
Zhou, T., Fan, D.-P., Cheng, M.-M., Shen, J., & Shao, L. (2021) · Computational Visual Media · doi:10.1007/s41095-020-0199-z · Cited by 331
Multiple Kernel k-means with Incomplete Kernels
Liu, X., Gao, W., Zhu, X., Li, M., Wang, L., Zhu, E., Liu, T., Kloft, M., Shen, D., & Yin, J. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2892416 · Cited by 300
A Survey on Incomplete Multiview Clustering
Wen, J., Zhang, Z., Fei, L., Zhang, B., Xu, Y., Zhang, Z., & Li, J. (2023) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2022.3192635 · Cited by 256
Metadata
- Authors
- Xu, C., Tao, D., & Xu, C.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2015-12
- Volume
- 24
- Issue
- 12
- Pages
- 5812-5825
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W1937059634
- Cited by
- 260
- References
- 46
- FWCI
- 16.75
- 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.