Sciweavers

486 search results - page 59 / 98
» Boosting and Hard-Core Sets
Sort
View
95
Voted
ECML
2004
Springer
15 years 5 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
HYBRID
2003
Springer
15 years 5 months ago
Hybrid Modelling and Control of Power Electronics
Switched circuits in power electronics by their nature present hybrid behavior. Such circuits can be described by a set of discrete states with associated continuous dynamics. A co...
Matthew Senesky, Gabriel Eirea, Tak-John Koo
ICML
2000
IEEE
15 years 4 months ago
Discriminative Reranking for Natural Language Parsing
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
Michael Collins
KDD
1997
ACM
103views Data Mining» more  KDD 1997»
15 years 4 months ago
Fast Committee Machines for Regression and Classification
In many data mining applications we are given a set of training examples and asked to construct a regression machine or a classifier that has low prediction error or low error rat...
Harris Drucker
121
Voted
DAGM
2007
Springer
15 years 4 months ago
Greedy-Based Design of Sparse Two-Stage SVMs for Fast Classification
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...
Rezaul Karim, Martin Bergtholdt, Jörg H. Kapp...