arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.3302cs.LGcs.IR
收藏

使用高斯度量进行高效的基于约束的聚类

Using Gaussian Measures for Efficient Constraint Based Clustering

Montana State University(蒙大拿州立大学)

Chandrima Sarkar, Atanu Roy

摘要:

在本文中,我们提出了一种新的迭代多相聚类技术,有效地聚类高维数据点。为了这个目的,我们实现聚类特征(CF)树上的一个真正的数据集和高斯密度分布约束的CF树。通过在微簇上应用高斯密度分布函数进行后处理,导致先前形成的簇的细化,从而提高它们的质量。该算法还成功地克服了传统的分层聚类方法的固有缺点,如无法撤销对数据点的树状图所做的更改。此外,该算法中应用的约束措施,使这种聚类技术适用于需要驱动的数据分析。我们提供的准确性,我们的索赔评估我们的算法与其他类似的聚类算法。介绍

英文摘要:

In this paper we present a novel iterative multiphase clustering technique for efficiently clustering high dimensional data points. For this purpose we implement clustering feature (CF) tree on a real data set and a Gaussian density distribution constraint on the resultant CF tree. The post processing by the application of Gaussian density distribution function on the micro-clusters leads to refinement of the previously formed clusters thus improving their quality. This algorithm also succeeds in overcoming the inherent drawbacks of conventional hierarchical methods of clustering like inability to undo the change made to the dendogram of the data points. Moreover, the constraint measure applied in the algorithm makes this clustering technique suitable for need driven data analysis. We provide veracity of our claim by evaluating our algorithm with other similar clustering algorithms. Introduction

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑