On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Theoretical Computer Science
Semi-supervised support vector machines
Proceedings of the 1998 conference on Advances in neural information processing systems II
Solving a Class of Linearly Constrained Indefinite QuadraticProblems by D.C. Algorithms
Journal of Global Optimization
Feature Selection via Concave Minimization and Support Vector Machines
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Transductive Inference for Text Classification using Support Vector Machines
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Neural Computation
Variable selection using svm based criteria
The Journal of Machine Learning Research
Leveraging the margin more carefully
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Combined SVM-Based Feature Selection and Classification
Machine Learning
Trading convexity for scalability
ICML '06 Proceedings of the 23rd international conference on Machine learning
Deterministic annealing for semi-supervised kernel machines
ICML '06 Proceedings of the 23rd international conference on Machine learning
A new efficient algorithm based on DC programming and DCA for clustering
Journal of Global Optimization
The Journal of Machine Learning Research
Optimization Techniques for Semi-Supervised Support Vector Machines
The Journal of Machine Learning Research
Hi-index | 0.00 |
In this paper, we develop an efficient method for feature selection in Semi-Supervised Support Vector Machine (S3VM). Using an appropriate continuous approximation of the l0−norm, we reformulate the feature selection S3VM problem as a DC (Difference of Convex functions) program. DCA (DC Algorithm), an innovative approach in nonconvex programming is then developed to solve the resulting problem. Computational experiments on several real-world datasets show the efficiency and the scalability of our method.