The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Large-Margin Multi-ViewInformation Bottleneck
Abstract
In this paper, we extend the theory of the information bottleneck (IB) to learning from examples represented by multi-view features. We formulate the problem as one of encoding a communication system with multiple senders, each of which represents one view of the data. Based on the precise components filtered out from multiple information sources through a "bottleneck", a margin maximization approach is then used to strengthen the discrimination of the encoder by improving the code distance within the frame of coding theory. The resulting algorithm therefore inherits all the merits of the IB principle and coding theory. It has two distinct advantages over existing algorithms, namely, that our method finds a tradeoff between the accuracy and complexity of the multi-view model, and that the encoded multi-view data retains sufficient discrimination for classification. We also derive the robustness and generalization error bound of the proposed algorithm, and reveal the specific properties of multi-view learning. First, the complementarity of multi-view features guarantees the robustness of the algorithm. Second, the consensus of multi-view features reduces the empirical Rademacher complexity of the objective function, enhances the accuracy of the solution, and improves the generalization error bound of the algorithm. The resulting objective function is solved efficiently using the alternating direction method. Experimental results on annotation, classification and recognition tasks demonstrate that the proposed algorithm is promising for practical 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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
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
Hmdb: a large video database for human motion recognition
Kuehne, H., Jhuang, H., Garrote, E., Poggio, T., & Serre, T. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126543 · Cited by 3,965
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
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
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/jmlr.2003.3.4-5.993 · Cited by 3,024
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
Advances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
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
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
Cutting-plane training of structural SVMs
Joachims, T., Finley, T., & Yu, C.-N. J. (2009) · Machine Learning · doi:10.1007/s10994-009-5108-8 · Cited by 958
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Multi-view clustering via canonical correlation analysis
Chaudhuri, K., Kakade, S. M., Livescu, K., & Sridharan, K. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553391 · Cited by 786
Generalized Multiview Analysis: A discriminative latent space
Sharma, A., Kumar, A., Daume, H., & Jacobs, D. W. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247923 · Cited by 714
A Probabilistic Interpretation of Canonical Correlation Analysis
Bach, F., & Jordan, M. I. (2005) · Cited by 421
Multimodal semi-supervised learning for image classification
Guillaumin, M., Verbeek, J., & Schmid, C. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540120 · Cited by 418
Xu, H., & Mannor, S. (2012) · Machine Learning · doi:10.1007/s10994-011-5268-1 · Cited by 377
Morik, K. J., Brockhausen, P., & Joachims, T. (1999) · RePEc: Research Papers in Economics · Cited by 350
A Co-Regularization Approach to Semi-supervised Learning with Multiple Views
Sindhwani, V., Niyogi, P., & Belkin, M. (2005) · Cited by 330
Two view learning: SVM-2K, Theory and Practice
Farquhar, J. D. R., Hardoon, D. R., Meng, H., Shawe-Taylor, J. S., & Szedmák, S. (2005) · Brunel University Research Archive (BURA) (Brunel University London) · Cited by 325
Multiview Hessian Regularization for Image Annotation
Liu, W., & Tao, D. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2255302 · Cited by 254
Self-citationFast alternating linearization methods for minimizing the sum of two convex functions
Goldfarb, D., Ma, S., & Scheinberg, K. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0530-2 · Cited by 246
MedLDA: maximum margin supervised topic models for regression and classification
Zhu, J., Ahmed, A., & Xing, E. P. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553535 · Cited by 232
Semisupervised Multiview Distance Metric Learning for Cartoon Synthesis
Yu, J., Wang, M., & Tao, D. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2207395 · Cited by 225
Self-citationMulti-view Discriminant Analysis
Kan, M., Shan, S., Zhang, H., Lao, S., & Chen, X. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33718-5_58 · Cited by 196
Multi-view Regression Via Canonical Correlation Analysis
Kakade, S. M., & Foster, D. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72927-3_8 · Cited by 184
Factorized Latent Spaces with Structured Sparsity
Jia, Y., Salzmann, M., & Darrell, T. (2010) · Cited by 177
Multiview Vector-Valued Manifold Regularization for Multilabel Image Classification
Luo, Y., Tao, D., Xu, C., Xu, C., Liu, H., & Wen, Y. (2013) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2238682 · Cited by 153
Self-citationm-SNE: Multiview Stochastic Neighbor Embedding
Xie, B., Mu, Y., Tao, D., & Huang, K. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2106208 · Cited by 131
Self-citationSparse Probabilistic Projections
Archambeau, C., & Bach, F. (2009) · Cited by 126
Predictive Subspace Learning for Multi-view Data: a Large Margin Approach
Chen, N., Zhu, J., & P. Xing, E. (2018) · KiltHub Repository · doi:10.1184/r1/6476258 · Cited by 120
Large-Margin Predictive Latent Subspace Learning for Multiview Data Analysis
Chen, N., Zhu, J., Sun, F., & Xing, E. P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.64 · Cited by 113
Multi-view latent variable discriminative models for action recognition
Song, Y., Morency, L., & Davis, R. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6247918 · Cited by 83
Sufficient dimensionality reduction
Globerson, A., & Tishby, N. (2003) · doi:10.5555/944919.944975 · Cited by 80
Multiview Fisher Discriminant Analysis
Diethe, T., Hardoon, D. R., & Shawe-Taylor, J. S. (2008) · Cited by 74
Ye, G., Chen, Y., & Xie, X. S. (2011) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 48
Constructing Nonlinear Discriminants from Multiple Data Views
Diethe, T., Hardoon, D. R., & Shawe-Taylor, J. S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15880-3_27 · Cited by 44
Shared Kernel Information Embedding for Discriminative Inference
Memisevic, R., Sigal, L., & Fleet, D. J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.154 · Cited by 35
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation
Suzuki, T., & Sugiyama, M. (2010) · Cited by 35
Improved Loss Bounds For Multiple Kernel Learning
Hussain, Z., & Shawe-Taylor, J. S. (2011) · Cited by 24
Memisevic, R. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143924 · Cited by 14
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
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-citationTrusted Multi-View Classification With Dynamic Evidential Fusion
Han, Z., Zhang, C., Fu, H., & Zhou, J. T. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3171983 · Cited by 536
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-citationRobust Face Recognition via Multimodal Deep Face Representation
Ding, C., & Tao, D. (2015) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2015.2477042 · Cited by 449
“Multimodal systems that fuse multiple feature cues are also employed in other topics of multimedia and computer vision, e . g ., visual tracking [20], image classification [21], [22], [23], and social media analysis [24], [25], [26], [27], [28].”
BackgroundSelf-citation
Metadata
- Authors
- Xu, C., Tao, D., & Xu, C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2014-08
- Volume
- 36
- Issue
- 8
- Pages
- 1559-1572
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2105610271
- Cited by
- 257
- References
- 45
- FWCI
- 56.78
- 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.