Weighted Graph Nodes Clustering via Gumbel Softmax

2021-02-22 · Deepak Bhaskar Acharya, Huaming Zhang

Graph is a ubiquitous data structure in data science that is widely applied in social networks, knowledge representation graphs, recommendation systems, etc. When given a graph dataset consisting of one graph or more graphs, where the graphs are weighted in general, the first step is often to find clusters in the graphs. In this paper, we present some ongoing research results on graph clustering algorithms for clustering weighted graph datasets, which we name as Weighted Graph Node Clustering via Gumbel Softmax (WGCGS for short). We apply WGCGS on the Karate club weighted network dataset. Our experiments demonstrate that WGCGS can efficiently and effectively find clusters in the Karate club weighted network dataset. Our algorithm's effectiveness is demonstrated by (1) comparing the clustering result obtained from our algorithm and the given labels of the dataset; and (2) comparing various metrics between our clustering algorithm and other state-of-the-art graph clustering algorithms.

📄 PDF Abstract BibTeX arXiv:2102.10775

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringGraph ClusteringNode ClusteringRecommendation Systems

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Gumbel Softmax 설명 없음

Community Detection Clustering via Gumbel Softmax

2020-05-05 · Deepak Bhaskar Acharya, Huaming Zhang

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 amon…

Clustering Community Detection Deep Learning Graph Clustering+4

Generalized Gumbel-Softmax Gradient Estimator for Generic Discrete Random Variables

2020-03-04 · Weonyoung Joo, Dongjun Kim, Seungjae Shin, Il-Chul Moon

Estimating the gradients of stochastic nodes in stochastic computational graphs is one of the crucial research questions in the deep generative modeling community, which enables the gradient descent optimization on neura…

Topic Models

Conditional Gumbel-Softmax for constrained feature selection with application to node selection in wireless sensor networks

2024-06-03 · Thomas Strypsteen, Alexander Bertrand

In this paper, we introduce Conditional Gumbel-Softmax as a method to perform end-to-end learning of the optimal feature subset for a given task and deep neural network (DNN) model, while adhering to certain pairwise con…

EEG feature selection

Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax

2025-08-24 · Marcel Hoffmann, Lukas Galke, Ansgar Scherp arxiv

Graph homophily has been considered an essential property for message-passing neural networks (MPNN) in node classification. Recent findings suggest that performance is more closely tied to the consistency of neighborhoo…

Node Classification

Categorical Unsupervised Variational Acoustic Clustering

2025-04-10 · Luan Vinícius Fiorio, Ivana Nikoloska, Ronald M. Aarts

We propose a categorical approach for unsupervised variational acoustic clustering of audio data in the time-frequency domain. The consideration of a categorical distribution enforces sharper clustering even when data po…

Clustering