Scalable Heterogeneous Social Network Alignment through Synergistic Graph Partition

@article{Ren2020ScalableHS,
  title={Scalable Heterogeneous Social Network Alignment through Synergistic Graph Partition},
  author={Yuxiang Ren and Lin Meng and Jiawei Zhang},
  journal={Proceedings of the 31st ACM Conference on Hypertext and Social Media},
  year={2020}
}
Social network alignment has been an important research problem for social network analysis in recent years. With the identified shared users across networks, it will provide researchers with the opportunity to achieve a more comprehensive understanding of users' social activities both within and across networks. Social network alignment is a very difficult problem. Besides the challenges introduced by the network heterogeneity, the network alignment can be reduced to a combinatorial… 

From One to All: Learning to Match Heterogeneous and Partially Overlapped Graphs

TLDR
Experimental results demonstrate that the proposed unsupervised learning-to-match method outperforms state-of-the-art graph matching methods.

References

SHOWING 1-10 OF 41 REFERENCES

Link Prediction with Cardinality Constraint

TLDR
An iterative variable updating based link prediction framework ITERCLIPS (Iterative Constrained Link Prediction & Selection) and a greedy link selection step is introduced in this paper, which picks links greedily while preserving the link cardinality constraints simultaneously.

Inferring anchor links across multiple heterogeneous social networks

TLDR
This paper proposes to extract heterogeneous features from multiple heterogeneous networks for anchor link prediction, including user's social, spatial, temporal and text information, and derives an effective solution, MNA (Multi-Network Anchoring), to infer anchor links w.r.t. the one-to-one constraint.

Joint Link Prediction and Network Alignment via Cross-graph Embedding

TLDR
It is argued that these two tasks are relevant and present a joint link prediction and network alignment framework, whereby a novel cross-graph node embedding technique is devised to allow for information propagation.

Broad Learning Through Fusions

Meta Diagram Based Active Social Networks Alignment

TLDR
A novel network alignment model, namely ActiveIter, is introduced in this paper, which defines a set of inter-network meta diagrams for anchor link feature extraction, adopts active learning for effective label query and uses greedy link selection for anchor links cardinality filtering.

MEgo2Vec: Embedding Matched Ego Networks for User Alignment Across Social Networks

TLDR
A graph neural network is proposed to directly represent the ego networks of two users to be aligned into an embedding, based on which the alignment label is predicted, which achieves significantly better performance than the state-of-the-art comparison methods.

Learning to Map Social Network Users by Unified Manifold Alignment on Hypergraph

TLDR
A unified hypergraph learning framework named unified manifold alignment on hypergraph (UMAH) is proposed for this task and experimental results have demonstrated the effectiveness of UMAH in mapping users across networks.

DeepMatching: A Structural Seed Identification Framework for Social Network Alignment

TLDR
By exploiting the observation that a true mapping leads to a large portion of consistent edges among the mapped nodes, this paper formally defines the credibility of a mapping as its deviation from a random one.

DualAligner: a dual alignment-based strategy to align protein interaction networks

TLDR
DualAligner performs dual network alignment, in which both region-to-region alignment, where whole sub graph of one network is aligned to subgraph of another, and protein- to-protein alignment,Where individual proteins in networks are aligned to one another, are performed to achieve higher accuracy network alignments.

Meta-Graph Based Recommendation Fusion over Heterogeneous Information Networks

TLDR
This paper introduces the concept of meta-graph to HIN-based recommendation, and solves the information fusion problem with a "matrix factorization + factorization machine (FM)" approach, and proposes to use FM with Group lasso (FMG) to automatically learn from the observed ratings to effectively select useful meta- graph based features.