A Clustering and Data-Reorganizing Algorithm

J.R. Slagle; C.-L. Chang; S.R. Heller

doi:10.1109/TSMC.1975.5409163

IEEE Transactions on Systems, Man and Cybernetics

Paper

01 Jan 1975

A Clustering and Data-Reorganizing Algorithm

View publication

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. © 1975, IEEE. All rights reserved.

Paper

Experiments with some cluster analysis algorithms

J.R. Slagle, C.-L. Chang, et al.

Pattern Recognition

Paper

Using rewriting rules for connection graphs to prove theorems

C.L. Chang, J.R. Slagle

Artificial Intelligence

Paper

Experiments with some cluster analysis algorithms

J.R. Slagle, C.-L. Chang, et al.

Pattern Recognition

View all publications

Abstract

Related

Experiments with some cluster analysis algorithms

Using rewriting rules for connection graphs to prove theorems

Experiments with some cluster analysis algorithms