%0 Journal Article
%T Multi-representation Feature Tree and Spatial Clustering Algorithm<br>多代表点特征树与空间聚类算法
%A HUANG Tian-Qiang
%A QIN Xiao-Lin
%A WANG Jin-Dong
%A <br>黄添强
%A 秦小麟
%A 王金栋
%J 计算机科学
%D 2006
%I 
%X Spatial data have the features of largeness, complexity, continuity, spatial autocorrelation, missing data and error in spatial database. These characters require that a good spatial clustering algorithm must be high efficient, and should be able to detect clusters of complicated shapes, and the dusters found should be independent of the order in which the points in the space are examined, and should be not be impacted by outliers. The existed algorithms can not work well, Clustering algorithm based on multi-representation feature tree named CAMFT is proposed, A new data structure is firstly proposed to condense data, which drew the strongpoint from BIRCH algorithm and CURE algorithm, and then the algorithm that included the idea of random sampling is proposed to enhance the ability to detect very large data, As well as, the multi-representation feature tree can keep clusters of complicated shapes, so it can be used to detect spatial clusters. Experimental results show the algorithm can identify clusters of complicated shapes efficiently in large spatial database that have many outliers, and outperform BIRCH algorithm and CURE algorithm in efficiency.
%K Spatial clustering
%K Spatial data
%K Multi representation feature tree<br>空间聚类
%K 空间数据
%K 多代表点特征树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=8E510ACA64942FEA&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=59906B3B2830C2C5&sid=3A0155B37D8FF829&eid=64963996248CBF47&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=33