Optimizing the Cauchy-Schwarz PDF distance for information theoretic, non-parametric clustering

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

Volumn 3757 LNCS, Issue , 2005, Pages 34-45

  Jenssen, Robert ^a   Erdogmus, Deniz ^b   Hild, Kenneth E ^c   Principe, Jose C ^d   Eltoft, Torbjørn ^a  

^a UNIVERSITY OF TROMSØ   (Norway)

^b OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d University of Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; INFORMATION ANALYSIS; MEMBERSHIP FUNCTIONS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES;

COST FUNCTION; DATA PATTERNS; NON-PARAMETRIC CLUSTERING; STOCHASTIC APPROXIMATION;

INFORMATION THEORY;

EID: 33646557981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11585978_3     Document Type: Conference Paper

References (16)

1. A. K. Jain, M. N. Murty, and P. J. Flynn, "Data Clustering: A Review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999.
2. J. C. Bezdek, "A Convergence Theorem for the Fuzzy Isodata Clustering Algorithms," IEEE Transactions on Pattern Analysis and Machine Learning, vol. 2, no. 1, pp. 1-8, 1980.
3. G. J. McLachlan and D. Peel, Finite Mixture Models, John Wiley & Sons, New York, 2000.
4. K. Rose, E. Gurewitz, and G. C. Fox, "Vector Quantization by Deterministic Annealing," IEEE Transactions on Information Theory, vol. 38, no. 4, pp. 1249-1257, 1992.
5. T. Hofmann and J. M. Buhmann, "Pairwise Data Clustering by Deterministic Annealing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 1, pp. 1-14, 1997.
6. S. J. Roberts, R. Everson, and I. Rezek, "Maximum Certainty Data Partitioning," Pattern Recognition, vol. 33, pp. 833-839, 2000.
7. N. Tishby and N. Slonim, "Data Clustering by Markovian Relaxation and the Information Bottleneck Method," in Advances in Neural Information Processing Systems, 13, MIT Press, Cambridge, 2001, pp. 640-646.
8. J. Principe, D. Xu, and J. Fisher, "Information Theoretic Learning," in Unsupervised Adaptive Filtering, S. Haykin (Ed.), John Wiley & Sons, New York, 2000, vol. I, Chapter 7.
9. E. Parzen, "On the Estimation of a Probability Density Function and the Mode," The Annals of Mathematical Statistics, vol. 32, pp. 1065-1076, 1962.
10. E. Gokcay and J. Principe, "Information Theoretic Clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 2, pp. 158-170, 2002.
11. G. W. Milligan and M. G. Cooper, "An Examination of Procedures for Determining the Number of Clusters in a Data Set," Phychometrica, pp. 159-179, 1985.
12. B. W. Silverman, Density Estimation for Statistics and Data Analysis, Chapman and Hall, London, 1986.
13. J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, 2000.
14. O.L Mangasarian and W. H. Wolberg, "Cancer Diagnosis via Linear Programming," SIAM News, vol. 5, pp. 1-18, 1990.
15. R. Jenssen, J. C. Principe, and T. Eltoft, "Information Cut and Information Forces for Clustering," in Proceedings of IEEE International Workshop on Neural Networks for Signal Processing, Toulouse, France, September 17-19, 2003, pp. 459-468.
16. 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.