Beyond The Evidence Lower Bound: Dual Variational Graph Auto-Encoders For Node Clustering.
Nairouz MrabahMohamed BouguessaRiadh KsantiniPublished in: SDM (2023)
Keyphrases
- lower bound
- directed graph
- graph theoretic
- graph structure
- upper bound
- graph clustering
- clustering algorithm
- graph partitioning
- clustering method
- branch and bound algorithm
- k means
- graph model
- finding the shortest path
- random walk
- nodes of a graph
- edge weights
- graph representation
- cluster analysis
- dirichlet process mixture models
- undirected graph
- data clustering
- graph theory
- bipartite graph
- np hard
- worst case
- unsupervised learning
- objective function
- branch and bound
- graph construction
- graph mining
- spectral clustering
- image segmentation
- self organizing maps
- polynomial approximation
- path length
- normalized cut
- social networks
- data points
- primal dual
- shortest path
- graph matching
- structured data
- document clustering
- video coding
- tree structure