Deep Amortized Relational Model with Group-Wise Hierarchical Generative Process
In this paper, we propose Deep amortized Relational Model (DaRM) with group-wise hierarchical generative process for community discovery and link prediction on relational data (e.g., graph, network). It provides an efficient neural relational model architecture by grouping nodes in a group-wise view rather than node-wise or edge-wise view. DaRM simultaneously learns what makes a group, how to divide nodes into groups, and how to adaptively control the number of groups. The dedicated group generative process is able to sufficiently exploit pair-wise or higher-order interactions between data points in both inter-group and intra-group, which is useful to sufficiently mine the hidden structure among data. A series of experiments have been conducted on both synthetic and real-world datasets. The experimental results demonstrated that DaRM can obtain high performance on both community detection and link prediction tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
Community DetectionLink PredictionSimilar Papers 제목 키워드 기반
Cluster-Wise Hierarchical Generative Model for Deep Amortized Clustering
In this paper, we propose Cluster-wise Hierarchical Generative Model for deep amortized clustering (CHiGac). It provides an efficient neural clustering architecture by grouping data points in a cluster-wise view rath…
ClusteringSemi-crowdsourced Clustering with Deep Generative Models
We consider the semi-supervised clustering problem where crowdsourcing provides noisy information about the pairwise comparisons on a small subset of data, i.e., whether a sample pair is in the same cluster. We propose a…
ClusteringVariational InferenceLearning Hierarchical Relational Representations through Relational Convolutions
An evolving area of research in deep learning is the study of architectures and inductive biases that support the learning of relational feature representations. In this paper, we address the challenge of learning repres…
RelationSemi-Supervised Clustering with Inaccurate Pairwise Annotations
Pairwise relational information is a useful way of providing partial supervision in domains where class labels are difficult to acquire. This work presents a clustering model that incorporates pairwise annotations in the…
ClusteringStochastic Block ModelGroupNet: Multiscale Hypergraph Neural Networks for Trajectory Prediction with Relational Reasoning
Demystifying the interactions among multiple agents from their past trajectories is fundamental to precise and interpretable trajectory prediction. However, previous works only consider pair-wise interactions with limite…
PredictionRelational ReasoningRepresentation LearningTrajectory Prediction