Abstract
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.
Cite
CITATION STYLE
Schikuta, E., & Erhart, M. (1998). BANG-clustering: A novel grid-clustering algorithm for huge data sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1451, pp. 867–874). Springer Verlag. https://doi.org/10.1007/bfb0033313
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
