Sciweavers

735 search results - page 34 / 147
» Margin based feature selection - theory and algorithms
Sort
View
JMLR
2012
11 years 10 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
BMCBI
2007
173views more  BMCBI 2007»
13 years 7 months ago
Recursive Cluster Elimination (RCE) for classification and feature selection from gene expression data
Background: Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that a...
Malik Yousef, Segun Jung, Louise C. Showe, Michael...
CN
2006
84views more  CN 2006»
13 years 7 months ago
Dynamic overlay routing based on available bandwidth estimation: A simulation study
Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, tran...
Yong Zhu, Constantinos Dovrolis, Mostafa H. Ammar
ICMLA
2008
13 years 9 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
ICML
2009
IEEE
14 years 8 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...