| 基于相对距离的改进粗K-means方法 |
| |
| 引用本文： | 王明春,唐万生,江琪,刘鑫.基于相对距离的改进粗K-means方法[J].计算机应用,2009,29(4):1102-1105. |
| |
| 作者姓名： | 王明春 唐万生 江琪 刘鑫 |
| |
| 作者单位： | 天津工程师范学院 天津大学 天津工程师范学院 |
| |
| 基金项目： | 国家自然科学基金，天津市教委高等学校科技发展基金 |
| |
| 摘 要： | 对现有的两种基于绝对距离的粗K-means方法进行了讨论，指出了各自的不足之处。在此基础之上，讨论了用相对距离替代绝对距离的合理性，从而给出了基于相对距离的粗K-means方法。通过对随机数据、Iris数据和文本数据进行聚类效果比较，验证了基于相对距离的粗K-means方法的可行性和有效性。
|
| 关 键 词： | 粗糙集 粗K-means方法 聚类 |
| 收稿时间： | 2008-10-20 |
| 修稿时间： | 2008-12-10 |
Improved algorithm of rough K-means based on relative distance |
| |
| WANG Ming-chun,TANG Wan-sheng,JIANG Qi,LIU Xin.Improved algorithm of rough K-means based on relative distance[J].journal of Computer Applications,2009,29(4):1102-1105. |
| |
| Authors: | WANG Ming-chun TANG Wan-sheng JIANG Qi LIU Xin |
| |
| Affiliation: | 1.Institute of System Engineering;Tianjin University;Tianjin 300072;China;2.Department of Mathematics and Physics;Tianjin University of Technology and Education;Tianjin 300222;China |
| |
| Abstract: | Two rough K-means algorithms based on absolute distance were discussed in the first place, and then the deficiencies of them were indicated. After that, the rationality of the algorithms was presented when the absolute distance was changed to relative distance, and for the reason, the improved algorithms of rough K-means based on relative distance was given. At last, the feasibility and effectiveness of this algorithm were testified by comparing with random, Iris and text data on clustering effect. |
| |
| Keywords: | Rough Set (RS) rough K-means algorithm clustering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
