arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.09827cs.SIcs.LG
收藏

LFR参数空间中节点分簇性能的剖分图度量

Dissecting graph measure performance for node clustering in LFR parameter space

Moscow Institute of Physics and Technology(莫斯科物理技术学院);Institute of Control Sciences of RAS(俄罗斯科学院控制科学研究所)

Vladimir Ivashkin, Pavel Chebotarev

摘要:

表示节点之间的接近度或距离的图度量可以用于使用度量聚类算法的图节点聚类。有许多措施适用于这项任务,哪一个执行得更好是一个悬而未决的问题。我们研究了25个图的性能措施上生成的图形具有不同的参数。虽然通常测量比较仅限于特定数据集上的一般测量排名,但我们的目标是根据图形特征探索各种测量的性能。使用LFR图生成器,我们创建了一个包含11780个图的数据集,覆盖了整个LFR参数空间。对于每个图,我们评估聚类的质量与k-means算法为每个考虑的措施。在此基础上,我们为参数空间的每个区域确定最佳度量。我们发现,参数空间由不同的区域,其中一个特定的措施是最好的。我们分析了所产生的区域的几何形状,并用简单的标准描述它。给定特定的图参数,这允许我们推荐用于聚类的特定度量。

英文摘要:

Graph measures that express closeness or distance between nodes can be employed for graph nodes clustering using metric clustering algorithms. There are numerous measures applicable to this task, and which one performs better is an open question. We study the performance of 25 graph measures on generated graphs with different parameters. While usually measure comparisons are limited to general measure ranking on a particular dataset, we aim to explore the performance of various measures depending on graph features. Using an LFR graph generator, we create a dataset of 11780 graphs covering the whole LFR parameter space. For each graph, we assess the quality of clustering with k-means algorithm for each considered measure. Based on this, we determine the best measure for each area of the parameter space. We find that the parameter space consists of distinct zones where one particular measure is the best. We analyze the geometry of the resulting zones and describe it with simple criteria. Given particular graph parameters, this allows us to recommend a particular measure to use for clustering.

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

↑