415 search results - page 5 / 83 » On the Complexity of Discrete Feature Selection for Optimal ... |
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
KDD
2010
ACM
13 years 5 months ago
2010
ACM
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
KDD
2002
ACM
14 years 7 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
EWCBR
2006
Springer
13 years 11 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...