王海军, 邓羽, 王丽, 关兴良. 基于数据场的C均值聚类方法研究[J]. 武汉大学学报 ( 信息科学版), 2009, 34(5): 626-629.
引用本文: 王海军, 邓羽, 王丽, 关兴良. 基于数据场的C均值聚类方法研究[J]. 武汉大学学报 ( 信息科学版), 2009, 34(5): 626-629.
WANG Haijun, DENG Yu, WANG Li, GUAN Xingliang. A C-means Algorithm Based on Data Field[J]. Geomatics and Information Science of Wuhan University, 2009, 34(5): 626-629.
Citation: WANG Haijun, DENG Yu, WANG Li, GUAN Xingliang. A C-means Algorithm Based on Data Field[J]. Geomatics and Information Science of Wuhan University, 2009, 34(5): 626-629.

基于数据场的C均值聚类方法研究

A C-means Algorithm Based on Data Field

  • 摘要: 提出了基于数据场的C均值聚类方法。引入数据场准确寻找初始中心的聚类点,根据势场分布函数,先找到k个势心,然后选择距离势心最近的样本数据,得到用数据场生成的初始中心,从而实现C均值聚类算法。该方法可以广泛地应用到空间数据的分类分级研究中。实例验证了该方法的可行性和科学性。

     

    Abstract: C-means clustering is the first objective function clustering algorithm.Our purpose is to set forth a C-means algorithm based on data field,which can be widely applied to the classification and hierarchy in the field of spatial data mining and knowledge discovery.The basic idea of this method is to find the initial cluster centers based on the introduction of data field.Priority should find potential heart k according to the potential field distribution function,then select sample data being close on the potential heart.Finally,we can achieve C-means clustering algorithm.We presentd the implementation steps of the method,and verified the feasible and scientific significance by examples.

     

/

返回文章
返回