Manuel Curado

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 28

Top Topics

Link Prediction

Top Venues

J. Comput. Sci.

Publications

Luis Pérez-Sala, Manuel Curado, Leandro Tortosa, Jose F. Vicent
Increasing the Accuracy of a Deep Learning Model for Traffic Accident Severity Prediction by Adding a Temporal Category. ACR (2024)
Manuel Curado, Leandro Tortosa, Jose F. Vicent
A novel measure to identify influential nodes: Return Random Walk Gravity Centrality. Inf. Sci. 628 (2023)
Juan Morales-García, Antonio Llanes, Manuel Curado, Francisco Arcas-Túnez
An Exploratory Data Analysis for League of Legends Professional Match Data. Intelligent Environments (Workshops) (2023)
Fernando Terroso-Saenz, Andrés Muñoz, Francisco Arcas-Túnez, Manuel Curado
An analysis of twitter as a relevant human mobility proxy. GeoInformatica 26 (4) (2022)
Belén López, Francisco Arcas-Túnez, Magdalena Cantabella, Fernando Terroso-Sáenz, Manuel Curado, Andrés Muñoz
EMO-Learning: Towards an intelligent tutoring system to assess online students' emotions. Intelligent Environments (2022)
Manuel Curado, Rocio Rodriguez, Fernando Terroso-Saenz, Leandro Tortosa, Jose F. Vicent
A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes. J. Comput. Sci. 63 (2022)
Manuel Curado, Rocio Rodriguez, Leandro Tortosa, Jose F. Vicent
Anew centrality measure in dense networks based on two-way random walk betweenness. Appl. Math. Comput. 412 (2022)
Miguel Angel Lozano, Francisco Escolano, Manuel Curado, Edwin R. Hancock
Network embedding from the line graph: Random walkers and boosted classification. Pattern Recognit. Lett. 143 (2021)
Manuel Curado, Leandro Tortosa, Jose F. Vicent, Gevorg Yeghikyan
Understanding mobility in Rome by means of a multiplex network with data. J. Comput. Sci. 51 (2021)
Manuel Curado, Leandro Tortosa, Jose F. Vicent
Identifying mobility patterns by means of centrality algorithms in multiplex networks. Appl. Math. Comput. 406 (2021)
Manuel Curado, Rocio Rodriguez, Manuel Jimenez, Leandro Tortosa, Jose F. Vicent
A New Methodology to Study Street Accessibility: A Case Study of Avila (Spain). ISPRS Int. J. Geo Inf. 10 (7) (2021)
Manuel Curado, Francisco Escolano, Miguel Angel Lozano, Edwin R. Hancock
Seeking affinity structure: Strategies for improving m-best graph matching. Inf. Sci. 509 (2020)
Manuel Curado
Return random walks for link prediction. Inf. Sci. 510 (2020)
Manuel Curado, Leandro Tortosa, José-Francisco Vicent, Gevorg Yeghikyan
Analysis and comparison of centrality measures applied to urban networks with data. J. Comput. Sci. 43 (2020)
Manuel Curado, Francisco Escolano, Miguel Angel Lozano, Edwin R. Hancock
Early Detection of Alzheimer's Disease: Detecting Asymmetries with a Return Random Walk Link Predictor. Entropy 22 (4) (2020)
Manuel Curado, Francisco Escolano, Miguel Angel Lozano, Edwin R. Hancock
Dirichlet densifiers for improved commute times estimation. Pattern Recognit. 91 (2019)
Taras Agryzkov, Manuel Curado, Francisco Pedroche, Leandro Tortosa, José-Francisco Vicent
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach. Symmetry 11 (2) (2019)
Manuel Curado, Miguel Angel Lozano, Francisco Escolano, Edwin R. Hancock
Dirichlet densifier bounds: Densifying beyond the spectral gap constraint. Pattern Recognit. Lett. 125 (2019)
Miguel Angel Lozano, Manuel Curado, Francisco Escolano, Edwin R. Hancock
Network Embedding by Walking on the Line Graph. GbRPR (2019)
Manuel Curado, Francisco Escolano, Miguel Angel Lozano, Edwin R. Hancock
Semi-supervised Graph Rewiring with the Dirichlet Principle. ICPR (2018)
Manuel Curado, Francisco Escolano, Miguel Angel Lozano, Edwin R. Hancock
Dirichlet Densifiers: Beyond Constraining the Spectral Gap. S+SSPR (2018)
Manuel Curado, Francisco Escolano, Miguel Angel Lozano, Edwin Robert Hancock
net4Lap: Neural Laplacian Regularization for Ranking and Re-Ranking. ICPR (2018)
Francisco Escolano, Manuel Curado, Silvia Biasotti, Edwin R. Hancock
Shape Simplification Through Graph Sparsification. GbRPR (2017)
Marco Fiorucci, Alessandro Torcinovich, Manuel Curado, Francisco Escolano, Marcello Pelillo
On the Interplay between Strong Regularity and Graph Densification. CoRR (2017)
Marco Fiorucci, Alessandro Torcinovich, Manuel Curado, Francisco Escolano, Marcello Pelillo
On the Interplay Between Strong Regularity and Graph Densification. GbRPR (2017)
Francisco Escolano, Edwin R. Hancock, Miguel Angel Lozano, Manuel Curado
The mutual information between graphs. Pattern Recognit. Lett. 87 (2017)
Francisco Escolano, Manuel Curado, Miguel Angel Lozano, Edwin R. Hancock
Dirichlet Graph Densifiers. S+SSPR (2016)
Francisco Escolano, Manuel Curado, Edwin R. Hancock
Commute Times in Dense Graphs. S+SSPR (2016)
Manuel Curado, Francisco Escolano, Edwin R. Hancock, Farshad Nourbakhsh, Marcello Pelillo
Similarity Analysis from Limiting Quantum Walks. SIMBAD (2015)