Bhattacharyya and expected likelihood kernels

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 57-71

  Jebara, Tony ^a   Kondor, Risi ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA ACQUISITION; ESTIMATION; INTEGRATION; MARKOV PROCESSES; PROBABILITY; PROTEINS; STATISTICAL METHODS; VECTORS; BAYESIAN NETWORKS; CLASSIFICATION (OF INFORMATION); TEXT PROCESSING;

DESIGN PROCESS; HIDDEN MARKOV MODEL (HMM) LITERATURE; STATISTICAL TOOLS; SUPPORT VECTOR MACHINES (SVM); CLOSED FORM; EXPECTED LIKELIHOOD KERNEL; EXPONENTIAL FAMILY MODELS; GENERATIVE MODEL; MULTINOMIAL MODEL; PROTEIN SEQUENCE CLASSIFICATION; SAMPLING METHOD; TEXT CLASSIFICATION;

LEARNING SYSTEMS; HIDDEN MARKOV MODELS;

EID: 9444269199     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_6     Document Type: Conference Paper

References (26)

1. F Aherne, N. Thacker, and P. Rocket t. The Bhattacharyya metric as an absolute similarity measure for frequency coded data. Kybernetika, 32(4): 1-7, 1997.
2. O. Barndorff-Nielsen. Information and Exponential Families in Statistical Theory. John Wiley & Sons, 1978.
3. Y. Bengio and P. Frasconi. Input-output HMM's for sequence processing. IEEE Transactions on Neural Networks, 7(5):1231-1249, September 1996.
4. A. Bhattacharyya. On a measure of divergence between two statistical populations denned by their probability distributions. Bull. Calcutta Math Soc., 1943.
5. C. Bishop. Neural Networks for Pattern Recognition. Oxford Press, 1996.
6. M. Collins and N. Duffy. Convolution kernels for natural language. In Neural Information Processing Systems 14, 2002.
7. C. Cortes, P. Haffner, and M. Mohri. Rational kernels. In Neural Information Processing Systems 15, 2002.
8. F. Girosi, M. Jones, and T. Poggio. Regularization theory and neural network architectures. Neural Computation, 7:219-269, 1995.
9. D. Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California at Santa Cruz, 1999.
10. T. Jaakkola and D. Haussler. Exploiting generative models in discriminative classifiers. In Neural Information Processing Systems 11, 1998.
11. T. Jaakkola, M. Meila, and T. Jebara. Maximum entropy discrimination. In Neural Information Processing Systems 12, 1999.
12. T. Joachims, N. Cristianini, and J. Shawe-Taylor. Composite kernels for hypertext categorisation. In International Conference on Machine Learning, 2001.
13. M. Jordan. Learning in Graphical Models. Kluwer Academic, 1997.
14. T. Kin, K. Tsuda, and K. Asai. Marginalized kernels for rna sequence data analysis. In Proc. Genome Informatics, 2002.
15. R. Kondor and T. Jebara. A kernel between sets of vectors. Machine Learning: Tenth International Conference, ICML 2003, February 2003.
16. J. Lafferty and G. Lebanon. Information diffusion kernels. In Neural Information Processing Systems, 2002.
17. C. Leslie, E. Eskin, J. Weston, and W.S. Noble. Mismatch string kernels for svm protein classification. In Neural Information Processing Systems, 2002.
18. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins. Text classification using string kernels, Journal of Machine Learning Research, 2:419-444, February 2002.
19. R.B. Lyngso, C.N.S. Pedersen, and H. Nielsen. Metrics and similarity measures for hidden markov models. In Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology (ISMB), 1999.
20. C. Ong, A. Smola, and R. Williamson. Superkernels. In Neural Information Processing Systems, 2002.
21. C. Rathinavelu and L. Deng. Speech trajectory discrimination using the minimum classification error learning. In IEEE Trans. on Speech and Audio Processing, 1997.
22. A. J. Smola and B. Schölkopf. From regularization operators to support vector machines. In Neural Information Processing Systems, pages 343-349, 1998.
23. N. Tishby, W. Bialek, and F. Pereira. The information bottleneck method: Extracting relevant information from concurrent data. Technical report, NEC Research Institute, 1998.
24. F. Topsoe. Some inequalities for information divergence and related measures of discrimination. J. of Inequalities in Pure and Applied Mathematics, 2(1), 1999.
25. S.V.N. Vishawanathan and A.J. Smola. Fast kernels for string and tree matching. In Neural Information Processing Systems 15, 2002.
26. C. Watkins. Advances in kernel methods, chapter Dynamic Alignment Kernels. MIT Press, 2000.