25 citations · 147 across the 36 of their papers we have counts for
12 papers · 1 filter
How Predicted Links Influence Network Evolution: Disentangling Choice and Algorithmic Feedback in Dynamic Graphs
Mathilde Perez, Raphaël Romero, Jefrey Lijffijt +1
Link prediction models are increasingly used to recommend interactions in evolving networks, yet their impact on network structure is typically assessed from static snapshots. In p…
Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms
Raphaël Romero, Maarten Buyl, Tijl De Bie +1
Dynamic Link Prediction (DLP) addresses the prediction of future links in evolving networks. However, accurately portraying the performance of DLP algorithms poses challenges that…
New Perspectives on the Evaluation of Link Prediction Algorithms for Dynamic Graphs
Raphaël Romero, Tijl De Bie, Jefrey Lijffijt
There is a fast-growing body of research on predicting future links in dynamic networks, with many new algorithms. Some benchmark data exists, and performance evaluations commonly…
Adversarial Robustness of Probabilistic Network Embedding for Link Prediction
Xi Chen, Bo Kang, Jefrey Lijffijt +1
In today's networked society, many real-world problems can be formalized as predicting links in networks, such as Facebook friendship suggestions, e-commerce recommendations, and t…
CSNE: Conditional Signed Network Embedding
Alexandru Mara, Yoosof Mashayekhi, Jefrey Lijffijt +1
Signed networks are mathematical structures that encode positive and negative relations between entities such as friend/foe or trust/distrust. Recently, several papers studied the…
Benchmarking Network Embedding Models for Link Prediction: Are We Making Progress?
Alexandru Mara, Jefrey Lijffijt, Tijl De Bie
Network embedding methods map a network's nodes to vectors in an embedding space, in such a way that these representations are useful for estimating some notion of similarity or pr…
Block-Approximated Exponential Random Graphs
Florian Adriaens, Alexandru Mara, Jefrey Lijffijt +1
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. By utilizing fast matrix block-approximation techniques,…
Explainable Subgraphs with Surprising Densities: A Subgroup Discovery Approach
Junning Deng, Bo Kang, Jefrey Lijffijt +1
The connectivity structure of graphs is typically related to the attributes of the nodes. In social networks for example, the probability of a friendship between two people depends…
Mining Subjectively Interesting Attributed Subgraphs
Anes Bendimerad, Ahmad Mel, Jefrey Lijffijt +3
Community detection in graphs, data clustering, and local pattern mining are three mature fields of data mining and machine learning. In recent years, attributed subgraph mining is…
Opinion Dynamics with Backfire Effect and Biased Assimilation
Xi Chen, Panayiotis Tsaparas, Jefrey Lijffijt +1
The democratization of AI tools for content generation, combined with unrestricted access to mass media for all (e.g. through microblogging and social media), makes it increasingly…
EvalNE: A Framework for Evaluating Network Embeddings on Link Prediction
Alexandru Mara, Jefrey Lijffijt, Tijl De Bie
In this paper we present EvalNE, a Python toolbox for evaluating network embedding methods on link prediction tasks. Link prediction is one of the most popular choices for evaluati…
From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths
Florian Adriaens, Tijl De Bie, Aristides Gionis +2
Social networks often provide only a binary perspective on social ties: two individuals are either connected or not. While sometimes external information can be used to infer the s…