By Topic

Visual heuristics for data 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

2 Author(s)
Tung-Duong Tran-Luu ; Med. Inf. & Comput. Intelligence Lab., Maryland Univ., College Park, MD, USA ; DeClaris, N.

We are concerned with finding clusters in data by reordering the proximity matrix as close as possible into block diagonal form. We also define a new proximity measure for variables with word values that can be semantically consistent with our knowledge in the field in question. Moreover, we unify various measures of blockness into the form of a quadratic programming problem. We propose two new algorithms to reorder proximity matrices: MST linearization (MLin) and dendrogram linearization (DLin). Their performance is compared against four other popular algorithms by running numerous data sets, real and artificial. We find that MLin is competitive and complementary with the furthest neighbor, which is among the best existing algorithms

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct 1997