[1] 朱明.数据挖掘[M].合肥:中国科学技术大学出版社,2002:208-221.[2] KAUFMAN L, ROUSSEEUW P J. Finding groups in data: an introduction to cluster analysis [M]. New York: Wiley, 1990: 126-163.[3] PARK H S, JUN C H. A simple and fast algorithm for K-medoids clustering [J]. Expert Systems with Applications, 2009, 36(2): 3336-3341.[4] 王国胤,张清华,胡军.粒计算研究综述[J].智能系统学报,2007,2(6):9-26.[5] ZADEH L A. Fuzzy sets and information granularity [M]// Fuzzy Sets, Fuzzy Logic and Fuzzy Systems. River Edge, NJ: Word Scientific, 1996: 433-448.[6] 王伦文.聚类的粒度分析[J].计算机工程与应用,2006,42(5):29-31.[7] 卜东波,白硕,李国杰.聚类/分类中的粒度原理[J].计算机学报,2002,25(8):810-815.[8] DING S F, XU L, ZHU H, et al. Research and progress of cluster algorithms based on granular computing [J]. International Journal of Digital Content Technology and its Applications, 2010, 4(5): 96-104.[9] 夏宁霞,苏一丹,覃希.一种高效的K-medoids聚类算法[J].计算机应用研究,2010,27(12):4517-4519.[10] 苗夺谦,王国胤,刘清,等.粒计算:过去、现在与展望[M].北京:科学出版社,2007:143-144.[11] 王国胤,安秋生,沈钧毅.基于信息粒度与rough集的聚类方法研究[J].模式识别与人工智能,2003,16(4):412-417.[12] XIE X L, BENI G. A validity measure for fuzzy clustering [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1991, 13(8): 841-847.[13] FRANK A, ASUNCION A. UCI machine learning repository [EB/OL]. [2011-11-02]. http://archive.ics.uci.edu/ml. |