| 一种新的子空间聚类算法 |
| |
| 引用本文： | 何虎翼,姚莉秀,沈红斌,杨杰.一种新的子空间聚类算法[J].上海交通大学学报,2007,41(5):813-817. |
| |
| 作者姓名： | 何虎翼 姚莉秀 沈红斌 杨杰 |
| |
| 作者单位： | 上海交通大学,图像处理与模式识别研究所,上海,200240 |
| |
| 摘 要： | 通过对数据空间进行网格划分并寻找稀疏区域来发现类的边界,提出了一种基于密度与网格的新的子空间聚类算法.该算法使用投影寻踪的搜索策略来发现存在于子空间内的类,同时运用基于竞争的修剪方式来有效地控制算法的计算复杂性.实验结果表明,所提算法在精度、时间复杂性等方面具有优良性能.
|
| 关 键 词： | 聚类 子空间 网格 稀疏区域 |
| 文章编号： | 1006-2467（2007）05-0813-05 |
| 收稿时间： | 2006-06-04 |
A New Subspace Clustering Algorithm |
| |
| HE Hu-yi,YAO Li-xiu,SHEN Hong-bin,YANG Jie.A New Subspace Clustering Algorithm[J].Journal of Shanghai Jiaotong University,2007,41(5):813-817. |
| |
| Authors: | HE Hu-yi YAO Li-xiu SHEN Hong-bin YANG Jie |
| |
| Abstract: | A new kind of subspace clustering algorithm based on density and grids was proposed.Boundaries between classes are located by partitioning grids in the data space and finding sparse regions.The new algorithm uses the searching strategy of projected pursuit to find the classes in the subspace.A competitive pruning procedure is utilized to reduce the computational complexity.The experimental results on the benchmark datasets show that the proposed algorithm has advantages in accuracy and computational complexity. |
| |
| Keywords: | clustering subspace grids sparse region |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
