Sciweavers

13 search results - page 1 / 3
» Oscillating Feature Subset Search Algorithm for Text Categor...
Sort
View
CIARP
2006
Springer
13 years 8 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
SAC
2006
ACM
13 years 11 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
ICPR
2000
IEEE
13 years 9 months ago
Oscillating Search Algorithms for Feature Selection
A new sub-optimal subset search method for feature selection is introduced. As opposed to other till now known subset selection methods the oscillating search is not dependent on ...
Petr Somol, Pavel Pudil
SAC
2008
ACM
13 years 4 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng
SIGIR
2008
ACM
13 years 4 months ago
Deep classification in large-scale text hierarchies
Most classification algorithms are best at categorizing the Web documents into a few categories, such as the top two levels in the Open Directory Project. Such a classification me...
Gui-Rong Xue, Dikan Xing, Qiang Yang, Yong Yu