Classifying Clustering Schemes

Details Classifying Clustering Schemes Classifying Clustering Schemes

2010-11-24

arxiv.org/abs/1011.5270v2

Statistics

Machine Learning

Scientific paper

Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose various structural conditions on the clustering schemes, under the general heading of functoriality. Functoriality refers to the idea that one should be able to compare the results of clustering algorithms as one varies the data set, for example by adding points or by applying functions to it. We show that within this framework, one can prove a theorems analogous to one of J. Kleinberg, in which for example one obtains an existence and uniqueness theorem instead of a non-existence result. We obtain a full classification of all clustering schemes satisfying a condition we refer to as excisiveness. The classification can be changed by varying the notion of maps of finite metric spaces. The conditions occur naturally when one considers clustering as the statistical version of the geometric notion of connected components. By varying the degree of functoriality that one requires from the schemes it is possible to construct richer families of clustering schemes that exhibit sensitivity to density.

Affiliated with

Also associated with

No associations

Rating

Classifying Clustering Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classifying Clustering Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classifying Clustering Schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240310