activity
20152024
most citedA Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

111 citations · 152 across the 14 of their papers we have counts for

collaborators

14 papers

cs.LG2024

Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs

Ahmad Naser Eddin, Jacopo Bono, David Aparício +3

Continuous-time dynamic graphs (CTDGs) are essential for modeling interconnected, evolving systems. Traditional methods for extracting knowledge from these graphs often depend on f…

cs.LG2023

The GANfather: Controllable generation of malicious activity to improve defence systems

Ricardo Ribeiro Pereira, Jacopo Bono, João Tiago Ascensão +3

Machine learning methods to aid defence systems in detecting malicious activity typically rely on labelled data. In some domains, such labelled data is unavailable or incomplete. I…

cs.LG2023

From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs

Ahmad Naser Eddin, Jacopo Bono, David Aparício +4

Many real-world datasets have an underlying dynamic graph structure, where entities and their interactions evolve over time. Machine learning models should consider these dynamics…

cs.LG2022★ 1 cited

T5QL: Taming language models for SQL generation

Samuel Arcadinho, David Aparício, Hugo Veiga +1

Automatic SQL generation has been an active research area, aiming at streamlining the access to databases by writing natural language with the given intent instead of writing SQL.…

cs.LG2021★ 13 cited

Anti-Money Laundering Alert Optimization Using Machine Learning with Graphs

Ahmad Naser Eddin, Jacopo Bono, David Aparício +4

Money laundering is a global problem that concerns legitimizing proceeds from serious felonies (1.7-4 trillion euros annually) such as drug dealing, human trafficking, or corruptio…

cs.SI2021

GUDIE: a flexible, user-defined method to extract subgraphs of interest from large graphs

Maria Inês Silva, David Aparício, Beatriz Malveiro +2

Large, dense, small-world networks often emerge from social phenomena, including financial networks, social media, or epidemiology. As networks grow in importance, it is often nece…

cs.SI2021

Finding NeMo: Fishing in banking networks using network motifs

Xavier Fontes, David Aparício, Maria Inês Silva +3

Banking fraud causes billion-dollar losses for banks worldwide. In fraud detection, graphs help understand complex transaction patterns and discovering new fraud schemes. This work…

cs.LG2021★ 4 cited

GuiltyWalker: Distance to illicit nodes in the Bitcoin network

Catarina Oliveira, João Torres, Maria Inês Silva +3

Money laundering is a global phenomenon with wide-reaching social and economic consequences. Cryptocurrencies are particularly susceptible due to the lack of control by authorities…

cs.LG2020

Machine learning methods to detect money laundering in the Bitcoin blockchain in the presence of label scarcity

Joana Lorenz, Maria Inês Silva, David Aparício +2

Every year, criminals launder billions of dollars acquired from serious felonies (e.g., terrorism, drug smuggling, or human trafficking) harming countless people and economies. Cry…

cs.LG2020★ 1 cited

ARMS: Automated rules management system for fraud detection

David Aparício, Ricardo Barata, João Bravo +2

Fraud detection is essential in financial services, with the potential of greatly reducing criminal activities and saving considerable resources for businesses and customers. We ad…

cs.DS2019★ 111 cited

A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva +2

Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have…

cs.LG2018★ 1 cited

GoT-WAVE: Temporal network alignment using graphlet-orbit transitions

David Aparício, Pedro Ribeiro, Tijana Milenković +1

Global pairwise network alignment (GPNA) aims to find a one-to-one node mapping between two networks that identifies conserved network regions. GPNA algorithms optimize node conser…

cs.SI2017★ 3 cited

Temporal Network Comparison using Graphlet-orbit Transitions

David Aparício, Pedro Ribeiro, Fernando Silva

Networks are widely used to model real-world systems and uncover their topological features. Network properties such as the degree distribution and shortest path length have been c…

cs.SI2015★ 18 cited

Network comparison using directed graphlets

David Aparício, Pedro Ribeiro, Fernando Silva

With recent advances in high-throughput cell biology the amount of cellular biological data has grown drastically. Such data is often modeled as graphs (also called networks) and s…