paper-with-me

Papers

Transforming Graphs for Enhanced Attribute Clustering: An Innovative Graph Transformer-Based Method

2023-06-20 · Shuo Han, Jiacheng Liu, Jiayun Wu, Yinan Chen, Li Tao

Graph Representation Learning (GRL) is an influential methodology, enabling a more profound understanding of graph-structured data and aiding graph clustering, a critical task across various domains. The recent incursion of attention mechanisms, originally an artifact of Natural Language Processing (NLP), into the realm of graph learning has spearheaded a notable shift in research trends. Consequently, Graph Attention Networks (GATs) and Graph Attention Auto-Encoders have emerged as preferred tools for graph clustering tasks. Yet, these methods primarily employ a local attention mechanism, thereby curbing their capacity to apprehend the intricate global dependencies between nodes within graphs. Addressing these impediments, this study introduces an innovative method known as the Graph Transformer Auto-Encoder for Graph Clustering (GTAGC). By melding the Graph Auto-Encoder with the Graph Transformer, GTAGC is adept at capturing global dependencies between nodes. This integration amplifies the graph representation and surmounts the constraints posed by the local attention mechanism. The architecture of GTAGC encompasses graph embedding, integration of the Graph Transformer within the autoencoder structure, and a clustering component. It strategically alternates between graph embedding and clustering, thereby tailoring the Graph Transformer for clustering tasks, whilst preserving the graph's global structural information. Through extensive experimentation on diverse benchmark datasets, GTAGC has exhibited superior performance against existing state-of-the-art graph clustering methodologies.

📄 PDF Abstract BibTeX arXiv:2306.11307

Code (0)

등록된 구현이 없습니다.

Tasks

AttributeClusteringGraph AttentionGraph ClusteringGraph EmbeddingGraph LearningGraph Representation LearningRepresentation Learning

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
LapEigen 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Position-Wise Feed-Forward Layer 설명 없음
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Adam 설명 없음

Similar Papers 제목 키워드 기반

Cross-Contrastive Clustering for Multimodal Attributed Graphs with Dual Graph Filtering

2025-11-25 · Haoran Zheng, Renchi Yang, Hongtao Wang, Jianliang Xu arxiv

Multimodal Attributed Graphs (MMAGs) are an expressive data model for representing the complex interconnections among entities that associate attributes from multiple data modalities (text, images, etc.). Clustering over…

Representation LearningContrastive LearningCommunity DetectionGraph Clustering

Modularity aided consistent attributed graph clustering via coarsening

2024-07-09 · Samarth Bhatia, Yukti Makhija, Manoj Kumar, Sandeep Kumar

Graph clustering is an important unsupervised learning technique for partitioning graphs with attributes and detecting communities. However, current methods struggle to accurately capture true community structures and in…

ClusteringGraph ClusteringStochastic Block Model

A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation

2024-08-10 · Yiran Li, Gongyao Guo, Jieming Shi, Renchi Yang 외

Attributed networks containing entity-specific information in node attributes are ubiquitous in modeling social networks, e-commerce, bioinformatics, etc. Their inherent network topology ranges from simple graphs to hype…

AttributeClusteringGPUGraph Clustering+2

GCL-GCN: Graphormer and Contrastive Learning Enhanced Attributed Graph Clustering Network

2025-07-25 · Binxiong Li, Xu Xiang, Xue Li, Quanzhou Lou 외 arxiv

Attributed graph clustering holds significant importance in modern data analysis. However, due to the complexity of graph data and the heterogeneity of node attributes, leveraging graph information for clustering remains…

Contrastive LearningGraph Clustering

Non-linear Attributed Graph Clustering by Symmetric NMF with PU Learning

2018-09-21 · Seiji Maekawa, Koh Takeuch, Makoto Onizuka

We consider the clustering problem of attributed graphs. Our challenge is how we can design an effective and efficient clustering method that precisely captures the hidden relationship between the topology and the attrib…

AttributeClusteringGraph Clustering