Matrix computations (3rd ed.)
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Clustering with Instance-level Constraints
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 12 - Volume 12
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
A Discriminative Learning Framework with Pairwise Constraints for Video Object Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
The Journal of Machine Learning Research
Learning nonparametric kernel matrices from pairwise constraints
Proceedings of the 24th international conference on Machine learning
Pairwise constraint propagation by semidefinite programming for semi-supervised classification
Proceedings of the 25th international conference on Machine learning
Improving Classification with Pairwise Constraints: A Margin-Based Approach
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Semi-supervised metric learning by maximizing constraint margin
Proceedings of the 17th ACM conference on Information and knowledge management
Spectral kernel learning for semi-supervised classification
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Semi-Supervised Learning
Semisupervised kernel matrix learning by kernel propagation
IEEE Transactions on Neural Networks
LIBSVM: A library for support vector machines
ACM Transactions on Intelligent Systems and Technology (TIST)
Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast density-weighted low-rank approximation spectral clustering
Data Mining and Knowledge Discovery
Laplacian Support Vector Machines Trained in the Primal
The Journal of Machine Learning Research
A Family of Simple Non-Parametric Kernel Learning Algorithms
The Journal of Machine Learning Research
Fast affinity propagation clustering: A multilevel approach
Pattern Recognition
Learning Spectral Embedding for Semi-supervised Clustering
ICDM '11 Proceedings of the 2011 IEEE 11th International Conference on Data Mining
Graph dual regularization non-negative matrix factorization for co-clustering
Pattern Recognition
Metric and kernel learning using a linear transformation
The Journal of Machine Learning Research
Learning a distance metric by empirical loss minimization
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Non-Negative Patch Alignment Framework
IEEE Transactions on Neural Networks
Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
IEEE Transactions on Image Processing
Semi-supervised learning with nuclear norm regularization
Pattern Recognition
Hi-index | 0.00 |
Recently, integrating new knowledge sources such as pairwise constraints into various classification tasks with insufficient training data has been actively studied in machine learning. In this paper, we propose a novel semi-supervised classification approach, called semi-supervised classification with enhanced spectral kernel, which can simultaneously handle both sparse labeled data and additional pairwise constraints together with unlabeled data. Specifically, we first design a non-parameter spectral kernel learning model based on the squared loss function. Then we develop an efficient semi-supervised classification algorithm which takes advantage of Laplacian spectral regularization: semi-supervised classification with enhanced spectral kernel under the squared loss (ESKS). Finally, we conduct many experiments on a variety of synthetic and real-world data sets to demonstrate the effectiveness of the proposed ESKS algorithm.