首页 | 本学科首页   官方微博 | 高级检索  
     

云计算环境下高复杂度动态数据的增量密度快速聚类算法研究
引用本文:陈赣浪,颜飞龙,潘家辉.云计算环境下高复杂度动态数据的增量密度快速聚类算法研究[J].计算机科学,2018,45(2):287-290.
作者姓名:陈赣浪  颜飞龙  潘家辉
作者单位:华南师范大学软件学院 广东 南海528225,华南师范大学教育科学学院 广州510631,华南师范大学软件学院 广东 南海528225
基金项目:本文受国家自然科学基金青年科学基金项目(61503143),广东省自然科学基金博士科研启动项目(2014A030310244)资助
摘    要:针对传统的聚类算法存在开销大、聚类质量差、聚类速度慢等问题,提出一种新的云计算环境下高复杂度动态数据的增量密度快速聚类算法。首先,依据密度对云计算环境下高复杂度动态数据进行聚类,从数据空间中找到部分子空间,使得数据映射至该空间后可产生高密度点集区域,将连通区域的集合看作聚类结果;其次,通过DBSCAN算法进行增量聚类,并对插入或删除数据导致的原聚类合并或分裂进行研究;最后,在更新的过程中通过改变核心状态数据的邻域中含有的全部核心数据进行处理,从插入或删除数据两方面进行增量聚类分析。实验结果表明,所提算法开销低、聚类速度快、聚类质量高。

关 键 词:云计算环境  高复杂度  动态数据  增量密度  快速聚类
收稿时间:2017/1/23 0:00:00
修稿时间:2017/2/10 0:00:00

Study on Fast Incremental Clustering Algorithm for High Complexity Dynamic Data in Cloud Computing Environment
CHEN Gan-lang,YAN Fei-long and PAN Jia-hui.Study on Fast Incremental Clustering Algorithm for High Complexity Dynamic Data in Cloud Computing Environment[J].Computer Science,2018,45(2):287-290.
Authors:CHEN Gan-lang  YAN Fei-long and PAN Jia-hui
Affiliation:School of Software,South China Normal University,Nanhai,Guangdong 528225,China,School of Education,South China Normal University,Guangzhou 510631,China and School of Software,South China Normal University,Nanhai,Guangdong 528225,China
Abstract:In order to solve the problems that the traditional clustering algorithm has the disadvantages of high cost,poor clustering quality and slow clustering speed,this paper proposed a new fast clustering algorithm based on incremental density of high complexity dynamic data in cloud computing environment.First of all,on the basis of density under the environment of high complexity of dynamic data clustering in cloud computing,this algorithm finds some subspace from the data space.The data mapped to the space area can produce high density point set,and the set of connec-ted regions is regarded as the clustering results.Secondly,it executes incremental clustering by DBSCAN algorithm, and studies the original clustering merger or split caused by inserting or deleting data.Finally,by dealing with all the core data in the neighborhood of changing the core status in the process of updating,the incremental clustering is analyzed from two aspects of inserting or deleting data.The experimental results show that the proposed algorithm has the cha-racteristics of low cost,fast clustering speed and high clustering quality.
Keywords:Cloud computing environment  High complexity  Dynamic data  Incremental density  Fast clustering
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号