Victor Boyarshinov Dept Computer Science Malik...  Home/Search
Context
Related
| rpi.edu/research/pdf/0522.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/research/tr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Boosting is a meta-learning algorithm which takes as input a set of classifiers and combines these classifiers to obtain a better classifier. We consider the problem of e#ciently and optimally boosting a pair of classifiers by reducing this problem to that of constructing the optimal linear separator for two sets of points in 2 dimensions. Specifically, let each point z be assigned a weight W (z) > 0, where the weighting function can be an arbitrary positive function. We give e#cient (low... (Update)
Active bibliography (related documents): More All
0.6: Ecient Optimal Linear Boosting of A Pair of Classifiers - Victor Boyarshinov Dept (Correct)
0.3: A PAC bound for mixture discriminants - Seeger (2000) (Correct)
0.1: Boosting HMMs with an Application to Speech Recognition - Dimitrakakis, Bengio (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ dept-ecient,
author = "Victor Boyarshinov Dept",
title = "Ecient Optimal Linear Boosting of A Pair of Classifiers",
url = "citeseer.ist.psu.edu/751173.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 2001
1291 The Nature of Statistical Learning Theory (context) - Vapnik - 1995
657 Bagging predictors - Breiman - 1996
509 A decision theoretic generalization of on-line learning and .. - Freund, Schapire - 1997
448 A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984
326 Interior Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovsky - 1994
205 An Introduction to Support Vector Machines (context) - Cristianini, Shawe-Taylor - 2000
129 A polynomial algorithm in linear programming (context) - Khachiyan - 1979
124 Robust linear programming discrimination of two linearly ins.. - Bennett, Mangasarian - 1992
92 Determining the separation of preprocessed polyhedra - a uni.. - Dobkin, Kirkpatrick - 1990
79 Iterative solution of problems of linear and quadratic progr.. (context) - Dikin - 1967
77 A linear algorithm for determining the separation of convex .. (context) - Dobkin, Kirkpatrick - 1985
54 Output-sensitive results on convex hulls (context) - Chan - 1995
50 Freeman and Company (context) - Chvtal - 1983
49 An optimal algorithm for intersecting three-dimensional conv.. (context) - Chazelle - 1989
20 A bayesian committee machine - Tresp - 2000
19 Duality and geometry in SVM classifiers - Bennett, Bredensteiner - 2000
8 An introduction to boosting and leveraging (context) - Meir, atsch - 2003
3 Boosting the margin: a new explanation for the e#ectiveness .. (context) - Bartlett, Freund et al. - 1998
Documents on the same site (http://www.cs.rpi.edu/research/tr.html): More
MIRAGE: A Framework for Mining, Exploring and Visualizing.. - Zaki, Phoophakdee (Correct)
Model Selection and Surface Merging in Reconstruction Algorithms - Bubna, Stewart (1997) (Correct)
G isn't C! - LabVIEW and G as a Computing Language Course - Krishnamoorthy, Schupp (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC