By Topic

Clustering without a metric

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
$33 $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

2 Author(s)
G. Matthews ; Dept. of Comput. Sci., Western Washington Univ., Bellingham, WA, USA ; J. Hearne

A methodology for clustering data in which a distance metric or similarity function is not used is described. Instead, clusterings are optimized based on their intended function: the accurate prediction of properties of the data. The resulting clustering methodology is applicable, without further ad hoc assumptions or transformations of the data, (1) when features are heterogeneous (both discrete and continuous) and not combinable, (2) where some data points have missing feature values, and (3) where some features are irrelevant, i.e. have large variance but little correlation with other features. Further, it provides an integral measure of the quality of the resulting clustering. A clustering program, RIFFLE, has been implemented in line with this approach, and experiments with synthetic and real data show that the clustering is, in many respects, superior to traditional methods

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:13 ,  Issue: 2 )