An Approach on the Data Structure for the Matrix Storing Based on the Implementation of Agglomerative Hierarchical Clustering Algorithm
面向凝聚式层次聚类算法实现的矩阵存储数据结构研究

Searching, expanding, shrinking instantly is the precondition of the similarity/distance matrix storing for the implementation of agglomerative hierarchical clustering algorithm. This paper presents a new compound data structure named as CrossAVL based on cross list and AVL tree for the matrix storing. The time complexity for the implementa tion of searching, expanding and shrinking method based on CrossAVL are given. Experimental results show that all those method can be running instantly.