Grid-clustering: An efficient hierarchical clustering method for very large data sets

Proceedings - International Conference on Pattern Recognition

Volumn 2, Issue , 1996, Pages 101-105

  Schikuta, Erich ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

HIER-ARCHICAL CLUSTERING; HIERARCHICAL CLUSTERING METHODS; HIERARCHICAL METHOD; MULTI-DIMENSIONAL GRIDS; NEIGHBOR SEARCH ALGORITHMS; RUN-TIME ANALYSIS; RUNTIME BEHAVIORS; VERY LARGE DATUM;

CLUSTERING ALGORITHMS;

EID: 84898817460     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.1996.546732     Document Type: Conference Paper

References (7)

1. Aho A. V., Hopcroft J. E. and Ullman J. D., The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1974
2. Broder A. J., Strategies for efficient incremental nearest neighbor search, Pattern Recognition, 23, 1/2, 171-178, 1990
3. Dubes R., Jain A. K., Clustering methodologies in exploratory data analysis. Advances in Computers 19, Academia Press, 113-228, 1980
4. Nievergelt J., Hinterberger H., Sevcik K. C., The grid file: an adaptable, symmetric multikey file structure, ACM Transactions on Database Systems 9, 38-71, 1984
5. Regnier M., Analysis of grid file algorithms, BIT 25, 335-357, 1985
6. Schikuta E., Grid-Clustering: An Efficient Clustering Method for Very Large Data Sets, Tech. Rep. No. TR-96201, Inst. Applied Computer Science and Information Systems, University of Vienna, Austria, 1996
7. Warnekar C. S., Krishna G., A heuristic clustering algorithm using union of overlapping pattern-cells, Pattern Recognition, 11, 85-93, 1979