论文标题
通过Gumbel SoftMax进行社区检测聚类
Community Detection Clustering via Gumbel Softmax
论文作者
论文摘要
最近,在许多系统(例如语音识别和视觉处理)中,深度学习已被广泛实施。在这项研究中,我们正在探索在图数据集中使用深度学习在社区检测中的可能性。图表在不同领域的吸引力增长,包括社交网络,信息图,推荐系统以及生命科学。在本文中,我们提出了一种社区检测方法,将各种图数据集的节点聚类。我们将属于隶属网络,动物网络,人接触网络,人类社交网络,其他网络的不同类别数据集群集。在网络中的节点之间的相互作用建模时,深度学习的作用允许与图网络分析相关的科学领域的革命。在本文中,我们将Gumbel SoftMax方法扩展到图形网络聚类。特定图表数据集的实验发现表明,新方法的表现大大优于传统聚类,这强烈表明了深度学习在图形社区检测聚类中的功效。我们使用各种数据集对图形聚类算法进行了一系列实验:Zachary空手道俱乐部,高地部落,火车轰炸,美国革命,豚鼠,斑马,蜿蜒曲折,蜿蜒曲折,LesMisérables,政治书籍,政治书籍。
Recently, in many systems such as speech recognition and visual processing, deep learning has been widely implemented. In this research, we are exploring the possibility of using deep learning in community detection among the graph datasets. Graphs have gained growing traction in different fields, including social networks, information graphs, the recommender system, and also life sciences. In this paper, we propose a method of community detection clustering the nodes of various graph datasets. We cluster different category datasets that belong to Affiliation networks, Animal networks, Human contact networks, Human social networks, Miscellaneous networks. The deep learning role in modeling the interaction between nodes in a network allows a revolution in the field of science relevant to graph network analysis. In this paper, we extend the gumbel softmax approach to graph network clustering. The experimental findings on specific graph datasets reveal that the new approach outperforms traditional clustering significantly, which strongly shows the efficacy of deep learning in graph community detection clustering. We do a series of experiments on our graph clustering algorithm, using various datasets: Zachary karate club, Highland Tribe, Train bombing, American Revolution, Dolphins, Zebra, Windsurfers, Les Misérables, Political books.