|
167
|
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
– L M Bregman
- 1967
|
|
465
|
Inducing Features of Random Fields
– Stephen Della Pietra, Vincent Della Pietra, John Lafferty
- 1997
|
|
946
|
Combining labeled and unlabeled data with co-training
– Avrim Blum, Tom Mitchell
- 1998
|
|
171
|
Logistic Regression, AdaBoost and Bregman Distances
– Michael Collins, Robert E. Schapire, Yoram Singer
- 2000
|
|
126
|
Why least squares and maximum entropy: An axiomatic approach to inference for linear inverse problems. Annals of Stat 19(4
– I Csiszar
- 1991
|
|
896
|
Additive Logistic Regression: a Statistical View of Boosting
– Jerome Friedman, Trevor Hastie, Robert Tibshirani
- 1998
|
|
561
|
Improved Boosting Algorithms Using Confidence-rated Predictions
– Robert E. Schapire , Yoram Singer
- 1999
|
|
51
|
Boosting as Entropy Projection
– Jyrki Kivinen, Manfred K. Warmuth
- 1999
|
|
112
|
Products of Experts
– Geoffrey E. Hinton
- 1999
|
|
383
|
Unsupervised word sense disambiguation rivaling supervised methods
– David Yarowsky
- 1995
|
|
202
|
Learning from Labeled and Unlabeled Data using Graph Mincuts
– Avrim Blum , Shuchi Chawla
- 2001
|
|
58
|
generalization bounds for co-training
– S Dasgupta, M L Littman, D PAC McAllester
- 2001
|
|
34
|
Understanding the Yarowsky Algorithm
– Steven Abney
- 2004
|
|
847
|
A Maximum Entropy approach to Natural Language Processing
– Adam L. Berger, Stephen A. Della Pietra , Vincent J. Della Pietra
- 1996
|
|
1325
|
Experiments with a New Boosting Algorithm
– Yoav Freund, Robert E. Schapire
- 1996
|
|
6517
|
Elements of information theory
– T Cover, J Thomas
- 1991
|
|
4405
|
A mathematical theory of communication
– C E Shannon
- 1948
|
|
3
|
The Information Regularization Framework for
– A Corduneanu
- 2006
|
|
55
|
Semi-supervised learning by entropy minimization
– Y Grandvalet, Y Bengio
- 2005
|