loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Fabian Gieseke 1 ; Antti Airola 2 ; Tapio Pahikkala 2 and Oliver Kramer 1

Affiliations: 1 Carl von Ossietzky Universität Oldenburg, Germany ; 2 TUCS and University of Turku, Finland

Keyword(s): Semi-supervised support vector machines, Non-convex optimization, Quasi-Newton methods, Sparse data, Nyström approximation.

Related Ontology Subjects/Areas/Topics: Classification ; Kernel Methods ; Large Margin Methods ; Pattern Recognition ; Sparsity ; Theory and Methods

Abstract: In real-world scenarios, labeled data is often rare while unlabeled data can be obtained in huge quantities. A current research direction in machine learning is the concept of semi-supervised support vector machines. This type of binary classification approach aims at taking the additional information provided by unlabeled patterns into account to reveal more information about the structure of the data and, hence, to yield models with a better classification performance. However, generating these semi-supervised models requires solving difficult optimization tasks. In this work, we present a simple but effective approach to address the induced optimization task, which is based on a special instance of the quasi-Newton family of optimization schemes. The resulting framework can be implemented easily using black box optimization engines and yields excellent classification and runtime results on both artificial and real-world data sets that are superior (or at least competitive) to the ones obtained by competing state-of-the-art methods. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 44.221.43.208

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Gieseke, F.; Airola, A.; Pahikkala, T. and Kramer, O. (2012). SPARSE QUASI-NEWTON OPTIMIZATION FOR SEMI-SUPERVISED SUPPORT VECTOR MACHINES. In Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM; ISBN 978-989-8425-98-0; ISSN 2184-4313, SciTePress, pages 45-54. DOI: 10.5220/0003755300450054

@conference{icpram12,
author={Fabian Gieseke. and Antti Airola. and Tapio Pahikkala. and Oliver Kramer.},
title={SPARSE QUASI-NEWTON OPTIMIZATION FOR SEMI-SUPERVISED SUPPORT VECTOR MACHINES},
booktitle={Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM},
year={2012},
pages={45-54},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003755300450054},
isbn={978-989-8425-98-0},
issn={2184-4313},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM
TI - SPARSE QUASI-NEWTON OPTIMIZATION FOR SEMI-SUPERVISED SUPPORT VECTOR MACHINES
SN - 978-989-8425-98-0
IS - 2184-4313
AU - Gieseke, F.
AU - Airola, A.
AU - Pahikkala, T.
AU - Kramer, O.
PY - 2012
SP - 45
EP - 54
DO - 10.5220/0003755300450054
PB - SciTePress