Sciweavers

390 search results - page 41 / 78
» A Model of Inductive Bias Learning
Sort
View
ECML
2006
Springer
14 years 11 days ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
ICDM
2010
IEEE
154views Data Mining» more  ICDM 2010»
13 years 6 months ago
Discrimination Aware Decision Tree Learning
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...
Faisal Kamiran, Toon Calders, Mykola Pechenizkiy
PAMI
2006
136views more  PAMI 2006»
13 years 8 months ago
Data Driven Image Models through Continuous Joint Alignment
This paper presents a family of techniques that we call congealing for modeling image classes from data. The idea is to start with a set of images and make them appear as similar a...
Erik G. Learned-Miller
ICML
2009
IEEE
14 years 9 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ALT
2008
Springer
14 years 5 months ago
Learning with Temporary Memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
Steffen Lange, Samuel E. Moelius, Sandra Zilles