Skip to main navigation Skip to search Skip to main content

Feature selection via maximizing neighborhood soft margin

  • Qinghua Hu*
  • , Xunjian Che
  • , Jinfu Liu
  • *Corresponding author for this work
  • Harbin Institute of Technology

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

Abstract

Feature selection is considered to be a key preprocessing step in machine learning and pattern recognition. Feature evaluation is one of the key issues for constructing a feature selection algorithm. In this work, we propose a new concept of neighborhood margin and neighborhood soft margin to measure the minimal distance between different classes. We use the criterion of neighborhood soft margin to evaluate the quality of candidate features and construct a forward greedy algorithm for feature selection. We conduct this technique on eight classification learning tasks. Compared with the raw data and other three feature selection algorithms, the proposed technique is effective in most of the cases.

Original languageEnglish
Title of host publicationAdvances in Machine Learning - First Asian Conference on Machine Learning, ACML 2009, Proceedings
Pages150-161
Number of pages12
DOIs
StatePublished - 2009
Event1st Asian Conference on Machine Learning, ACML 2009 - Nanjing, China
Duration: 2 Nov 20094 Nov 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5828 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st Asian Conference on Machine Learning, ACML 2009
Country/TerritoryChina
CityNanjing
Period2/11/094/11/09

Fingerprint

Dive into the research topics of 'Feature selection via maximizing neighborhood soft margin'. Together they form a unique fingerprint.

Cite this