| 注册
首页|期刊导航|计算机工程|基于网格结构的CLARANS改进算法

基于网格结构的CLARANS改进算法

张书春 孙秀英

计算机工程2012,Vol.38Issue(6):56-59,4.
计算机工程2012,Vol.38Issue(6):56-59,4.DOI:10.3969/j.issn.1000-3428.2012.06.018

基于网格结构的CLARANS改进算法

Improved CLARANS Algorithm Based on Grid Structure

张书春 1孙秀英2

作者信息

  • 1. 郑州大学信息工程学院,郑州450002
  • 2. 黄河科技学院,郑州450063
  • 折叠

摘要

Abstract

In order to improve the accuracy and efficiency of Clustering Large Applications based on Randomized Search(CLARANS) algorithm, this paper combines the idea of data space division which comes from grid-based algorithm Statistical Information Grid(STING), improves the CLARANS algorithm by optimizing the selection of initial node and neighbor node, optimizing the calculation of total node replaces cost. Experimental results show that, compared with the CLARANS algorithm, the improved algorithm has better accuracy and stability for the clustering results, and significantly reduce the execution time.

关键词

CLARANS算法/统计信息网格算法/聚类/相异度/数据空间

Key words

Clustering Large Applications based on Randomized Search(CLARANS) algorithm/ Statistical Information Grid(STING) algorithm/ clustering/ dissimilarity degree/ data space

分类

信息技术与安全科学

引用本文复制引用

张书春,孙秀英..基于网格结构的CLARANS改进算法[J].计算机工程,2012,38(6):56-59,4.

基金项目

上海市自然科学基金资助项目(042R14077) (042R14077)

河南省科技攻关计划基金资助项目(2011C520016) (2011C520016)

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文