Persistent Clustering and a Theorem of J. Kleinberg

Details Persistent Clustering and a Theorem of J. Kleinberg Persistent Clustering and a Theorem of J. Kleinberg

2008-08-16

arxiv.org/abs/0808.2241v1

Statistics

Machine Learning

Scientific paper

We construct a framework for studying clustering algorithms, which includes two key ideas: persistence and functoriality. The first encodes the idea that the output of a clustering scheme should carry a multiresolution structure, the second 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 theorem analogous to one of J. Kleinberg, in which one obtains an existence and uniqueness theorem instead of a non-existence result. We explore further properties of this unique scheme, stability and convergence are established.

Affiliated with

Also associated with

No associations

Rating

Persistent Clustering and a Theorem of J. Kleinberg 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 Persistent Clustering and a Theorem of J. Kleinberg, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Persistent Clustering and a Theorem of J. Kleinberg will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706108