论文信息 - A Clustering and Data-Reorganizing Algorithm - 字舞流文

A Clustering and Data-Reorganizing Algorithm

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.

James R. Slagle | Stephen R. Heller | Chin-Liang Chang | Chin-Liang Chang | J. Slagle | S. Heller

[1] R. Sokal,et al. Principles of numerical taxonomy , 1965 .

[2] Shen Lin,et al. Heuristic Techniques for Solving Large Combinatorial Problems on a Computer , 1970 .

[3] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[4] Jack Minker,et al. An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[5] Stephen R. Heller,et al. Interpretation of mass spectrometry data using cluster analysis. Alkyl thiolesters , 1974 .

[6] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[7] Richard C. T. Lee,et al. Experiments with some cluster analysis algorithms , 1974, Pattern Recognit..

[8] Paul J. Schweitzer,et al. Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..