Publikationen, an denen er mitarbeitet Edwin R. Hancock (46)

2021

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

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

  2. The Entropy of Graph Embeddings: A Proxy of Potential Mobility in Covid19 Outbreaks

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

2020

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

    Entropy, Vol. 22, Núm. 4

  2. 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. 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. Bragg diffraction patterns as graph characteristics

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

  2. Dirichlet densifiers: Beyond constraining the spectral gap

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

  3. Net4Lap: Neural Laplacian Regularization for Ranking and Re-Ranking

    Proceedings - International Conference on Pattern Recognition

  4. Semi-supervised Graph Rewiring with the Dirichlet Principle

    Proceedings - International Conference on Pattern Recognition

  5. Semi-supervised Graph Rewiring with the Dirichlet Principle

    2018 24TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR)

  6. net4Lap: Neural Laplacian Regularization for Ranking and Re-Ranking

    2018 24TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR)

2017

  1. Graph similarity through entropic manifold alignment

    SIAM Journal on Imaging Sciences, Vol. 10, Núm. 2, pp. 942-978

  2. Shape simplification through graph sparsification

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

  3. The mutual information between graphs

    Pattern Recognition Letters, Vol. 87, pp. 12-19

2016

  1. An edge-based matching kernel on commute-time spanning trees

    Proceedings - International Conference on Pattern Recognition

  2. Commute times in dense graphs

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

  3. Depth-based hypergraph complexity traces from directed line graphs

    Pattern Recognition, Vol. 54, pp. 229-240

2015

  1. Similarity analysis from limiting quantum walks

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