Boosting density function estimators

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2430, Issue , 2002, Pages 431-443

  Thollard, Franck ^a   Sebban, Marc ^a   Ezequel, Philippe ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; MACHINE LEARNING;

ADABOOST ALGORITHM; CLASSIFICATION ALGORITHM; CLASSIFICATION ERRORS; CLASSIFICATION TASKS; COMPUTATIONAL BIOLOGY; DENSITY ESTIMATION; NATURAL LANGUAGE PROCESSING; PROBABILISTIC AUTOMATA;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84945279418     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36755-1_36     Document Type: Conference Paper

References (21)

1. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36(1-2): 105-139, 1999.
2. P. Bladi, Y. Chavin, and T. Hunkapillerand McClure. Hidden markov models of biological primary sequence information. In National Academy of Science, pages 1059-1063, USA, 1991.
3. Andrew Brown and Geoffrey Hinton. Products of hidden markov models. In T. Jaakkola and T. Richardson, editors, Artificial Intelligence and Statistics, pages 3-11. Morgan Kaufmann, 2001.
4. Y. Freund and R. E. Shapire. A decision theoretic generalization of online learning and an application to boosting. Intl. Journal of Computer and System Sciences, 55(1): 119-139, 1997.
5. Joshua Goodman. A bit of progress in language modeling. Technical report, Microsoft Reserach, 2001.
6. L. Hirschman. Multi-site data collection for a spoken language corpus. In DARPA Speech and Natural Language Workshop, pages 7-14, 1992.
7. Frederick Jelinek. Statistical Methods for Speech Recognition. The MIT Press, Cambridge, Massachusetts, 1998.
8. D. Jurafsky and J. H. Martin. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall, Englewood Cliffs, New Jersey, 2000.
9. M. J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. E. Schapire, and L. Sellie. On the learnability of discrete distributions. In Proc. of the 25th Annual ACM Symposium on Theory of Computing, pages 273-282, 1994.
10. Anders Krogh, Michael Brown, I. Saira Mian, Kimmen Sjolander, and David Haussler. Hidden markov models in computational biology: Applications to protein modeling. Journal of Molecular Biology, 235: 1501-1531, 1994.
11. R. Maclin and D. Opitz. An empirical evaluation of bagging and boosting. In Proc. of the Fourteenth Natl. Conf. on Artificial Intelligence, pages 546-551, 1997.
12. E. Roche and Yves Schabes. Finite-State Language Processing. MIT Press, 1997.
13. D. Ron, Y. Singer, and N. Tishby. On the learnability and usage of acyclic probabilistic finite automata. In ACM, pages 31-40, Santa Cruz, 1995. COLT’95.
14. E. Tjong Kim Sang. Text chunking by system combination. In CoNLLL-2000 and LLL-2000, pages 151-153, Lisbon, Portugal, 2000.
15. R. E. Schapire, Y. Freund, P. Bartlett, and W. Sun Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics, 1998.
16. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidencerated predictions. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998.
17. M. Sebban and R. Nock. Contribution of boosting in wrapper models. In Proc. of the Thirth European Conf. on Principles and Practice of Knowledge Discovery in Databases, pages 214-222, 1999.
18. M. Sebban, R. Nock, and S. Lallich. Boosting neighborhood-based classifiers. In Proc. of the Seventeenth Intl. Conf. on Machine Learning, 2001.
19. A. Stolcke and S. Omohundro. Inducting probabilistic grammars by bayesian model merging. In Lecture Notes in Artifitial Intelligence, editor, Second Intl Collo. on Gramatical Inference, 862, pages 106-118. ICGI-94, 1994.
20. F. Thollard. Improving probabilistic grammatical inference core algorithms with post-processing techniques. In Eighth Intl. Conf. on Machine Learning, pages 561-568, Williams, July 2001. Morgan Kauffman.
21. F. Thollard, P. Dupont, and C. de la Higuera. Probabilistic dfa inference using kullback-leibler divergence and minimality. In Pat Langley, editor, Seventh Intl. Conf. on Machine Learning, San Francisco, June 2000. Morgan Kaufmann.