Skip to main navigation Skip to search Skip to main content

Optimal regularization parameters selection for laplacian support vector machine

  • Juntao Li*
  • , Yingmin Jia
  • , Junping Du
  • , Wenlin Li
  • *Corresponding author for this work
  • Beihang University
  • Beijing University of Posts and Telecommunications
  • Henan Normal University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Laplacian support vector machine (LapSVM) is an attracting tool for semi-supervised classification with manifold regularization. In this paper, we devote to selecting the extrinsic and intrinsic regularization parameters. To this end, a fusion of training and validation levels is first proposed, based on which, the optimal regularization parameters selection problem can be cast as a standard semidefinite programming. Then, a hybrid manifold regularization algorithm is also developed, thus eliminating the difficulty of balancing between the ambient space and the intrinsic geometric of the data distribution. Finally, experiments are performed that verify the research results.

Original languageEnglish
Title of host publicationProceedings of the 27th Chinese Control Conference, CCC
Pages464-468
Number of pages5
DOIs
StatePublished - 2008
Event27th Chinese Control Conference, CCC - Kunming, Yunnan, China
Duration: 16 Jul 200818 Jul 2008

Publication series

NameProceedings of the 27th Chinese Control Conference, CCC

Conference

Conference27th Chinese Control Conference, CCC
Country/TerritoryChina
CityKunming, Yunnan
Period16/07/0818/07/08

Keywords

  • Laplacian support vector machine
  • Manifold regularization
  • Semidefinite programming (SDP)

Fingerprint

Dive into the research topics of 'Optimal regularization parameters selection for laplacian support vector machine'. Together they form a unique fingerprint.

Cite this