%0 Journal Article
%T Algorithm of finding Outlier for reclustering based on distance<br>一种基于距离的再聚类的离群数据发现算法
%A XU Xue-song
%A LIU Feng-yu
%A <br>徐雪松
%A 刘凤玉
%J 计算机应用
%D 2006
%I 
%X The identifying, analyzing and evaluating algorithm of finding distance-based Outlier (Cell-Based) was firstly studied, and its advantages and disadvantages were pointed out. And then, a new Outlier finding algorithm-algorithm of finding Outlier for reclustering based on distance was proposed. Theoretical analysis and experimental results show that this algorithm can not only effectively overcome the faults of traditional Cell-Based algorithm, i.e. need to be recomputed from scratch for every change of the parameters, and only suitable for finding the Outlier of low dimension, but also obviously avoid the problems caused by randomly selecting initial value to produce different finding results of Outlier at higher convergence speed.
%K cluster
%K distance
%K Outlier<br>聚类
%K 距离
%K 离群数据
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=61DA6F425EB408AB&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=F3090AE9B60B7ED1&sid=5660F24F46E4A7B7&eid=55161FEDEF8BABB8&journal_id=1001-9081&journal_name=计算机应用&referenced_num=2&reference_num=8