密度自适应的数据竞争聚类算法.pdfVIP

  • 4
  • 0
  • 约3.62万字
  • 约 12页
  • 2020-01-17 发布于辽宁
  • 举报
ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2016/ 10(10)- 1439-12 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1508059 密度自适应的数据竞争聚类算法* 1 1,2+ 1 苏 辉 ,葛洪伟 ,张 涛 1. 江南大学 物联网工程学院,江苏 无锡 214122 2. 江南大学 轻工过程先进控制教育部重点实验室,江苏 无锡 214122 Density Adaptive Data Competition Clustering Algorithm* 1 1,2+ 1 SU Hui , GE Hongwei , ZHANG Tao 1. School of Internet of Things Engineering, Jiangnan University, Wuxi, Jiangsu 214122, China 2. Ministry of Education Key Laboratory of Advanced Process Control for Light Industry, Jiangnan University, Wuxi, Jiangsu 214122, China + Corresponding author: E-mail: ghw8601@163.com SU Hui, GE Hongwei, ZHANG Tao. Density adaptive data competition clustering algorithm. Journal of Fron- tiers of Computer Science and Technology, 2016, 10(10): 1439-1450. Abstract: Since the existing data competition clustering algorithm has poor performance on density inhomogeneous datasets, this paper proposes a density adaptive data competition clustering algorithm. Firstly, a local density adaptive line is defined. Nextly, the density adaptive similarity can be calculated based on local density adaptive line. The density adaptive similarity can reflect the global data space distribution information and local information of data points, which can describe the relationship between data points more effectively. Then, the density adaptive similarity is used in data competition clustering algorithm. The simulation results o

文档评论(0)

1亿VIP精品文档

相关文档