TeleGraph: A Benchmark Dataset for Hierarchical Link Prediction
- URL: http://arxiv.org/abs/2204.07703v2
- Date: Sun, 14 Jan 2024 09:54:30 GMT
- Title: TeleGraph: A Benchmark Dataset for Hierarchical Link Prediction
- Authors: Min Zhou, Bisheng Li, Menglin Yang, Lujia Pan
- Abstract summary: Link prediction is a key problem for network-structured data, attracting considerable research efforts owing to its diverse applications.
We present a new benchmark dataset TeleGraph, a highly sparse and hierarchical telecommunication network associated with rich node attributes.
Our empirical results suggest that most of the algorithms fail to produce a satisfactory performance on a nearly tree-like dataset.
- Score: 11.051062214108894
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Link prediction is a key problem for network-structured data, attracting
considerable research efforts owing to its diverse applications. The current
link prediction methods focus on general networks and are overly dependent on
either the closed triangular structure of networks or node attributes. Their
performance on sparse or highly hierarchical networks has not been well
studied. On the other hand, the available tree-like benchmark datasets are
either simulated, with limited node information, or small in scale. To bridge
this gap, we present a new benchmark dataset TeleGraph, a highly sparse and
hierarchical telecommunication network associated with rich node attributes,
for assessing and fostering the link inference techniques. Our empirical
results suggest that most of the algorithms fail to produce a satisfactory
performance on a nearly tree-like dataset, which calls for special attention
when designing or deploying the link prediction algorithm in practice.
Related papers
- Unsupervised Graph Attention Autoencoder for Attributed Networks using
K-means Loss [0.0]
We introduce a simple, efficient, and clustering-oriented model based on unsupervised textbfGraph Attention textbfAutotextbfEncoder for community detection in attributed networks.
The proposed model adeptly learns representations from both the network's topology and attribute information, simultaneously addressing dual objectives: reconstruction and community discovery.
arXiv Detail & Related papers (2023-11-21T20:45:55Z) - Network Alignment with Transferable Graph Autoencoders [79.89704126746204]
We propose a novel graph autoencoder architecture designed to extract powerful and robust node embeddings.
We prove that the generated embeddings are associated with the eigenvalues and eigenvectors of the graphs.
Our proposed framework also leverages transfer learning and data augmentation to achieve efficient network alignment at a very large scale without retraining.
arXiv Detail & Related papers (2023-10-05T02:58:29Z) - Revisiting Link Prediction: A Data Perspective [61.52668130971441]
Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction.
Evidence in existing literature underscores the absence of a universally best algorithm suitable for all datasets.
We recognize three fundamental factors critical to link prediction: local structural proximity, global structural proximity, and feature proximity.
arXiv Detail & Related papers (2023-10-01T21:09:59Z) - A parameterised model for link prediction using node centrality and
similarity measure based on graph embedding [5.507008181141738]
Link prediction is a key aspect of graph machine learning.
It involves predicting new links that may form between network nodes.
Existing models have significant shortcomings.
We present the Node Centrality and Similarity Based.
Model (NCSM), a novel method for link prediction tasks.
arXiv Detail & Related papers (2023-09-11T13:13:54Z) - An Approach for Link Prediction in Directed Complex Networks based on
Asymmetric Similarity-Popularity [0.0]
This paper introduces a link prediction method designed explicitly for directed networks.
It is based on the similarity-popularity paradigm, which has recently proven successful in undirected networks.
The algorithms approximate the hidden similarities as shortest path distances using edge weights that capture and factor out the links' asymmetry and nodes' popularity.
arXiv Detail & Related papers (2022-07-15T11:03:25Z) - Optimal Propagation for Graph Neural Networks [51.08426265813481]
We propose a bi-level optimization approach for learning the optimal graph structure.
We also explore a low-rank approximation model for further reducing the time complexity.
arXiv Detail & Related papers (2022-05-06T03:37:00Z) - BSAL: A Framework of Bi-component Structure and Attribute Learning for
Link Prediction [33.488229191263564]
We propose a bicomponent structural and attribute learning framework (BSAL) that is designed to adaptively leverage information from topology and feature spaces.
BSAL constructs a semantic topology via the node attributes and then gets the embeddings regarding the semantic view.
It provides a flexible and easy-to-implement solution to adaptively incorporate the information carried by the node attributes.
arXiv Detail & Related papers (2022-04-18T03:12:13Z) - Temporal Graph Network Embedding with Causal Anonymous Walks
Representations [54.05212871508062]
We propose a novel approach for dynamic network representation learning based on Temporal Graph Network.
For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings.
We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
arXiv Detail & Related papers (2021-08-19T15:39:52Z) - Anomaly Detection on Attributed Networks via Contrastive Self-Supervised
Learning [50.24174211654775]
We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks.
Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair.
A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
arXiv Detail & Related papers (2021-02-27T03:17:20Z) - Representation Learning of Graphs Using Graph Convolutional Multilayer
Networks Based on Motifs [17.823543937167848]
mGCMN is a novel framework which utilizes node feature information and the higher order local structure of the graph.
It will greatly improve the learning efficiency of the graph neural network and promote a brand-new learning mode establishment.
arXiv Detail & Related papers (2020-07-31T04:18:20Z) - Progressive Graph Convolutional Networks for Semi-Supervised Node
Classification [97.14064057840089]
Graph convolutional networks have been successful in addressing graph-based tasks such as semi-supervised node classification.
We propose a method to automatically build compact and task-specific graph convolutional networks.
arXiv Detail & Related papers (2020-03-27T08:32:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.