Clustering Using Isoperimetric Number of Trees

Details Clustering Using Isoperimetric Number of Trees Clustering Using Isoperimetric Number of Trees

2012-03-19

arxiv.org/abs/1203.4204v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show that our basic clustering algorithm runs in $O(n \log n)$ and with post-processing in $O(n^2)$ (worst case) time where $n$ is the size of the data set. We also show that our generalized graph model which also allows the use of potentials at vertices can be used to extract a more detailed pack of information as the {\it outlier profile} of the data set. In this direction we show that our approach can be used to define the concept of an outlier-set in a precise way and we propose approximation algorithms for finding such sets. We also provide a comparative performance analysis of our algorithm with other related ones and we show that the new clustering algorithm (without the outlier extraction procedure) behaves quite effectively even on hard benchmarks and handmade examples.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213187