Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm

Details Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm

2011-04-04

arxiv.org/abs/1104.0651v3

Computer Science

Learning

Scientific paper

We propose a new clustering technique that can be regarded as a numerical method to compute the proximity gestalt. The method analyzes edge length statistics in the MST of the dataset and provides an a contrario cluster detection criterion. The approach is fully parametric on the chosen distance and can detect arbitrarily shaped clusters. The method is also automatic, in the sense that only a single parameter is left to the user. This parameter has an intuitive interpretation as it controls the expected number of false detections. We show that the iterative application of our method can (1) provide robustness to noise and (2) solve a masking phenomenon in which a highly populated and salient cluster dominates the scene and inhibits the detection of less-populated, but still salient, clusters.

Affiliated with

Also associated with

No associations

Rating

Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm 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 Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318457