%0 Journal Article
%T An PAM Algorithm Based on Data Field<br>基于数据场改进的PAM聚类算法
%A YU Jian-Qiao
%A ZHANG Fan Information College
%A Southwest Agricultural University
%A Chongqing
%A <br>余建桥
%A 张帆
%J 计算机科学
%D 2005
%I 
%X PAM is a k-mediod algorithm. It is efficient and flexible to handle data sets. However, there are inaccurate and insufficient in random choosing initial data center in algorithm PAM, and PAM is not robust to treat data sets in- cluding outlier or noise. Based on data field conception, an improved PAM is designed to solve these problems. This improved algorithm is more efficient and improves quality of result of data mining.
%K PAM
%K Data field
%K Clustering<br>数据场
%K PAM聚类算法
%K 伸缩性
%K 聚类分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=F5F93F9399B7A200&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=CA4FD0336C81A37A&sid=31611641D4BB139F&eid=ED01F5AE50BE09C0&journal_id=1002-137X&journal_name=计算机科学&referenced_num=4&reference_num=6