Multidimensional Hopfield Networks for clustering
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringGraph EmbeddingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Automated regime detection in multidimensional time series data using sliced Wasserstein k-means clustering
Recent work has proposed Wasserstein k-means (Wk-means) clustering as a powerful method to identify regimes in time series data, and one-dimensional asset returns in particular. In this paper, we begin by studying in det…
ClusteringTime SeriesModified Multidimensional Scaling and High Dimensional Clustering
Multidimensional scaling is an important dimension reduction tool in statistics and machine learning. Yet few theoretical results characterizing its statistical performance exist, not to mention any in high dimensions. B…
ClusteringDimensionality ReductionVocal Bursts Intensity PredictionScope of Research on Particle Swarm Optimization Based Data Clustering
Optimization is nothing but a mathematical technique which finds maxima or minima of any function of concern in some realistic region. Different optimization techniques are proposed which are competing for the best solut…
ClusteringClustering Multidimensional Data with PSO based Algorithm
Data clustering is a recognized data analysis method in data mining whereas K-Means is the well known partitional clustering method, possessing pleasant features. We observed that, K-Means and other partitional clusterin…
ClusteringExact Cluster Recovery via Classical Multidimensional Scaling
Classical multidimensional scaling is an important dimension reduction technique. Yet few theoretical results characterizing its statistical performance exist. This paper provides a theoretical framework for analyzing th…
ClusteringDimensionality Reduction