Optimizing the Cauchy-Schwarz PDF Distance for Information Theoretic, Non-parametric Clustering

This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data patterns, in order to maximize the recent Cauchy-Schwarz (CS) probability density function (pdf) distance measure. Each pdf corresponds to a cluster. The CS distance is estimated analytically and non-parametrically by means of the Parzen window technique for density estimation. The resulting form of the cost function makes it possible to develop an efficient adaption procedure based on constrained gradient descent, using stochastic approximation of the gradients. The computational complexity of the algorithm is O(MN), M N, where N is the total number of data patterns and M is the number of data patterns used in the stochastic approximation. We show that the new algorithm is capable of performing well on several odd-shaped and irregular data sets.

• Type: Conference
• Year: 2005
• Where: EMMCVPR
• Authors: Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II, José Carlos Príncipe, Torbjørn Eltoft
• Keywords: Data Patterns, EMMCVPR 2005, Non-parametric Data Clustering, Stochastic Approximation