arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.5064cs.LGcs.CVcs.GTnlin.AO
收藏

进化网络上一种基于博弈的聚类算法

A Novel Clustering Algorithm Based Upon Games on Evolving Network

Zhejiang University(浙江大学);Shanghai Jiao Tong University(上海交通大学)

Qiang Li, Zhuo Chen, Yan He, Jing-ping Jiang

摘要:

本文提出了一种基于演化网络的博弈模型,并根据该模型提出了三种聚类算法,在聚类算法中,聚类数据点被看作是博弈中的参与者,参与者可以在博弈中做出决策。在描述数据点之间关系的网络上,利用一个去边重连(ERR)函数在数据点的邻域内进行探索,去除与小收益邻域相连的边,并创建与大收益邻域相连的新边.因此,数据点之间的联系随着时间的推移而变化。在网络的演化过程中,一些策略在网络中传播。因此,自动形成聚类,其中具有相同进化稳定策略的数据点被收集为聚类,因此进化稳定策略的数量指示聚类的数量。实验结果表明,该算法能够合理有效地对数据点进行聚类,并与其他算法进行了比较,验证了算法的有效性。

英文摘要:

This paper introduces a model based upon games on an evolving network, and develops three clustering algorithms according to it. In the clustering algorithms, data points for clustering are regarded as players who can make decisions in games. On the network describing relationships among data points, an edge-removing-and-rewiring (ERR) function is employed to explore in a neighborhood of a data point, which removes edges connecting to neighbors with small payoffs, and creates new edges to neighbors with larger payoffs. As such, the connections among data points vary over time. During the evolution of network, some strategies are spread in the network. As a consequence, clusters are formed automatically, in which data points with the same evolutionarily stable strategy are collected as a cluster, so the number of evolutionarily stable strategies indicates the number of clusters. Moreover, the experimental results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the comparison with other algorithms also provides an indication of the effectiveness of the proposed algorithms.

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

↑