By Topic

Threshold validity for mutual neighborhood clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Smith, S.P. ; Northrop Res. & Technol. Center, Palos Verdes Peninsula, CA, USA

Clustering algorithms have the annoying characteristic of finding clusters in random data. A theoretical analysis of the threshold of the mutual neighborhood clustering algorithm (MNCA) under the hypothesis of random data is presented. This yields a theoretical minimum value of this threshold below which even unclustered data are broken into separate clusters. To derive the threshold, a theorem about mutual near neighbors in a Poisson process is stated and proved. Simple experiments demonstrate the usefulness of the theoretical thresholds

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:15 ,  Issue: 1 )