ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation

11/02/2018
by   Jiankai Sun, et al.
0

Directed graphs have been widely used in Community Question Answering services (CQAs) to model asymmetric relationships among different types of nodes in CQA graphs, e.g., question, answer, user. Asymmetric transitivity is an essential property of directed graphs, since it can play an important role in downstream graph inference and analysis. Question difficulty and user expertise follow the characteristic of asymmetric transitivity. Maintaining such properties, while reducing the graph to a lower dimensional vector embedding space, has been the focus of much recent research. In this paper, we tackle the challenge of directed graph embedding with asymmetric transitivity preservation and then leverage the proposed embedding method to solve a fundamental task in CQAs: how to appropriately route and assign newly posted questions to users with the suitable expertise and interest in CQAs. The technique incorporates graph hierarchy and reachability information naturally by relying on a non-linear transformation that operates on the core reachability and implicit hierarchy within such graphs. Subsequently, the methodology levers a factorization-based approach to generate two embedding vectors for each node within the graph, to capture the asymmetric transitivity. Extensive experiments show that our framework consistently and significantly outperforms the state-of-the-art baselines on two diverse real-world tasks: link prediction, and question difficulty estimation and expert finding in online forums like Stack Exchange. Particularly, our framework can support inductive embedding learning for newly posted questions (unseen nodes during training), and therefore can properly route and assign these kinds of questions to experts in CQAs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2018

QDEE: Question Difficulty and Expertise Estimation in Community Question Answering Sites

In this paper, we present a framework for Question Difficulty and Expert...
research
11/22/2019

An End-to-End Framework for Cold Question Routing in Community Question Answering Services

Routing newly posted questions (a.k.a cold questions) to potential answe...
research
10/14/2021

Asymmetric Graph Representation Learning

Despite the enormous success of graph neural networks (GNNs), most exist...
research
08/09/2020

Adversarial Directed Graph Embedding

Node representation learning for directed graphs is critically important...
research
05/24/2019

Statistical embedding for directed graphs

We propose a novel statistical node embedding of directed graphs, which ...
research
08/04/2022

Simplifying Sparse Expert Recommendation by Revisiting Graph Diffusion

Community Question Answering (CQA) websites have become valuable knowled...
research
06/01/2019

DiffQue: Estimating Relative Difficulty of Questions in Community Question Answering Services

Automatic estimation of relative difficulty of a pair of questions is an...

Please sign up or login with your details

Forgot password? Click here to reset