Sciweavers

114 search results - page 2 / 23
» Feature Subset Selection and Ranking for Data Dimensionality...
Sort
View
AI
2004
Springer
13 years 7 months ago
A selective sampling approach to active feature selection
Feature selection, as a preprocessing step to machine learning, has been very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and imp...
Huan Liu, Hiroshi Motoda, Lei Yu
BMCBI
2010
224views more  BMCBI 2010»
13 years 7 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
ACMSE
2010
ACM
13 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
CIARP
2006
Springer
13 years 11 months ago
Oscillating Feature Subset Search Algorithm for Text Categorization
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
Jana Novovicová, Petr Somol, Pavel Pudil
FUZZIEEE
2007
IEEE
14 years 1 months ago
Distance Measure Assisted Rough Set Feature Selection
Abstract— Feature Selection (FS) is a technique for dimensionality reduction. Its aims are to select a subset of the original features of a dataset which are rich in the most use...
Neil MacParthalain, Qiang Shen, Richard Jensen