Manuel Curado

Orcid: 0000-0003-2307-1760

According to our database1, Manuel Curado authored at least 27 papers between 2015 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A novel measure to identify influential nodes: Return Random Walk Gravity Centrality.
Inf. Sci., May, 2023

An Exploratory Data Analysis for League of Legends Professional Match Data.
Proceedings of the Workshop Proceedings of the 19th International Conference on Intelligent Environments (IE2023), 2023

2022
A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes.
J. Comput. Sci., 2022

An analysis of twitter as a relevant human mobility proxy.
GeoInformatica, 2022

Anew centrality measure in dense networks based on two-way random walk betweenness.
Appl. Math. Comput., 2022

EMO-Learning: Towards an intelligent tutoring system to assess online students' emotions.
Proceedings of the 18th International Conference on Intelligent Environments, 2022

2021
Network embedding from the line graph: Random walkers and boosted classification.
Pattern Recognit. Lett., 2021

Understanding mobility in Rome by means of a multiplex network with data.
J. Comput. Sci., 2021

A New Methodology to Study Street Accessibility: A Case Study of Avila (Spain).
ISPRS Int. J. Geo Inf., 2021

Identifying mobility patterns by means of centrality algorithms in multiplex networks.
Appl. Math. Comput., 2021

2020
Analysis and comparison of centrality measures applied to urban networks with data.
J. Comput. Sci., 2020

Seeking affinity structure: Strategies for improving m-best graph matching.
Inf. Sci., 2020

Return random walks for link prediction.
Inf. Sci., 2020

Early Detection of Alzheimer's Disease: Detecting Asymmetries with a Return Random Walk Link Predictor.
Entropy, 2020

2019
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach.
Symmetry, 2019

Dirichlet densifier bounds: Densifying beyond the spectral gap constraint.
Pattern Recognit. Lett., 2019

Dirichlet densifiers for improved commute times estimation.
Pattern Recognit., 2019

Network Embedding by Walking on the Line Graph.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2019

2018
Dirichlet Densifiers: Beyond Constraining the Spectral Gap.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018

Semi-supervised Graph Rewiring with the Dirichlet Principle.
Proceedings of the 24th International Conference on Pattern Recognition, 2018

net4Lap: Neural Laplacian Regularization for Ranking and Re-Ranking.
Proceedings of the 24th International Conference on Pattern Recognition, 2018

2017
The mutual information between graphs.
Pattern Recognit. Lett., 2017

On the Interplay Between Strong Regularity and Graph Densification.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2017

Shape Simplification Through Graph Sparsification.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2017

2016
Dirichlet Graph Densifiers.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2016

Commute Times in Dense Graphs.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2016

2015
Similarity Analysis from Limiting Quantum Walks.
Proceedings of the Similarity-Based Pattern Recognition - Third International Workshop, 2015


  Loading...