Skip to Main Content
For very large databases, such as spatial database and multimedia database, the traditional clustering algorithms are of limitations in validity and scalability. According to the notion of clustering feature of BIRCH, an incremental clustering algorithm is designed and implemented, which solves the problems of effectiveness, space and time complexities of clustering algorithms for very large spatial databases. Theoretic analysis and experimental results demonstrate that the incremental clustering algorithm cannot only handle very large spatial databases, but also has good performance.
Date of Conference: 26-28 Dec. 2009