多维Hopfield网络用于聚类
Multidimensional Hopfield Networks for clustering
AI总结:
本文提出多维Hopfield网络(DHN),证明其有限时间收敛且等价于局部最小割的贪心聚类方法,并统一了Cleora、Louvain和Newmans算法,进而将Newmans方法推广至多维情形。
摘要:
我们提出了多维Hopfield网络(DHN),这是Hopfield网络的一种自然推广。在我们的理论研究中,我们聚焦于具有特定激活函数的DHN,并为它们提供了能量函数。我们得出结论,这些DHN在有限时间内收敛,并且等价于旨在寻找局部最小割的图聚类的贪心方法。我们还表明,DHN的通用框架包含了若干先前已知的用于生成图嵌入和聚类的算法。即,Cleora图嵌入算法、Louvain方法和Newmans方法都可以通过适当的激活函数和更新规则表示为DHN。受这些发现的启发,我们将Newmans方法推广到多维情形。
英文摘要:
We present the Multidimensional Hopfield Network (DHN), a natural generalisation of the Hopfield Network. In our theoretical investigations we focus on DHNs with a certain activation function and provide energy functions for them. We conclude that these DHNs are convergent in finite time, and are equivalent to greedy methods that aim to find graph clusterings of locally minimal cuts. We also show that the general framework of DHNs encapsulates several previously known algorithms used for generating graph embeddings and clusterings. Namely, the Cleora graph embedding algorithm, the Louvain method, and the Newmans method can be cast as DHNs with appropriate activation function and update rule. Motivated by these findings we provide a generalisation of Newmans method to the multidimensional case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。