BANG-Clustering: A novel grid-clustering algorithm for huge data sets
In this paper a new approach to hierarchical clustering of huge data sets is presented, which is based on a Grid-Clustering approach [Sch96]. It uses a multi-dimensional grid data structure, the BANG structure, to organize the value space surrounding the pattern values. The patterns are grouped into blocks and clustered with respect to the blocks by a topological neighbor search algorithm.
Unable to display preview. Download preview PDF.
- [DJ80]R. Dubes and gA.K. Jain. Clustering methodologies in exploratory data analysis, volume 19, pages 113–228. Academia Press, 1980.Google Scholar
- [Fre87]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.Google Scholar
- [SE97]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 International Sym posium IDA-97, volume 1280 of LNCS, London, UK, August 1997. Springer-Verlag.Google Scholar