Pedro Ribeiro

Orcid: 0000-0002-5768-1383

Affiliations:
  • University of Porto, Computer Science Department, Portugal


According to our database1, Pedro Ribeiro authored at least 54 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs.
CoRR, 2024

2023
Multilayer Quantile Graph for Multivariate Time Series Analysis and Dimensionality Reduction.
CoRR, 2023

MHVG2MTS: Multilayer Horizontal Visibility Graphs for Multivariate Time Series Analysis.
CoRR, 2023

The GANfather: Controllable generation of malicious activity to improve defence systems.
Proceedings of the 4th ACM International Conference on AI in Finance, 2023

From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs.
Proceedings of the 4th ACM International Conference on AI in Finance, 2023

2022
Novel features for time series analysis: a complex networks approach.
Data Min. Knowl. Discov., 2022

A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets.
ACM Comput. Surv., 2022

Towards the Concept of Spatial Network Motifs.
Proceedings of the Complex Networks and Their Applications XI, 2022

Improving the Characterization and Comparison of Football Players with Spatial Flow Motifs.
Proceedings of the Complex Networks and Their Applications XI, 2022

2021
Time series analysis via network science: Concepts and algorithms.
WIREs Data Mining Knowl. Discov., 2021

Anti-Money Laundering Alert Optimization Using Machine Learning with Graphs.
CoRR, 2021

Similarity of Football Players Using Passing Sequences.
Proceedings of the Machine Learning and Data Mining for Sports Analytics, 2021

2020
PseudoChecker: an integrated online platform for gene inactivation inference.
Nucleic Acids Res., 2020

FOCAS: penalising friendly citations to improve author ranking.
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

StreamFaSE: An Online Algorithm for Subgraph Counting in Dynamic Networks.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
TensorCast: forecasting and mining with coupled tensors.
Knowl. Inf. Syst., 2019

Temporal network alignment via GoT-WAVE.
Bioinform., 2019

Finding Dominant Nodes Using Graphlets.
Proceedings of the Complex Networks and Their Applications VIII, 2019

2018
Querying Volatile and Dynamic Networks.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

GoT-WAVE: Temporal network alignment using graphlet-orbit transitions.
CoRR, 2018

TensorCast: Forecasting Time-Evolving Networks with Contextual Information.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Hierarchical Expert Profiling Using Heterogeneous Information Networks.
Proceedings of the Discovery Science - 21st International Conference, 2018

2017
Extending the Applicability of Graphlets to Directed Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

Temporal Network Comparison using Graphlet-orbit Transitions.
CoRR, 2017

Scalable subgraph counting using MapReduce.
Proceedings of the Symposium on Applied Computing, 2017

Evolutionary role mining in complex networks by ensemble clustering.
Proceedings of the Symposium on Applied Computing, 2017

TensorCast: Forecasting with Context Using Coupled Tensors (Best Paper Award).
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
FastStep: Scalable Boolean Matrix Decomposition.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016

Large Scale Graph Representations for Subgraph Census.
Proceedings of the Advances in Network Science, 2016

A Subgraph-Based Ranking System for Professional Tennis Players.
Proceedings of the Complex Networks VII, 2016

2015
Rand-FaSE: fast approximate subgraph census.
Soc. Netw. Anal. Min., 2015

Dynamic inference of social roles in information cascades.
Data Min. Knowl. Discov., 2015

Network comparison using directed graphlets.
CoRR, 2015

Discovering weighted motifs in gene co-expression networks.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Pairwise structural role mining for user categorization in information cascades.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Querying Volatile and Dynamic Networks.
Encyclopedia of Social Network Analysis and Mining, 2014

G-Tries: a data structure for storing and finding subgraphs.
Data Min. Knowl. Discov., 2014

Parallel Subgraph Counting for Multicore Architectures.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2014

A Scalable Parallel Approach for Subgraph Census Computation.
Proceedings of the Euro-Par 2014: Parallel Processing Workshops, 2014

Discovering Colored Network Motifs.
Proceedings of the Complex Networks V, 2014

2013
Towards a faster network-centric subgraph census.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

2012
Parallel discovery of network motifs.
J. Parallel Distributed Comput., 2012

Motif Mining in Weighted Networks.
Proceedings of the 12th IEEE International Conference on Data Mining Workshops, 2012

Querying subgraph sets with g-tries.
Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks, 2012

Event detection in evolving networks.
Proceedings of the Fourth International Conference on Computational Aspects of Social Networks, 2012

Comparison of co-authorship networks across scientific fields using motifs
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Network Node Label Acquisition and Tracking.
Proceedings of the Progress in Artificial Intelligence, 2011

2010
Efficient Subgraph Frequency Estimation with G-Tries.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

g-tries: an efficient data structure for discovering network motifs.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Efficient Parallel Subgraph Counting Using G-Tries.
Proceedings of the 2010 IEEE International Conference on Cluster Computing, 2010

A Parallel Algorithm for Counting Subgraphs in Complex Networks.
Proceedings of the Biomedical Engineering Systems and Technologies, 2010

Parallel Calculation of Subgraph Census in Biological Networks.
Proceedings of the BIOINFORMATICS 2010, 2010

2009
Teaching Artificial Intelligence and Logic Programming in a Competitive Environment.
Informatics Educ., 2009

Strategies for Network Motifs Discovery.
Proceedings of the Fifth International Conference on e-Science, 2009


  Loading...