nips nips2003 nips2003-135 nips2003-135-reference knowledge-graph by maker-knowledge-mining

135 nips-2003-Necessary Intransitive Likelihood-Ratio Classifiers


Source: pdf

Author: Gang Ji, Jeff A. Bilmes

Abstract: In pattern classification tasks, errors are introduced because of differences between the true model and the one obtained via model estimation. Using likelihood-ratio based classification, it is possible to correct for this discrepancy by finding class-pair specific terms to adjust the likelihood ratio directly, and that can make class-pair preference relationships intransitive. In this work, we introduce new methodology that makes necessary corrections to the likelihood ratio, specifically those that are necessary to achieve perfect classification (but not perfect likelihood-ratio correction which can be overkill). The new corrections, while weaker than previously reported such adjustments, are analytically challenging since they involve discontinuous functions, therefore requiring several approximations. We test a number of these new schemes on an isolatedword speech recognition task as well as on the UCI machine learning data sets. Results show that by using the bias terms calculated in this new way, classification accuracy can substantially improve over both the baseline and over our previous results. 1


reference text

[1] Jeff Bilmes. Burried Markov models for speech recognition. In IEEE Intl. Conf. on Acoustics, Speech, and Signal Processing, March 1999.

[2] Jeff Bilmes, Gang Ji, and M. Meil˘ . Intransitive likeilhood-ratio classifiers. In Neural Informaa tion Processing Systems: Natural and Synthetic, December 2001.

[3] T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 1991.

[4] Richard O. Duda, Peter E. Hart, and David G. Stork. Pattern Classification. John Wiley and Sons, second edition, 2001.

[5] Nir Friedman, Dan Geiger, and Moises Goldszmidt. Bayesian network classifiers. Machine Learning, 29(2-3):131–163, 1997.

[6] D. S. Jones. Generalised Functions. McCraw-Hill Publishing Company Limited, 1966.

[7] J. Kevorkian. Partial Differential Equations: Analytical Solution Techniques. New York: Springer, 2000.

[8] R. Duncan Luce and Howard Raiffa. Games and Decisions: Introduction and Critical Survey. Dover, 1957.

[9] P. M. Murphy and D. W. Aha. UCI Repository of Machine Learning Database, 1995.

[10] J. Pitrelli, C. Fong, S. H. Wong, J. R. Spitz, and H. C. Lueng. PhoneBook: a phonetically-rich isolated-word telephone-speech database. In IEEE Intl. Conf. on Acoustics, Speech, and Signal Processing, 1995.

[11] W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge, England, second edition, 1992.

[12] M. M. Rao. Measure Theory and Integration. John Wiley and Sons, 1987.

[13] P. D. Straffin. Game Theory and Strategy. The Mathematical Association of America, 1993.