Sciweavers

1017 search results - page 76 / 204
» Constructive and collaborative learning of algorithms
Sort
View
IDA
2007
Springer
15 years 7 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
88
Voted
UAI
2003
15 years 2 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
119
Voted
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
14 years 10 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
CORR
2004
Springer
140views Education» more  CORR 2004»
15 years 20 days ago
Integrating Defeasible Argumentation and Machine Learning Techniques
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
Sergio Alejandro Gómez, Carlos Iván ...
ECCV
1998
Springer
16 years 2 months ago
Active Appearance Models
?We describe a new method of matching statistical models of appearance to images. A set of model parameters control modes of shape and gray-level variation learned from a training ...
Timothy F. Cootes, Gareth J. Edwards, Christopher ...