Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28342
Title: Fusion of feature selection methods for pairwise scoring SVM
Authors: Mak, MW 
Kung, SY
Keywords: Curse of dimensionality
Feature selection
Filter
Kernel methods
Protein sequences
Subcellular localization
Support vector machines
Wrapper
Issue Date: 2008
Publisher: Elsevier Science Bv
Source: Neurocomputing, 2008, v. 71, no. 16-18, p. 3104-3113 How to cite?
Journal: Neurocomputing 
Abstract: It has been recently discovered that stacking the pairwise comparison scores between unknown patterns and a set of known patterns can result in feature vectors with desirable discriminative properties for classification. However, such technique can be hampered by the curse of dimensionality because the vectors size is equal to the training set size. To overcome this problem, this paper investigates various filter and wrapper feature selection techniques for reducing the feature dimension of pairwise scoring matrices and argues that these two types of selection techniques are complementary to each other. Two fusion strategies are then proposed to (1) combine the ranking criteria of filter and wrapper methods at algorithmic level and (2) merge the features selected by the filter and wrapper methods. Evaluations on a subcellular localization benchmark and a microarray dataset demonstrate that feature subsets selected by the fusion methods are either superior to or at least as good as those selected by the individual methods alone for a wide range of feature dimensions.
URI: http://hdl.handle.net/10397/28342
DOI: 10.1016/j.neucom.2008.04.024
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
1
Citations as of Jul 20, 2017

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Jul 15, 2017

Page view(s)

22
Last Week
0
Last month
Checked on Jul 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.