Sciweavers

877 search results - page 74 / 176
» Selection of Subsets of Ordered Features in Machine Learning
Sort
View
ICML
2003
IEEE
16 years 4 months ago
The Set Covering Machine with Data-Dependent Half-Spaces
We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...
Mario Marchand, Mohak Shah, John Shawe-Taylor, Mar...
ILP
2003
Springer
15 years 9 months ago
A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting
Boosting has established itself as a successful technique for decreasing the generalization error of classification learners by basing predictions on ensembles of hypotheses. Whil...
Susanne Hoche, Stefan Wrobel
ICML
2005
IEEE
16 years 4 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
ML
2006
ACM
131views Machine Learning» more  ML 2006»
15 years 3 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
MICCAI
2010
Springer
15 years 2 months ago
Sparse Bayesian Learning for Identifying Imaging Biomarkers in AD Prediction
Abstract. We apply sparse Bayesian learning methods, automatic relevance determination (ARD) and predictive ARD (PARD), to Alzheimer’s disease (AD) classification to make accura...
Li Shen, Yuan Qi, Sungeun Kim, Kwangsik Nho, Jing ...