Statistical Learning Algorithms Based on Bregman Distances (1997)

by John Lafferty , Stephen Della Pietra , Vincent Della Pietra
Citations:23 - 1 self

Documents Related by Co-Citation

260 The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming – L Bregman - 1967
1217 Additive Logistic Regression: a Statistical View of Boosting – Jerome Friedman, Trevor Hastie, Robert Tibshirani - 1998
180 Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems. The Annals of Statistics – I Csiszár - 1991
554 Inducing Features of Random Fields – Stephen Della Pietra, Vincent Della Pietra, John Lafferty - 1997
698 Improved Boosting Algorithms Using Confidence-rated Predictions – Robert E. Schapire , Yoram Singer - 1999
203 Logistic Regression, AdaBoost and Bregman Distances – Michael Collins, Robert E. Schapire, Yoram Singer - 2000
1625 Experiments with a New Boosting Algorithm – Yoav Freund, Robert E. Schapire - 1996
58 Boosting as Entropy Projection – Jyrki Kivinen, Manfred K. Warmuth - 1999
43 Understanding the Yarowsky Algorithm – Steven Abney - 2004
1244 Combining labeled and unlabeled data with co-training – Avrim Blum, Tom Mitchell - 1998
144 Products of Experts – Geoffrey E. Hinton - 1999
486 Unsupervised word sense disambiguation rivaling supervised methods – David Yarowsky - 1995
268 Learning from Labeled and Unlabeled Data using Graph Mincuts – Avrim Blum , Shuchi Chawla - 2001
74 generalization bounds for co-training – S Dasgupta, M L Littman, D PAC McAllester - 2001
8569 Elements of Information Theory – T M Cover, J A Thomas - 1991
3 The Information Regularization Framework for – A Corduneanu - 2006
81 Semi-supervised Learning by Entropy Minimization – Yves Grandvalet, Yoshua Bengio
10 mathematics and Information Theory – I Csiszár, Maxent - 1995
1082 A Maximum Entropy approach to Natural Language Processing – Adam L. Berger, Stephen A. Della Pietra , Vincent J. Della Pietra - 1996