×

改进的共享型最近邻居聚类算法

消耗积分:3 | 格式:rar | 大小:182 | 2009-05-16

彭友旺

分享资料个

聚类效果往往依赖于密度和相似度的定义,并且当数据的维增加时,其复杂度也随之增加。该文基于共享型最近邻居聚类算法SNN,提出了一种改进的共享型最近邻居聚类算法RSNN,并将RSNN应用于高速公路交通数据集上,解决了SNN算法在“去噪”、孤立点和代表点的判断、聚类效果等方面的不足之处。实验结果表明,RSNN算法比SNN算法在时空数据集上具有更好的聚类效果。

Clustering results often depend on density and similarity critically, and its complexity often changes along with the augment of sample dimensionality. This paper refers to classical shared nearest neighbor clustering algorithm (SNN) and refined shared nearest neighbor clustering algorithm (RSNN). By applying this RSNN algorithm on freeway traffic data set, we settled several problems existed in SNN algorithm, such as outliers, statistic, core points, computation complexity and so on. Experiment results prove that this refined algorithm has better clustering results on multi-dimensional data set than SNN algorithm.

声明:本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人,不代表电子发烧友网立场。文章及其配图仅供工程师学习之用,如有内容侵权或者其他违规问题,请联系本站处理。 举报投诉

评论(0)
发评论

下载排行榜

全部0条评论

快来发表一下你的评论吧 !