Improved BIRCH Hierarchical Clustering Algorithm
Zhao Yu · 2008
The traditional BIRCH clustering algorithm has many shortcomings,such as it is only fit for single table and only finds the global clusters. For these shortcomings,we introduce an improved algorithm——IBIRCH algorithm. First,this algorithm joins every table through the tuple ID propagation to be applied in relational databases. Then,find arbitrary clusters using the shared nearest neighbor density algorithm. The experiment shows the efficiency and scalability of this approach.