基于区间数的不确定数据流2κ近邻聚类算法

摘要

现有数据流聚类算法多数面向的是确定性数据,可是不确定数据的数据流聚类逐步被受到关注,因为经典的不确定数据聚类算法具有概率密度函数获取困难、实用性不强以及计算复杂等缺点,提出一种基于区间数的不确定数据流聚类算法 UIDStream.算法用区间数来表示属性不确定性数据和基于区间数的距离计算方法,定义了不确定性数据之间的相似度,并利用传统 κ近邻聚类的思想,提出基于区间数的2κ近邻微簇和最优2κ近邻微簇的概念,通过最优2κ近邻微簇的融合,实现不确定数据流的聚类.实验结果表明:改进后的算法具有良好的聚类效果,提高了不确定数据流聚类的聚类质量和速率.%Existing data stream clustering algorithms are most focus at deterministic data,but the data stream clustering algorithms of uncertain data are gradually receiving attention.T he classical clustering algorithm of uncertain data has some shortcomings such as difficult to obtain probability density function,poor practicability and complex computation.In this paper, clustering algorithm based on interval number for uncertain data stream(UIDStream)is proposed.The proposed algorithm uses interval number to represent the attribute uncertain data and the distance based on interval number.The distance calculation method based on interval number is defined and the calculation method of similarity between the uncertain data is proposed.Based on traditionalk-near neighbors clustering thinking,the concepts of 2κ-near neighbors micro cluster and optimal 2κ-nearest neighbors micro cluster are proposed.Clustering of uncertain data streams is achieved through the fusion of the 2κ-near neighbors micro cluster. The improved algorithm has a good clustering effect and improves the clustering quality and rate of the uncertain data stream clustering.