Sciweavers

1405 search results - page 63 / 281
» Anytime Algorithm for Feature Selection
Sort
View
IJCNN
2000
IEEE
15 years 6 months ago
Adding a Healing Mechanism in the Self-Organizing Feature Map Algorithm
It is often reported in the technique literature that the success of the self-organizing feature map (SOM) formation is critically dependent on the initial weights and the selectio...
Mu-Chun Su, Chien-Hsing Chou, Hsiao-Te Chang
ICMLA
2008
15 years 3 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
Jun Won Lee, Christophe G. Giraud-Carrier
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
15 years 7 months ago
Ensemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
Kees Jong, Jérémie Mary, Antoine Cor...
PLDI
2006
ACM
15 years 8 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
JAIR
2006
102views more  JAIR 2006»
15 years 1 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch