| 一种改进的相容关系聚类算法 |
| |
| 引用本文： | 万仁霞,苏晓珂,董晓亮. 一种改进的相容关系聚类算法[J]. 计算机应用与软件, 2012, 0(2): 69-71,79 |
| |
| 作者姓名： | 万仁霞 苏晓珂 董晓亮 |
| |
| 作者单位： | 北方民族大学信息与计算科学学院;郑州轻工业学院计算机与通信工程学院 |
| |
| 基金项目： | 国家自然科学基金(61163017);宁夏自然科学基金(NZ11145);北方民族大学科学研究项目(2010Y039) |
| |
| 摘 要： | 聚类分析是数据挖掘中的一个重要研究内容。按照数据对象间的关系进行聚类在许多情况具有特殊的意义。提出一种相容关系数据对象的聚类算法。该算法首先对每个数据对象按字典排序,利用相容集的反单调性性质来产生极大相容簇,即通过相容集的连接产生更高层的相容集的候选,再通过剪枝的方法来得到更高层的相容集。该方法可以有效压缩算法的搜索空间,是现有相容关系聚类算法的有益改进和补充。
|
| 关 键 词： | 聚类 相容集 字典排序 连接 剪枝 |
AN IMPROVED COMPATIBLE RELATION CLUSTERING ALGORITHM |
| |
| Wan Renxia,Su Xiaoke,Dong Xiaoliang. AN IMPROVED COMPATIBLE RELATION CLUSTERING ALGORITHM[J]. Computer Applications and Software, 2012, 0(2): 69-71,79 |
| |
| Authors: | Wan Renxia Su Xiaoke Dong Xiaoliang |
| |
| Affiliation: | 1(College of Information and Computation Science,Beifang University of Nationalities,Yinchuan 750021,Ningxia,China)2(School of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,Henan,China) |
| |
| Abstract: | Cluster analysis is an important part to study in data mining.It is particularly meaningful to execute clustering according to relations among data objects.The paper puts forward a compatible relation data object clustering algorithm.The algorithm firstly sorts all data objects lexicographically to generate bigger compatible clusters through the anti-monotone property of compatible sets.Then through prune method it obtains higher level compatible sets.The method can efficiently compress the searching space of the algorithm,so that it is a beneficial improvement and complement for present compatible relation clustering algorithms. |
| |
| Keywords: | Cluster Compatible set Lexicographical order Join Prune |
| 本文献已被 CNKI 等数据库收录！ |
|
