论文信息 - Approximate single linkage cluster analysis of large data sets in high-dimensional spaces - 字舞流文

Approximate single linkage cluster analysis of large data sets in high-dimensional spaces

W. Eddy | A. Mockus | S. Oue

[1] William F. Eddy,et al. Dynamic Three-Dimensional Display of U.S. Air Traffic , 1995 .

[2] Philip N. Klein,et al. A randomized linear-time algorithm for finding minimum spanning trees , 1994, STOC '94.

[3] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[4] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[5] R. Prim. Shortest connection networks and some generalizations , 1957 .

[6] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .