An Efficient Clustering Algorithm
IEEE Transactions on Systems Man and CyberneticsPublished 1 January 1976
M.V. Bhat, A. Haupt
Citations62
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An efficient algorithm for data reorganization and clustering is presented and has some decided merits over the algorithm of Slagle et al., which provided the immediate stimulus for this work.
Abstract
An efficient algorithm for data reorganization and clustering is presented. This algorithm has some decided merits over the algorithm of Slagle et al., which provided the immediate stimulus for this work.
Keywords
Computer ScienceEngineering
Operations ResearchProblem Decomposition and Data Reorganization by a Clustering Technique
711 Citations1972William T. McCormick, Paul J. Schweitzer +1 more
The bond energy algorithm operates upon a raw input object-object or object-attribute data array by permuting its rows and columns in order to find informative variable groups and their interrelations.
International Journal of Production ResearchNumerical taxonomy applied to group technology and plant layout
337 Citations1973A. S. Carrie
The technique of numerical taxonomy is described and it is shown how it may be applied to both group technology and plant layout, and a computer programme for production flow analysis is presented.
IEEE Transactions on Systems Man and CyberneticsA Clustering and Data-Reorganizing Algorithm
83 Citations1975James R. Slagle, C. L. Chang +1 more
A clustering and data-reorganizing algorithm based on the concept of the shortest spanning path of a graph is given that can be used to reorganize and/or cluster a large file of data.
Pattern RecognitionExperiments with some cluster analysis algorithms
28 Citations1974James R. Slagle, Chih-Lin Chang +1 more
The one-dimensional clustering algorithm advocated by Slagle and Lee can be generalized to the n -dimensional case, n > 1 and the long links in a short spanning path or a minimal spanning tree have to be broken to obtain clusters.