default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoit Gaüzère
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Stevan Stanovic
, Benoit Gaüzère, Luc Brun:
Graph Neural Networks with maximal independent set-based pooling: Mitigating over-smoothing and over-squashing. Pattern Recognit. Lett. 187: 14-20 (2025)- 2024
- [j13]Linlin Jia, Éric Brémond, Larissa Zaida, Benoit Gaüzère, Vincent Tognetti, Laurent Joubert:
Predicting redox potentials by graph-based machine learning methods. J. Comput. Chem. 45(28): 2383-2396 (2024) - 2023
- [j12]Kamaldeep Singh Oberoi, Géraldine Del Mondo, Benoit Gaüzère, Yohan Dupuis, Pascal Vasseur:
Detecting dynamic patterns in dynamic graphs using subgraph isomorphism. Pattern Anal. Appl. 26(3): 1205-1221 (2023) - [c28]Linlin Jia, Xiao Ning, Benoit Gaüzère, Paul Honeine, Kaspar Riesen:
Bridging Distinct Spaces in Graph-Based Machine Learning. ACPR (2) 2023: 1-14 - [c27]Clément Glédel, Benoit Gaüzère, Paul Honeine:
Graph Normalizing Flows to Pre-image Free Machine Learning for Regression. GbRPR 2023: 92-101 - [c26]Stevan Stanovic, Benoit Gaüzère, Luc Brun:
Maximal Independent Sets for Pooling in Graph Neural Networks. GbRPR 2023: 113-124 - [i7]Stevan Stanovic, Benoit Gaüzère, Luc Brun:
Maximal Independent Sets for Pooling in Graph Neural Networks. CoRR abs/2307.13011 (2023) - 2022
- [j11]Linlin Jia, Benoit Gaüzère, Paul Honeine:
Graph kernels based on linear patterns: Theoretical and experimental comparisons. Expert Syst. Appl. 189: 116095 (2022) - [c25]Luc Brun, Benoit Gaüzère, Guillaume Renton, Sébastien Bougleux, Florian Yger:
A differentiable approximation for the Linear Sum Assignment Problem with Edition. ICPR 2022: 3822-3828 - [c24]Stevan Stanovic, Benoit Gaüzère, Luc Brun:
Maximal Independent Vertex Set Applied to Graph Pooling. S+SSPR 2022: 11-21 - [i6]Stevan Stanovic, Benoit Gaüzère, Luc Brun:
Maximal Independent Vertex Set applied to Graph Pooling. CoRR abs/2208.01648 (2022) - 2021
- [j10]David B. Blumenthal, Nicolas Boria, Sébastien Bougleux, Luc Brun, Johann Gamper, Benoit Gaüzère:
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing. Inf. Syst. 100: 101766 (2021) - [j9]Linlin Jia, Benoit Gaüzère, Paul Honeine:
graphkit-learn: A Python library for graph kernels based on linear patterns. Pattern Recognit. Lett. 143: 113-121 (2021) - [j8]Guillaume Renton, Muhammet Balcilar, Pierre Héroux, Benoit Gaüzère, Paul Honeine, Sébastien Adam:
Symbols Detection and Classification using Graph Neural Networks. Pattern Recognit. Lett. 152: 391-397 (2021) - [c23]Muhammet Balcilar, Guillaume Renton, Pierre Héroux, Benoit Gaüzère, Sébastien Adam, Paul Honeine:
Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective. ICLR 2021 - [c22]Muhammet Balcilar, Pierre Héroux, Benoit Gaüzère, Pascal Vasseur, Sébastien Adam, Paul Honeine:
Breaking the Limits of Message Passing Graph Neural Networks. ICML 2021: 599-608 - [i5]Muhammet Balcilar, Pierre Héroux, Benoit Gaüzère, Pascal Vasseur, Sébastien Adam, Paul Honeine:
Breaking the Limits of Message Passing Graph Neural Networks. CoRR abs/2106.04319 (2021) - [i4]Luc Brun, Benoit Gaüzère, Sébastien Bougleux, Florian Yger:
A new Sinkhorn algorithm with Deletion and Insertion operations. CoRR abs/2111.14565 (2021) - 2020
- [j7]Guillaume Hoffmann, Muhammet Balcilar, Vincent Tognetti, Pierre Héroux, Benoit Gaüzère, Sébastien Adam, Laurent Joubert:
Predicting experimental electrophilicities from quantum and topological descriptors: A machine learning approach. J. Comput. Chem. 41(24): 2124-2136 (2020) - [j6]Sébastien Bougleux, Benoit Gaüzère, David B. Blumenthal, Luc Brun:
Fast linear sum assignment with error-correction and no cost constraints. Pattern Recognit. Lett. 134: 37-45 (2020) - [c21]Linlin Jia, Benoit Gaüzère, Paul Honeine:
A Graph Pre-image Method Based on Graph Edit Distances. S+SSPR 2020: 216-226 - [c20]Linlin Jia, Benoit Gaüzère, Florian Yger, Paul Honeine:
A Metric Learning Approach to Graph Edit Costs for Regression. S+SSPR 2020: 238-247 - [i3]Muhammet Balcilar, Guillaume Renton, Pierre Héroux, Benoit Gaüzère, Sébastien Adam, Paul Honeine:
Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks. CoRR abs/2003.11702 (2020)
2010 – 2019
- 2019
- [c19]Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
Generalized Median Graph via Iterative Alternate Minimizations. GbRPR 2019: 99-109 - [c18]Guillaume Renton, Pierre Héroux, Benoit Gaüzère, Sébastien Adam:
Graph Neural Network for Symbol Detection on Document Images. GREC@ICDAR 2019: 62-67 - [i2]Nicolas Boria, Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
Generalized Median Graph via Iterative Alternate Minimizations. CoRR abs/1906.11009 (2019) - 2018
- [c17]Évariste Daller, Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
Approximate Graph Edit Distance by Several Local Searches in Parallel. ICPRAM 2018: 149-158 - 2017
- [j5]Sébastien Bougleux, Luc Brun, Vincenzo Carletti, Pasquale Foggia, Benoit Gaüzère, Mario Vento:
Graph edit distance as a quadratic assignment problem. Pattern Recognit. Lett. 87: 38-46 (2017) - [j4]Zeina Abu-Aisheh, Benoit Gaüzère, Sébastien Bougleux, Jean-Yves Ramel, Luc Brun, Romain Raveaux, Pierre Héroux, Sébastien Adam:
Graph edit distance contest: Results and future challenges. Pattern Recognit. Lett. 100: 96-103 (2017) - [c16]Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
A Hungarian Algorithm for Error-Correcting Graph Matching. GbRPR 2017: 118-127 - 2016
- [c15]Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
Graph edit distance as a quadratic program. ICPR 2016: 1701-1706 - [c14]Benoit Gaüzère, Sébastien Bougleux, Luc Brun:
Approximating Graph Edit Distance Using GNCCP. S+SSPR 2016: 496-506 - 2015
- [j3]Benoit Gaüzère, Pierre-Anthony Grenier, Luc Brun, Didier Villemin:
Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics. Pattern Recognit. 48(2): 356-367 (2015) - [c13]Pasquale Foggia, Benoit Gaüzère, Alessia Saggese, Mario Vento:
Human action recognition using an improved string edit distance. AVSS 2015: 1-6 - [c12]Vincenzo Carletti, Benoit Gaüzère, Luc Brun, Mario Vento:
Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance. GbRPR 2015: 188-197 - [c11]Benoit Gaüzère, Pierluigi Ritrovato, Alessia Saggese, Mario Vento:
Human Tracking Using a Top-Down and Knowledge Based Approach. ICIAP (1) 2015: 257-267 - [c10]Benoit Gaüzère, Claudia Greco, Pierluigi Ritrovato, Alessia Saggese, Mario Vento:
Semantic Web Technologies for Object Tracking and Video Analytics. ISVC (2) 2015: 574-585 - [i1]Sébastien Bougleux, Luc Brun, Vincenzo Carletti, Pasquale Foggia, Benoit Gaüzère, Mario Vento:
A Quadratic Assignment Formulation of the Graph Edit Distance. CoRR abs/1512.07494 (2015) - 2014
- [c9]Benoit Gaüzère, Luc Brun, Didier Villemin:
Graph Kernel Encoding Substituents' Relative Positioning. ICPR 2014: 637-642 - [c8]Benoit Gaüzère, Sébastien Bougleux, Kaspar Riesen, Luc Brun:
Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks. S+SSPR 2014: 73-82 - 2013
- [b1]Benoit Gaüzère:
Application des méthodes à noyaux sur graphes pour la prédiction des propriétés des molécules. (Graph kernels for the prediction of molecular properties.). University of Caen Normandy, France, 2013 - [j2]Benoit Gaüzère, Luc Brun, Didier Villemin:
Noyau de Treelets appliqué aux graphes étiquetés et aux graphes de cycles. Rev. d'Intelligence Artif. 27(1): 121-144 (2013) - [c7]Donatello Conte, Jean-Yves Ramel, Nicolas Sidere, Muhammad Muzzamil Luqman, Benoit Gaüzère, Jaume Gibert, Luc Brun, Mario Vento:
A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition. GbRPR 2013: 81-90 - [c6]Benoit Gaüzère, Luc Brun, Didier Villemin:
Relevant Cycle Hypergraph Representation for Molecules. GbRPR 2013: 111-120 - 2012
- [j1]Benoit Gaüzère, Luc Brun, Didier Villemin:
Two new graphs kernels in chemoinformatics. Pattern Recognit. Lett. 33(15): 2038-2047 (2012) - [c5]Sébastien Bougleux, François-Xavier Dupé, Luc Brun, Benoit Gaüzère, Myriam Mokhtari:
Shape similarity based on combinatorial maps and a tree pattern kernel. ICPR 2012: 1602-1605 - [c4]Benoit Gaüzère, Luc Brun, Didier Villemin, Myriam Brun:
Graph kernels based on relevant patterns and cycle information for chemoinformatics. ICPR 2012: 1775-1778 - [c3]Benoit Gaüzère, Luc Brun, Didier Villemin:
Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance. SSPR/SPR 2012: 42-50 - [c2]Benoit Gaüzère, Makoto Hasegawa, Luc Brun, Salvatore Tabbone:
Implicit and Explicit Graph Embedding: Comparison of Both Approaches on Chemoinformatics Applications. SSPR/SPR 2012: 510-518 - 2011
- [c1]Benoit Gaüzère, Luc Brun, Didier Villemin:
Two New Graph Kernels and Applications to Chemoinformatics. GbRPR 2011: 112-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
