%0 Journal Article
%T An Approach on the Data Structure for the Matrix Storing Based on the Implementation of Agglomerative Hierarchical Clustering Algorithm<br>面向凝聚式层次聚类算法实现的矩阵存储数据结构研究
%A ZHANG Zhen-Ya
%A CHENG Hong-Mei
%A WANG Jin
%A WANG Xu-Fa
%A <br>张振亚
%A 程红梅
%A 王进
%A 王煦法
%J 计算机科学
%D 2006
%I 
%X 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.
%K Agglomerative hierarchical clustering
%K Matrix
%K Cross list
%K AVL tree<br>凝聚式层次聚类
%K 矩阵
%K 十字链表
%K 平衡二叉树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=409AA658B01EA1A1&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=CA4FD0336C81A37A&sid=F3583C8E78166B9E&eid=BCA2697F357F2001&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10