Name
Title | ||
|---|---|---|
When to remember where you came from - node representation learning in higher-order networks. |
Abstract | ||
|---|---|---|
For trajectory data that tend to have beyond first-order (i.e., non-Markovian) dependencies, higher-order networks have been shown to accurately capture details lost with the standard aggregate network representation. At the same time, representation learning has shown success on a wide range of network tasks, removing the need to hand-craft features for these tasks. In this work, we propose a node representation learning framework called EVO or Embedding Variable Orders, which captures non-Markovian dependencies by combining work on higher-order networks with work on node embeddings. We show that EVO outperforms baselines in tasks where high-order dependencies are likely to matter, demonstrating the benefits of considering high-order dependencies in node embeddings. We also provide insights into when it does or does not help to capture these dependencies. To the best of our knowledge, this is the first work on representation learning for higher-order networks.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3341161.3342911 | ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining
Vancouver
British Columbia
Canada
August, 2019 |
Keywords | Field | DocType |
higher-order networks,node representation learning framework,nonMarkovian dependencies,node embeddings,high-order dependencies,aggregate network representation,embedding variable orders,trajectory data | Computer science,Artificial intelligence,Machine learning,Feature learning | Conference |
ISSN | ISBN | Citations |
2473-9928 | 978-1-4503-6868-1 | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Caleb Belth | 1 | 3 | 1.75 |
| Fahad Kamran | 2 | 0 | 1.35 |
| Donna Tjandra | 3 | 0 | 0.34 |
| Danai Koutra | 4 | 868 | 47.66 |