By Topic

A Clustering and Data-Reorganizing Algorithm

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

3 Author(s)
J. R. Slagle ; Computer Science Laboratory, Naval Research Laboratory, S. W., Washington, D.C. 20375. ; C. L. Chang ; S. R. Heller

A clustering and data-reorganizing algorithm based on the concept of the shortest spanning path of a graph is given. This algorithm can be used to reorganize and/or cluster a large file of data.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-5 ,  Issue: 1 )