A Clustering and Data-Reorganizing Algorithm
- 1 January 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-5 (1) , 125-128
- https://doi.org/10.1109/tsmc.1975.5409163
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Experiments with some cluster analysis algorithmsPattern Recognition, 1974
- Interpretation of mass spectrometry data using cluster analysis. Alkyl thiolestersAnalytical Chemistry, 1974
- Problem Decomposition and Data Reorganization by a Clustering TechniqueOperations Research, 1972
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- Heuristic Techniques for Solving Large Combinatorial Problems on a ComputerPublished by Springer Nature ,1970
- The Traveling Salesman Problem: A SurveyOperations Research, 1968