Triangle Completion Time Prediction Using Time-Conserving Embedding
Lists
Only you see this
Abstract
A triangle is an important building block of social networks, so the study of triangle formation in a network is critical for better understanding of the dynamics of such networks. Existing works in this area mainly focus on triangle counting, or generating synthetic networks by matching the prevalence of triangles in real-life networks. While these efforts increase our understanding of triangle’s role in a network, they have limited practical utility. In this work we undertake an interesting problem relating to triangle formation in a network, which is, to predict the time by which the third link of a triangle appears in a network. Since the third link completes a triangle, we name this task as Triangle Completion Time Prediction (TCTP). Solution to TCTP problem is valuable for real-life link recommendation in social/e-commerce networks, also it provides vital information for dynamic network analysis and community generation study.
BibTeX
@inproceedings{dave2019triangle,
author = {Vachik S. Dave and Mohammad Al Hasan},
title = {{Triangle Completion Time Prediction Using Time-Conserving Embedding}},
booktitle = {ECML/PKDD},
year = {2019},
url = {https://openreview.net/forum?id=3MWDxIiTqV},
}Loading related content...