Sciweavers

Share
NIPS
2004

The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space

9 years 14 days ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkable connection to Mercer kernel based learning theory via the Parzen window technique for density estimation. In a kernel feature space defined by the eigenspectrum of the Laplacian data matrix, this pdf distance is shown to measure the cosine of the angle between cluster mean vectors. The Laplacian data matrix, and hence its eigenspectrum, can be obtained automatically based on the data at hand, by optimal Parzen window selection. We show that the Laplacian pdf distance has an interesting interpretation as a risk function connected to the probability of error.
Robert Jenssen, Deniz Erdogmus, José Carlos
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where NIPS
Authors Robert Jenssen, Deniz Erdogmus, José Carlos Príncipe, Torbjørn Eltoft
Comments (0)
books