Kernel maximum entropy data transformation and an enhanced spectral clustering algorithm

Advances in Neural Information Processing Systems

Volumn , Issue , 2007, Pages 633-640

  Jenssen, Robert ^a   Eltoft, Torbjørn ^a   Girolami, Mark ^b   Erdogmus, Deniz ^c  

^a UNIVERSITY OF TROMSØ   (Norway)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

^c OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DATA TRANSFORMATION; KERNEL PCA; MAXIMUM ENTROPY; PARZEN WINDOWING; PRINCIPLE OF MAXIMUM ENTROPY; RENYI'S ENTROPY;

CLUSTERING ALGORITHMS;

METADATA;

EID: 70049113266     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Roweis and L. Saul, "Nonlinear Dimensionality Reduction by Locally Linear Embedding," Science, vol. 290, pp. 2323-2326, 2000.
2. J. Tenenbaum, V. de Silva, and J. C. Langford, "A Global Geometric Framework for Nonlinear Dimensionality Reduction," Science, vol. 290, pp. 2319-2323, 2000.
3. B. Schölkopf, A. J. Smola, and K. R. Müller, "Nonlinear Component Analysis as a Kernel Eigenvalue Problem," Neural Computation, vol. 10, pp. 1299-1319, 1998.
4. J. Shawe-Taylor and N. Cristianini, Kernel Methods for Pattern Analysis, Cambridge University Press, 2004.
5. R. Jenssen, D. Erdogmus, J. C. Principe, and T. Eltoft, "The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space," in Advances in Neural Information Processing Systems 17, MIT Press, Cambridge, 2005, pp. 625-632.
6. R. Jenssen, D. Erdogmus, J. C. Principe, and T. Eltoft, "Some Equivalences between Kernel Methods and Information Theoretic Methods," Journal of VLSI Signal Processing, to appear, 2006.
7. R. Jenssen, D. Erdogmus, J. C. Principe, and T. Eltoft, "Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm," in Proceedings of International Joint Conference on Neural Networks, Vancouver, Canada, July 16-21, 2006, pp. 4904-4911.
8. M. Girolami, "Orthogonal Series Density Estimation and the Kernel Eigenvalue Problem," Neural Computation, vol. 14, no. 3, pp. 669-688, 2002.
9. A. Renyi, "On Measures of Entropy and Information," Selected Papers of Alfred Renyi, Akademiai Kiado, Budapest, vol. 2, pp. 565-580, 1976.
10. E. Parzen, "On the Estimation of a Probability Density Function and the Mode," The Annals of Mathematical Statistics, vol. 32, pp. 1065-1076, 1962.
11. A. Y. Ng, M. Jordan, and Y. Weiss, "On Spectral Clustering: Analysis and an Algorithm," in Advances in Neural Information Processing Systems, 14, MIT Press, Cambridge, 2002, pp. 849-856.
12. B.W. Silverman, Density Estimation for Statistics and Data Analysis, Chapman and Hall, London, 1986.
13. G. Räetsch, T. Onoda, and K. R. Müller, "Soft Margins for Adaboost," Machine Learning, vol. 42, pp. 287-320, 2001.