Clustering with the Connectivity Kernel

Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed elongated structures is considered a much harder problem. In this paper we present a novel clustering algorithm which tackles the problem by a two step procedure: first the data are transformed in such a way that elongated structures become compact ones. In a second step, these new objects are clustered by optimizing a compactness-based criterion. The advantages of the method over related approaches are threefold: (i) robustness properties of compactness-based criteria naturally transfer to the problem of extracting elongated structures, leading to a model which is highly robust against outlier objects; (ii) the transformed distances induce a Mercer kernel which allows us to formulate a polynomial approximation scheme to the generally NPhard clustering problem; (iii) the new method does not contain free kern...

• Type: Conference
• Year: 2003
• Where: NIPS
• Authors: Bernd Fischer, Volker Roth, Joachim M. Buhmann
• Keywords: Elongated Structures, Harder Problem, NIPS 2003, NIPS 2007, NPhard Clustering Problem