Sciweavers

68 search results - page 10 / 14
» On the Margin Explanation of Boosting Algorithms
Sort
View
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 8 months ago
Boosting Multi-Core Reachability Performance with Shared Hash Tables
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
IJCAI
2007
13 years 9 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
CVPR
2007
IEEE
14 years 10 months ago
Generic Face Alignment using Boosted Appearance Model
This paper proposes a discriminative framework for efficiently aligning images. Although conventional Active Appearance Models (AAM)-based approaches have achieved some success, t...
Xiaoming Liu 0002
KAIS
2010
144views more  KAIS 2010»
13 years 6 months ago
Boosting support vector machines for imbalanced data sets
Real world data mining applications must address the issue of learning from imbalanced data sets. The problem occurs when the number of instances in one class greatly outnumbers t...
Benjamin X. Wang, Nathalie Japkowicz
ICML
2008
IEEE
14 years 8 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio