| A continuation method for semi-supervised SVMs |
| Full text |
Pdf
(333 KB)
|
| Source
|
ACM International Conference Proceeding Series; Vol. 148
archive
Proceedings of the 23rd international conference on Machine learning
table of contents
Pittsburgh, Pennsylvania
Pages: 185 - 192
Year of Publication: 2006
ISBN:1-59593-383-2
|
|
Authors
|
|
Olivier Chapelle
|
Max Planck Institute for Biological Cybernetics, Tübingen, Germany
|
|
Mingmin Chi
|
Max Planck Institute for Biological Cybernetics, Tübingen, Germany
|
|
Alexander Zien
|
Max Planck Institute for Biological Cybernetics, Tübingen, Germany
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 53, Citation Count: 2
|
|
|
ABSTRACT
Semi-Supervised Support Vector Machines (S3VMs) are an appealing method for using unlabeled data in classification: their objective function favors decision boundaries which do not cut clusters. However their main problem is that the optimization problem is non-convex and has many local minima, which often results in suboptimal performances. In this paper we propose to use a global optimization technique known as continuation to alleviate this problem. Compared to other algorithms minimizing the same objective function, our continuation method often leads to lower test errors.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Astorino, A., & Fuduli, A. (2005). Nonsmooh optimization techniques for semi-supervised classification (Technical Report). U. Pisa, Dipartimento di Matematica. www.dm.unipi.it/mat_dia_med/PAPER_Astorino.pdf.
|
| |
2
|
|
| |
3
|
Chapelle, O. (2006). Training a support vector machine in the primal (Technical Report 147). Max Planck Institute. www.kyb.tuebingen.mpg.de/bs/people/chapelle/primal.
|
| |
4
|
Chapelle, O., Weston, J., & Schöölkopf, B. (2002). Cluster kernels for semi-supervised learning. Advances in Neural Information Processing Systems 15.
|
| |
5
|
Chapelle, O., & Zien, A. (2005). Semi-supervised classification by low density separation. Tenth International Workshop on Artificial Intelligence and Statistics.
|
| |
6
|
Collobert, R., Sinz, F., Weston, J., & Bottou, L. (2006). Large scale transductive SVMs. Journal of Machine Learning Research. Submitted, www.kyb.tuebingen.mpg.de/bs/people/fabee/universvm.html.
|
| |
7
|
|
| |
8
|
Fung, G., & Mangasarian, O. (2001). Semi-supervised support vector machines for unlabeled data classification. Optimization Methods and Software, 29--44.
|
| |
9
|
|
| |
10
|
Joachims, T. (2003). Transductive learning via spectral graph partitioning. International Conference on Machine Learning.
|
| |
11
|
S. Sathiya Keerthi , Dennis DeCoste, A Modified Finite Newton Method for Fast Solution of Large Scale Linear SVMs, The Journal of Machine Learning Research, 6, p.341-361, 9/1/2005
|
| |
12
|
Kimeldorf, G., & Wahba, G. (1971). Some results on tchebycheffian spline functions. J. Math. Anal. Applic., 33, 82--95.
|
| |
13
|
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems.
|
| |
14
|
Schölkopf, B., & Smola, A. (2002). Learning with kernels. Cambridge, MA: MIT Press.
|
| |
15
|
Seeger, M. (2006). A taxonomy of semi-supervised learning methods. In O. Chapelle, B. Schölkopf and A. Zien (Eds.), Semi-supervised lerning. MIT Press.
|
 |
16
|
|
 |
17
|
|
| |
18
|
Vapnik, V., & Sterin, A. (1977). On structural risk minimization or overall risk in a problem of pattern recognition. Automation and Remote Control, 10, 1495--1503.
|
| |
19
|
Vapnik, V. N. (1998). Statistical learning theory. New York: John Wiley & Sons, Inc.
|
| |
20
|
|
|