Publicaciones en las que colabora con MANUEL CURADO NAVARRO (30)

2024

  1. Feature fusion for a robust traffic accident assistance forecasting model with deep learning

    Applied Soft Computing, Vol. 167

  2. Global forecasting of carbon concentration through a deep learning spatiotemporal modeling

    Journal of Environmental Management, Vol. 371

  3. Influential Yield Strength of Steel Materials with Return Random Walk Gravity Centrality

    Mathematics, Vol. 12, Núm. 3

2023

  1. A novel measure to identify influential nodes: Return Random Walk Gravity Centrality

    Information Sciences, Vol. 628, pp. 177-195

  2. Deep learning model of convolutional neural networks powered by a genetic algorithm for prevention of traffic accidents severity

    Chaos, Solitons and Fractals, Vol. 169

  3. Understanding the metallic glasses formation by applying a centrality measure based on betweenness

    Computational Materials Science, Vol. 218

2022

  1. A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes

    Journal of Computational Science, Vol. 63

  2. Anew centrality measure in dense networks based on two-way random walk betweenness

    Applied Mathematics and Computation, Vol. 412

2021

  1. A new methodology to study street accessibility: A case study of avila (Spain)

    ISPRS International Journal of Geo-Information, Vol. 10, Núm. 7

  2. Identifying mobility patterns by means of centrality algorithms in multiplex networks

    Applied Mathematics and Computation, Vol. 406

  3. Network embedding from the line graph: Random walkers and boosted classification

    Pattern Recognition Letters, Vol. 143, pp. 36-42

  4. Understanding mobility in Rome by means of a multiplex network with data

    Journal of Computational Science, Vol. 51

2020

  1. Analysis and comparison of centrality measures applied to urban networks with data

    Journal of Computational Science, Vol. 43

  2. Early detection of Alzheimer's disease: Detecting asymmetries with a return random walk link predictor

    Entropy, Vol. 22, Núm. 4

  3. Seeking affinity structure: Strategies for improving m-best graph matching

    Information Sciences, Vol. 509, pp. 164-182

2019

  1. Dirichlet densifier bounds: Densifying beyond the spectral gap constraint

    Pattern Recognition Letters, Vol. 125, pp. 425-431

  2. Dirichlet densifiers for improved commute times estimation

    Pattern Recognition, Vol. 91, pp. 56-68

  3. Extending the adapted PageRank algorithm centrality to multiplex networks with data using the PageRank two-layer approach

    Symmetry, Vol. 11, Núm. 2

  4. Network Embedding by Walking on the Line Graph

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2018

  1. Dirichlet densifiers: Beyond constraining the spectral gap

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)