Towards Faster Deep Graph Clustering via Efficient Graph Auto-Encoder
Abstract
Supplementary Material
- Download
- 2.11 MB
References
Index Terms
- Towards Faster Deep Graph Clustering via Efficient Graph Auto-Encoder
Recommendations
A faster deep graph clustering network based on dynamic graph weight update mechanism
AbstractDeep graph clustering has attracted considerable attention for its potential in handling complex graph-structured data. However, existing approaches often prioritize improving embedded representations, leading to computationally intensive models, ...
Deep graph clustering by integrating community structure with neighborhood information
AbstractDeep graph clustering approaches employ deep graph neural networks to encode node embeddings and subsequently partition nodes based on these representations. Recent one-step methods have demonstrated progress; however, they often encounter issues ...
Convolutional dynamic auto-encoder: a clustering method for semantic images
AbstractAutoencoders have been employed in various deep embedded clustering methods, but they suffer from Feature Randomness and Feature Drift problems when it comes to high-semantic data. Dynamic autoencoder (DynAE) provides a better trade-off between F...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Natural Science Foundation of China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 287Total Downloads
- Downloads (Last 12 months)287
- Downloads (Last 6 weeks)105
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in