BANG-clustering: A novel grid-clustering algorithm for huge data sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1451, Issue , 1998, Pages 867-874

  Schikuta, Erich ^a   Erhart, Martin ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

GRID CLUSTERING; HIER-ARCHICAL CLUSTERING; MULTI-DIMENSIONAL GRIDS; NEIGHBOR SEARCH ALGORITHMS; NEW APPROACHES;

CLUSTERING ALGORITHMS;

EID: 73149097790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0033313     Document Type: Conference Paper

References (6)

1. A.J. Broder. Strategies tbr efl3cient incremental nearest neighbor search. Pattern Recognition, 23:171-178, 1990.
2. R. Dubes and A.K. Jain. Clustering methodologies in exploratory data analysis, volume 19, pages 113-228. Academia Press, 1980.
3. M.W. Freestone. The bang file: A new kind of grid file. In Proc. Special Interest Group on Management of Data, pages 260-269. ACM, May 1987.
4. E. Schikuta. Grid clustering: An efficient hierarchical clustering method for very large data sets. In Proc. 13th Int. Conf. on Pattern Recognition, volume 2, pages 101-105. IEEE Computer Society, 1996.
5. Erich Schikuta and Martin Erhart. The bang-clustering system: Grid-based data analysis. In X Liu, P. Cohen, and M, Berthold, editors, Advances in Intelligent Data Analysis. reasoning about Data, Proc. Second Internationat Symposium IDA-97, volume 1280 of LNCS, London, UK, August 1997. Springer- Verlag.
6. C.S. Warnekar and G. Krishna. A heuristic clustering algorithm using union of overlapping pattern-cells. Pattern Recognition, 11:85-93, 1979.