Web: http://arxiv.org/abs/2205.05168

May 12, 2022, 1:11 a.m. | Maedeh Ahmadi, Mehran Safayani, Abdolreza Mirzaei

cs.LG updates on arXiv.org arxiv.org

Attributed graph clustering or community detection which learns to cluster
the nodes of a graph is a challenging task in graph analysis. In this paper, we
introduce a contrastive learning framework for learning clustering-friendly
node embedding. Although graph contrastive learning has shown outstanding
performance in self-supervised graph learning, using it for graph clustering is
not well explored. We propose Gaussian mixture information maximization (GMIM)
which utilizes a mutual information maximization approach for node embedding.
Meanwhile, it assumes that the representation …

arxiv clustering deep graph information model

More from arxiv.org / cs.LG updates on arXiv.org

Data Analyst, Patagonia Action Works

@ Patagonia | Remote

Data & Insights Strategy & Innovation General Manager

@ Chevron Services Company, a division of Chevron U.S.A Inc. | Houston, TX

Faculty members in Research areas such as Bayesian and Spatial Statistics; Data Privacy and Security; AI/ML; NLP; Image and Video Data Analysis

@ Ahmedabad University | Ahmedabad, India

Director, Applied Mathematics & Computational Research Division

@ Lawrence Berkeley National Lab | Berkeley, Ca

Business Data Analyst

@ MainStreet Family Care | Birmingham, AL

Assistant/Associate Professor of the Practice in Business Analytics

@ Georgetown University McDonough School of Business | Washington DC