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

Computational Statistics and Data Analysis

Volumn 23, Issue 1, 1996, Pages 29-43

  Eddy, William F ^a   Mockus, Audris ^a   Oue, Shingo ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SET THEORY; STATISTICAL METHODS; TREES (MATHEMATICS);

EUCLIDEAN SPACE; HIGH DIMENSIONAL SPACES; ONE DIMENSIONAL SUBMANIFOLDS; SINGLE LINKAGE CLUSTER;

DATA REDUCTION;

CLUSTER ANALYSIS; DATA SET; LARGE; MULTIDIMENSIONAL SPACE;

EID: 0030285833     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9473(96)00019-9     Document Type: Article

References (7)

1. Eddy, W.F. and S. Oue, Dynamic three-dimensional display of U.S. air traffic, Technical Report 591 (Department of Statistics, Carnegie Mellon University, 1994).
2. Fortune, S., A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987) 153-174.
3. Klein, P.M. and R.E. Tarjan, A randomized linear-time algorithm for finding minimum spanning trees, Technical Report CS-436-93 (Princeton University, 1993).
4. Kruskal, J.B., On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. American Mathematical Society, Vol. 7 (1956) 1.
5. Preparata, F.P. and M.I. Shamos, Computational geometry. An introduction (Springer, New York. 1985).
6. Prim, R.C., Shortest connection networks and some generalizations, Bell System Tech. J., 36 (1957).
7. Sedgewick, R., Algorithms (Addison-Wesley, Reading, MA, 1983).