ACM Home Page
Please provide us with feedback. Feedback
Additive models, boosting, and inference for generalized divergences
Full text PdfPdf (983 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the twelfth annual conference on Computational learning theory table of contents
Santa Cruz, California, United States
Pages: 125 - 133  
Year of Publication: 1999
ISBN:1-58113-167-4
Author
John Lafferty  School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Univ. of California, : University of California at Santa Cruz
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 41,   Citation Count: 14
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/307400.307422
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
O. Barndorff-Nielsen, Information and Exponential Families in Statistical Theory, Wiley, New York, 1978.
 
2
 
3
 
4
 
5
L.M. Bregman, "The relaxation method to find the common point of convex sets and its applications to the solution of problems in convex programming," USSR Computational Mathematics and Mathematical Physics, 7, pp. 200-217, 1967.
 
6
L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regression Trees, Wadsworth, Belmont, MA, 1984.
 
7
J. Carbonell, Y. Yang, J. Lafferty, R. Brown, T Pierce, X. Liu, "CMU Report on TDT-2: Segmentation, detection and tracking" in Proceedings of the 1999 DARPA Broadcast News Conference.
 
8
Y. Censor and A. Lent, "An iterative row-action method for interval convex programming," J. Optim. Theory Appl. 34, pp. 321-353, 1981.
 
9
I. Csisz~r, "Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems," Ann. Statist., 19(4), pp. 2032-2066, 1991.
 
10
I. Csisz~, "Generalized projections for non-negative functions;' Acta Math. Hungar., 68(1-2), pp. 161-185, 1995.
 
11
I. Csisz~r, "Maxent, mathematics, and information theory,'' In Maximum Entropy and Bayesian Methods, K. Hanson and R. Silver, eds., Kluwer Academic Publishers, 1996.
 
12
 
13
S. Della Pietra, V. Della Pietra, and J. Lafferty, "Bregman distances, iterative scaling, and auxiliary functions,'' unpublished manuscript, 1995.
 
14
S. Della Pietra, V. Della Pietra, and J. Lafferty, "Statistical learning algorithms based on Bregman distances,"in Proceedings of the Canadian Workshop on Information Theory, Toronto, 1997.
 
15
Y. Freund and R. Schapire, "Experiments with a new boosting algorithm," in Machine Learning: Proceedings of the Thirteenth International Conference, pp. 148-156.
 
16
J. Friedman, T. Hastie, and R. Tibshirani, "Additive logistic regression: A statistical view of boosting," technical report, Department of Statistics, Stanford University, August 20, 1998.
17
 
18
E.T. Jaynes, Papers on Probability, Statistics, and Statistical Physics, R. Rosenkrantz, ed., D. Reidel Publishing Co., Dordrecht-Holland, 1983.
 
19
20
 
21
R.T Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
 
22
23

CITED BY  14