| 一种改进的带障碍的基于密度和网格的聚类算法 |
| |
| 引用本文： | 严馨,周丽华,陈克平,徐广义.一种改进的带障碍的基于密度和网格的聚类算法[J].计算机应用,2005,25(8):1818-1820. |
| |
| 作者姓名： | 严馨 周丽华 陈克平 徐广义 |
| |
| 作者单位： | 1.昆明理工大学计算机科学技术系； 2.云南大学计算机科学与工程系； 3.南天电子信息股份有限公司 |
| |
| 基金项目： | 国家自然科学基金资助项目(60463004)，云南省教育厅科学研究基金资助项目(03Y173D) |
| |
| 摘 要： | 提出了一个改进的带障碍的网格弥散聚类算法DCellO1:以网格为基础,将基于密度的聚类算法与图形学种子填充算法相结合。该算法能进行任意形状的带障碍聚类,并且在对象分布不均匀时也能获得较好的聚类结果。实验证明了该算法的有效性与优越性。
|
| 关 键 词： | 聚类 网格 密度 障碍 |
| 文章编号： | 1001-9081(2005)08-1818-03 |
Improved clustering algorithm based on density and grid in the presence of obstacles |
| |
| YAN Xin,ZHOU Li-hua,CHEN Ke-ping,XU Guang-yi.Improved clustering algorithm based on density and grid in the presence of obstacles[J].journal of Computer Applications,2005,25(8):1818-1820. |
| |
| Authors: | YAN Xin ZHOU Li-hua CHEN Ke-ping XU Guang-yi |
| |
| Affiliation: | 1. Department of Computer Science and Technology,Kunming University of Science and Technology, Kunming Yunnan 650051, China; 2. Department of Computer Science and Engineering, Yunnan University, Kunming Yunnan 650091, China; 3. Nantian Electronics Information Corporation Limited, Kunming Yunnan 650041, China |
| |
| Abstract: | An improved grid diffusant clustering algorithm in the presence of obstacles called DCellO1 was proposed. Based on grid,it combined density-based clustering algorithm with seed-filling algorithm of graphics. It could construct arbitrary shape clustering in the presence of obstacles, and could obtain good clustering results when the objects distributed unevenly. The experiments prove the superiority and effectiveness of DCellO1. |
| |
| Keywords: | clustering grid density obstacles |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
