高级检索
    岳士弘, 王正友. 二分网格聚类方法及有效性[J]. 计算机研究与发展, 2005, 42(9): 1505-1510.
    引用本文: 岳士弘, 王正友. 二分网格聚类方法及有效性[J]. 计算机研究与发展, 2005, 42(9): 1505-1510.
    Yue Shihong, Wang Zhengyou. Bisecting Grid-Based Clustering Approach and Its Validity[J]. Journal of Computer Research and Development, 2005, 42(9): 1505-1510.
    Citation: Yue Shihong, Wang Zhengyou. Bisecting Grid-Based Clustering Approach and Its Validity[J]. Journal of Computer Research and Development, 2005, 42(9): 1505-1510.

    二分网格聚类方法及有效性

    Bisecting Grid-Based Clustering Approach and Its Validity

    • 摘要: 这是一个新的基于网格的聚类算法.通过逐级二分每个网格成为等体积的两部分,算法使用新的标准度量所有格之间的不相似性,并借此找到数据集中聚类原型的候选,能够克服目前基于网格聚类算法的聚类结果对输入参数敏感的缺点,并且以线性的计算时间耗费,在包含任意形状和密度分布不均匀类的数据集中运行得很好.通过两个实验验证了所提出算法的有效性.

       

      Abstract: A new grid-based clustering approach is presented. By hierarchically bisecting each grid into two volume-equal new grids, this approach can use a new criterion to measure the dissimilarity among all grids and find these candidates of all prototypes. Therefore, the proposed approach can overcome the parameter-sensitive defects in most conventional grid-based clustering approaches, and work well in such dataset with arbitrary-shaped and density-skewed clusters at linear computational complexity. Two experiments are used to verify its clustering effectiveness.

       

    /

    返回文章
    返回