Neural Computation
The nature of statistical learning theory
The nature of statistical learning theory
Advances in Large Margin Classifiers
Advances in Large Margin Classifiers
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
A continuation method for semi-supervised SVMs
ICML '06 Proceedings of the 23rd international conference on Machine learning
Label propagation through linear neighborhoods
ICML '06 Proceedings of the 23rd international conference on Machine learning
Working Set Selection Using Second Order Information for Training Support Vector Machines
The Journal of Machine Learning Research
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
The Journal of Machine Learning Research
Kernel regression with order preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
From graphs to manifolds – weak and strong pointwise consistency of graph laplacians
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Towards a theoretical foundation for laplacian-based manifold methods
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Transductive Classification via Dual Regularization
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
A two-step framework for highly nonlinear data unfolding
Neurocomputing
Improving search via personalized query expansion using social media
Information Retrieval
Hi-index | 0.00 |
In this paper, we propose a semi-supervised learning (SSL) algorithm based on local and global regularization. In the local regularization part, our algorithm constructs a regularized classifier for each data point using its neighborhood, while the global regularization part adopts a Laplacian regularizer to smooth the data labels predicted by those local classifiers. We show that some existing SSL algorithms can be derived from our framework. Finally we present some experimental results to show the effectiveness of our method.