.. .. State, 25 3.1.1.1.2 Maximum a posteriori (MAP)-inference problem for Conditional Random Field (CRF)

. .. Problems, 1.1.5 Discussions on the literature of graph matching, p.45

.. .. Open-problems, 2 Deadlock 2: Performance evaluation of graph matching methods 51 3.1.3.2.1 Motivation

. .. Graph-matching, 80 4.1.1 State of the art of learning graph matching

.. .. Open-problems, Can an heuristic output solutions closer to optimality thanks to machine learning?

.. .. Summary,

. .. Graph-classication, 2.3.1 Deadlock 10: Learning graph distance for classication with local parameters for nodes and edges

, Bibliography Cmu house and hotel datasets

, Greyc's chemistry dataset

, 18th International Conference on Pattern Recognition, pp.20-24, 2006.

, Graph ow dataset, 2015.

K. A. Fu and . Sanfeliu, A distance measure between attributed relational graphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, p.353363, 1983.

Z. Abu-aisheh, Anytime and distributed approaches for graph matching, ELCVIA Electronic Letters on Computer Vision and Image Analysis, vol.15, issue.2, p.1315, 2016.

Z. Abu-aisheh, R. Raveaux, and J. Ramel, A graph database repository and performance evaluation metrics for graph edit distance, Graph-Based Representations in Pattern Recognition -10th IAPR-TC-15 International Workshop, vol.9069, p.138147, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168809

. Springer, , 2015.

Z. Abu-aisheh, R. Raveaux, J. Ramel, and P. Martineau, An exact graph edit distance algorithm for solving pattern recognition problems, ICPRAM 2015 -Proceedings of the International Conference on Pattern Recognition Applications and Methods, vol.1, pp.10-12
URL : https://hal.archives-ouvertes.fr/hal-01168816

Z. Abu-aisheh, R. Raveaux, and J. Ramel, Anytime graph matching, Pattern Recognition Letters, vol.84, p.215224, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01490832

Z. Abu-aisheh, B. Gaüzère, S. Bougleux, J. Ramel, L. Brun et al., Graph edit distance contest: Results and future challenges, Pattern Recognition Letters, vol.100, p.96103, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01624592

Z. Abu-aisheh, R. Raveaux, and J. Ramel, Fast nearest neighbors search in graph space based on a branch-and-bound strategy, p.197207, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01617383

Z. Abu-aisheh, R. Raveaux, J. Ramel, and P. Martineau, A parallel graph edit distance algorithm, Expert Syst. Appl, vol.94, p.4157, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01629290

Z. Abu-aisheh, R. Raveaux, and J. Ramel, Ecient k-nearest neighbors search in graph space, Pattern Recognition Letters, 2018.

A. Hassan-abu-alhaija, D. Sellent, C. Kondermann, and . Rother, Graphow 6d large displacement scene ow via graph matching, Pattern Recognition, pp.978-981, 2015.

A. Ahmed, E. Elhadi, A. Mohd-aizaini-maarof, and . Osman, Malware detection based on hybrid signature behaviour application programming interface call graph, American Journal of Applied Sciences, vol.9, issue.3, 2012.

A. Alaei, D. Conte, and R. Raveaux, Document image quality assessment based on improved gradient magnitude similarity deviation, 13th International Conference on Document Analysis and Recognition, pp.176-180, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01224875

A. Alaei, D. Conte, M. Blumenstein, and R. Raveaux, Document image quality assessment based on texture similarity index, 12th IAPR Workshop on Document Analysis Systems, p.132137, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01429042

A. Alaei, R. Raveaux, and D. Conte, Image quality assessment based on regions of interest. Signal, Image and Video Processing, vol.11, p.673680, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01405149

A. Alaei, D. Conte, M. Martineau, and R. Raveaux, Blind document image quality prediction based on modication of quality aware clustering method integrating a patch selection strategy, Expert Syst. Appl, vol.108, p.183192, 2018.

H. A. Almohamad and S. O. Duuaa, A linear programming approach for the weighted graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.5, p.522525, 1993.

J. Altschuler, J. Weed, P. Rigollet, ;. I. Guyon, U. V. Luxburg et al., Near-linear time approximation algorithms for optimal transport via sinkhorn iteration, Advances in Neural Information Processing Systems, vol.30, p.19641974, 2017.

K. M. Anstreicher and N. W. Brixius, A new bound for the quadratic assignment problem based on convex quadratic programming, Mathematical Programming, vol.89, issue.3, p.341357, 2001.

J. Atwood and D. Towsley, Search-convolutional neural networks, 2015.

L. Babai, Graph isomorphism in quasipolynomial time, CoRR, 2015.

E. Barbu, R. Raveaux, H. Locteau, S. Adam, P. Héroux et al., Graph classication using genetic algorithm and graph probing application to symbol recognition

, 18th International Conference on Pattern Recognition, pp.20-24, 2006.

G. E. Batista and D. F. Silva, How k-nearest neighbor parameters aect its performance, Argentine Symposium on Articial Intelligence, p.95106, 2009.

I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, Neural combinatorial optimization with reinforcement learning, 2016.

E. Bengoetxea, P. Larrañaga, I. Bloch, and A. Perchant, Estimation of distribution algorithms: A new evolutionary computation approach for graph matching problems

, Energy Minimization Methods in Computer Vision and Pattern Recognition, p.454469, 2001.

E. Bengoetxea, P. Larrañaga, and I. Bloch, Inexact graph matching by means of estimation of distribution algorithms, Pattern Recognition in Information Systems, vol.35, issue.12, pp.2867-2880, 2002.

N. Bhatia and . Vandana, Survey of nearest neighbor techniques, 2010.

C. M. Bishop, Pattern Recognition and Machine Learning, 2006.

D. Vincent, J. Blondel, R. Guillaume, E. Lambiotte, and . Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, issue.10, p.10008, 2008.

P. L. Bodic, P. Héroux, S. Adam, and Y. Lecourtier, An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings, Pattern Recognition, vol.45, issue.12, p.42144224, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00726076

M. Ehsan-zare-borzeshi, K. Piccardi, H. Riesen, and . Bunke, Discriminative prototype selection methods for graph embedding, Pattern Recognition, vol.46, issue.6, pp.1648-1657, 2013.

D. Boscaini, J. Masci, E. Rodolà, and M. M. Bronstein, Learning shape correspondence with anisotropic convolutional neural networks, 2016.

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., Graph edit distance as a quadratic assignment problem, Pattern Recognition Letters, vol.87, pp.38-46, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01613964

S. Bougleux, L. Benoit-gaüzère, and . Brun, A hungarian algorithm for error-correcting graph matching, Graph-Based Representations in Pattern Recognition, p.118127, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01540920

M. Bourquin, A. King, and E. Robbins, Binslayer: Accurate comparison of binary executables, Proceedings of the 2Nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop, PPREW '13, vol.4, 2013.

M. Michael, J. Bronstein, Y. Bruna, A. Lecun, P. Szlam et al., Geometric deep learning: going beyond euclidean data, 2016.

L. Brun, S. Benoit-gaüzère, and . Fourey, Relationships between Graph Edit Distance and Maximal Common Unlabeled Subgraph, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00714879

J. Bruna, W. Zaremba, A. Szlam, and Y. Lecun, , 2013.

H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters, vol.18, issue.8, p.689694, 1997.

H. Bunke, Error correcting graph matching: On the inuence of the underlying cost function, IEEE Trans. Pattern Anal. Mach. Intell, vol.21, issue.9, p.917922, 1999.

H. Bunke and K. Riesen, Graph classication on dissimilarity space embedding

, Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR & SPR, vol.2, 2008.

H. Bunke and K. Riesen, Towards the unication of structural and statistical pattern recognition, Pattern Recognition Letters, vol.33, issue.7, pp.811-825, 2012.

R. E. Burkard, E. Çela, P. M. Pardalos, and L. S. Pitsoulis, Handbook of Combinatorial Optimization: Volume1-3, chapter The Quadratic Assignment Problem, p.17131809, 1999.

S. Tibério, J. J. Caetano, L. Mcauley, Q. V. Cheng, A. J. Le et al., Learning graph matching, IEEE Trans. Pattern Anal. Mach. Intell, vol.31, issue.6, p.10481058, 2009.

H. Cai, V. W. Zheng, and K. Chang, A comprehensive survey of graph embedding: Problems, techniques and applications, 2017.

R. Chaieb, K. Kalti, M. Muzzamil-luqman, M. Coustaty, J. Ogier et al., Fuzzy generalized median graphs computation: Application to content-based document retrieval, Pattern Recognition, vol.72, pp.266-284, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01838151

M. Cho, J. Sun, O. Duchenne, and J. Ponce, Finding matches in a haystack: A max-pooling strategy for graph matching in the presence of outliers, 2014 IEEE Conference on Computer Vision and Pattern Recognition, p.20912098, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01053675

M. Cho, J. Lee, and K. Lee, Reweighted random walks for graph matching, Kostas Daniilidis, Petros Maragos, and Nikos Paragios, p.492505, 2010.

M. Cho, J. Lee, and K. Lee, Reweighted random walks for graph matching, Kostas Daniilidis, Petros Maragos, and Nikos Paragios, p.492505, 2010.

M. Cho, K. Alahari, and J. Ponce, Learning graphs to match, IEEE International Conference on Computer Vision, ICCV 2013, p.2532, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00875105

Y. Choi and G. Kim, Graph-based ngerprint classication using orientation eld in core area, IEICE Electronics Express, vol.7, issue.17, p.13031309, 2010.

M. Collins, Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms, Proceedings of the ACL-02 Conference on Empirical Methods in Natural Language Processing, vol.10, 2002.

D. Conte, P. Foggia, C. Sansone, and M. Vento, Thirty years of graph matching in pattern recognition, International Journal of Pattern Recognition and Articial Intelligence, vol.18, issue.03, p.265298, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01408706

X. Cortés and F. Serratosa, Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences, Pattern Recogn. Lett, vol.56, p.2229, 2015.

X. Cortés and F. Serratosa, Learning graph matching substitution weights based on the ground truth node correspondence, IJPRAI, vol.30, issue.2, 2016.

T. Cour, P. Srinivasan, and J. Shi, Balanced graph matching

B. Schölkopf, J. C. Platt, and T. Homan, Advances in Neural Information Processing Systems 19, p.313320, 2007.

M. Coustaty, R. Raveaux, and J. Ogier, Historical document analysis: A review of french projects and open issues, Proceedings of the 19th European Signal Processing Conference, p.14451449, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01247944

T. Cover and P. Hart, Nearest neighbor pattern classication, IEEE Transactions on Information Theory, vol.13, issue.1, p.2127, 1967.

D. J. Andrew, R. C. Cross, E. R. Wilson, and . Hancock, Inexact graph matching using genetic search, Pattern Recognition, vol.30, issue.6, pp.953-970, 1997.

M. Darwiche, R. Raveaux, D. Conte, and V. Kindt, A local branching heuristic for the graph edit distance problem, Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications -22nd Iberoamerican Congress, vol.10657, p.194202, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02077687

M. Darwiche, D. Conte, R. Raveaux, and V. Kindt, A local branching heuristic for solving a graph edit distance problem, Computers and Operations Research, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01587928

M. Darwiche, D. Conte, R. Raveaux, and V. Kindt, Graph edit distance: Accuracy of local branching from an application point of view, Pattern Recognition Letters, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01761595

D. Das and C. S. George-lee, Sample-to-sample correspondence for unsupervised domain adaptation, vol.73, pp.80-91, 2018.

M. Deerrard, X. Bresson, and P. Vandergheynst, Convolutional neural networks on graphs with fast localized spectral ltering, 2016.

S. Inderjit, Y. Dhillon, B. Guan, and . Kulis, Weighted graph cuts without eigenvectors a multilevel approach, IEEE Trans. Pattern Anal. Mach. Intell, vol.29, issue.11, p.19441957, 2007.

D. David-k-duvenaud, J. Maclaurin, R. Iparraguirre, T. Bombarell, A. Hirzel et al., Convolutional networks on graphs for learning molecular ngerprints

M. Sugiyama and R. Garnett, Advances in Neural Information Processing Systems 28, p.22242232, 2015.

M. Ferrer, E. Valveny, and F. Serratosa, Median graphs: A genetic approach based on new theoretical properties, Pattern Recognition, vol.42, issue.9, 2009.

M. Ferrer, E. Valveny, F. Serratosa, K. Riesen, and H. Bunke, Generalized median graph computation by means of graph embedding in vector spaces, Pattern Recognition, vol.43, issue.4, pp.1642-1655, 2010.

M. Ferrer, D. Karatzas, E. Valveny, I. Bardaji, and H. Bunke, A generic framework for median graph computation based on a recursive embedding approach. Computer Vision and Image Understanding, Special issue on Graph-Based Representations in Computer Vision, vol.115, issue.7, pp.919-928, 2011.

A. Fischer, K. Riesen, and H. Bunke, Improved quadratic time approximation of graph edit distance by combining hausdor matching and greedy assignment, Pattern Recognition Letters, vol.87, p.5562, 2017.

M. Fischetti and A. Lodi, Local branching, Mathematical Programming, vol.98, p.2347, 2003.

M. A. Fischler and R. A. Elschlager, The representation and matching of pictorial structures, IEEE Transactions on Computers, C, vol.22, issue.1, p.6792, 1973.

P. Foggia, C. Liu, and M. Vento, Graph-Based Representations in Pattern Recognition -11th IAPR-TC-15 International Workshop, vol.10310, 2017.

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, p.95110

X. Gao, B. Xiao, D. Tao, and X. Li, A survey of graph edit distance. Pattern Analysis and Applications, vol.13, p.113129, 2010.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

T. Gärtner, A survey of kernels for structured data, SIGKDD Explor. Newsl, vol.5, issue.1, p.4958, 2003.

L. Benoit-gaüzère, D. Brun, and . Villemin, Two new graphs kernels in chemoinformatics, Pattern Recognition Letters, vol.33, issue.15, p.20382047, 2012.

S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.4, p.377388, 1996.

R. E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bull. Amer. Math. Soc, vol.64, issue.5, p.275278, 1958.

P. Goyal and E. Ferrara, Graph embedding techniques, applications, and performance: A survey. CoRR, abs/1705.02801, 2017.

A. Grover and J. Leskovec, node2vec: Scalable feature learning for networks, 2016.

G. H. Allermann and . Bunke, Inexact graph matching for structural pattern recognition, Pattern Recognition Letters, vol.1, p.245253, 1983.

P. Hahn and T. Grant, Lower bounds for the quadratic assignment problem based upon a dual formulation, Operations Research, vol.46, issue.6, p.912922, 1998.

W. L. Hamilton, R. Ying, and J. Leskovec, Inductive representation learning on large graphs, 2017.

R. Edwin, R. C. Hancock, and . Wilson, Pattern analysis with graphs: Parallel work at bern and york, Pattern Recognition Letters, vol.33, issue.7, pp.833-841, 2012.

M. Hena, J. Bruna, and Y. Lecun, Deep convolutional networks on graph-structured data, 2015.

R. Ibragimov, M. Malek, J. Guo, and J. Baumbach, GEDEVO: An Evolutionary Graph Edit Distance Algorithm for Biological Network Alignment, OpenAccess Series in Informatics (OASIcs), vol.34, p.6879, 2013.

X. Jiang, A. Münger, and H. Bunke, On median graphs: Properties, algorithms, and applications, IEEE Trans. Pattern Anal. Mach. Intell, vol.23, issue.10, p.11441151, 2001.

J. Hyung, Y. Chang, and . Demiris, Unsupervised learning of complex articulated kinematic structures combining motion and skeleton information, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015.

T. Joachims, T. Finley, and C. Yu, Cutting-plane training of structural svms

, Machine Learning, vol.77, p.2759, 2009.

D. Justice and A. Hero, A binary linear programming formulation of the graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.8, p.12001214, 2006.

J. H. Kappes, B. Savchynskyy, and C. Schnörr, A bundle approach to ecient map-inference by lagrangian relaxation, 2012 IEEE Conference on Computer Vision and Pattern Recognition, p.16881695, 2012.

S. E. Karisch and F. Rendl, Lower bounds for the quadratic assignment problem via triangle decompositions, Mathematical Programming, vol.71, issue.2, p.137151, 1995.

L. Kaufman and P. J. Rousseeuw, Clustering by means of medoids, 1987.

M. G. Kendall, Rank correlation methods. Grin, London, 1948.

P. Diederik, J. Kingma, and . Ba, Adam: A method for stochastic optimization

. Corr, , 2014.

N. Thomas, M. Kipf, and . Welling, Semi-supervised classication with graph convolutional networks, 2016.

P. A. Knight, The sinkhorn-knopp algorithm: Convergence and applications, SIAM J. Matrix Analysis Applications, vol.30, p.261275, 2007.

V. Kolmogorov, Convergent tree-reweighted message passing for energy minimization, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.10, p.15681583, 2006.

T. Koopmans and M. J. Beckmann, Assignment problems and the location of economic activities. Cowles Foundation Discussion Papers 4, Cowles Foundation for Research in Economics, 1955.

B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, vol.3540718435, p.9783540718437, 2007.

H. W. Kuhn and B. Yaw, The hungarian method for the assignment problem, Naval Res. Logist. Quart, p.8397, 1955.

N. Kumar, L. Zhang, and S. Nayar, What is a good nearest neighbors algorithm for nding similar patches in images, Computer Vision ECCV 2008, vol.364378, 2008.

J. D. Laerty, A. Mccallum, and F. C. Pereira, Conditional random elds: Probabilistic models for segmenting and labeling sequence data, Proceedings of the Eighteenth International Conference on Machine Learning, ICML '01, p.282289, 2001.

E. L. Lawler, The quadratic assignment problem, Management Science, vol.9, issue.4, pp.586-599, 1963.

T. N. Le, M. Muzzamil-luqman, A. Dutta, P. Héroux, C. Rigaud et al., Josep Lladós, and Sébastien Adam. Subgraph spotting in graph representations of comic book images

, Pattern Recognition Letters, vol.112, pp.118-124, 2018.

Y. Lecun, L. Bottou, Y. Bengio, and P. Haner, Gradient-based learning applied to document recognition, Proceedings of the IEEE, p.22782324, 1998.

C. Lee, W. Fang, C. Yeh, and Y. Wang, Multi-label zero-shot learning with structured knowledge graphs, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018.

M. Leordeanu and M. Hebert, A spectral technique for correspondence problems using pairwise constraints, Tenth IEEE International Conference on Computer Vision (ICCV'05, vol.1, p.14821489, 2005.

M. Leordeanu and . Hebert, Unsupervised learning for graph matching, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p.864871, 2009.

M. Leordeanu, R. Hebert, and . Sukthankar, An integer projected xed point method for graph matching and map inference, Advances in Neural Information Processing Systems 22, p.11141122, 2009.

, International Journal of Computer Vision, vol.96, issue.1, p.2845, 2012.

J. Lerouge, Z. Abu-aisheh, R. Raveaux, P. Héroux, S. Adam et al., Exact graph edit distance computation using a binary linear program, Structural, Syntactic, and Statistical Pattern Recognition -Joint IAPR International Workshop, S+SSPR 2016, vol.10029, p.485495, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01491027

J. Lerouge, Z. Abu-aisheh, R. Raveaux, P. Héroux, and S. Adam, New binary linear programming formulation to compute the graph edit distance, Pattern Recognition, vol.72, p.254265, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01619308

S. Leturcq and R. Raveaux, Les graphes pour étudier les dynamiques spatiales à partir des séries scales médiévales et modernes. Etat des lieux de l'expérience Modelespace. Bulletin du Centre d'études médiévales d'Auxerre. Hors-série, 2016.

Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, Gated Graph Sequence Neural Networks. arXiv e-prints, art, 2015.

C. , K. Liu, A. Hertzmann, and Z. Popovi¢, Learning physics-based motion style with nonlinear inverse optimization, ACM Trans. Graph, vol.24, issue.3, p.10711081, 2005.

Z. Liu and H. Qiao, Gnccpgraduated nonconvexityand concavity procedure, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.36, issue.6, p.12581267, 2014.

Z. Liu, C. Chen, L. Li, J. Zhou, X. Li et al., Graph neural networks with adaptive receptive paths. CoRR, 2018.

H. Locteau, R. Raveaux, S. Adam, Y. Lecourtier, P. Héroux et al., Polygonal approximation of digital curves using a multi-objective genetic algorithm
URL : https://hal.archives-ouvertes.fr/hal-00601529

, Graphics Recognition. Ten Years Review and Future Perspectives, 6th Internation Workshop, vol.3926, p.300311, 2005.

H. Locteau, R. Raveaux, S. Adam, Y. Lecourtier, P. Héroux et al., Approximation of digital curves using a multi-objective genetic algorithm, 18th International Conference on Pattern Recognition, pp.20-24, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00440172

J. Muhammad-muzzamil-luqman, J. Ramel, T. Lladós, and . Brouard, Fuzzy multilevel graph embedding, Pattern Recognition, vol.46, issue.2, p.551565, 2013.

V. Lyzinski, D. E. Fishkind, M. Fiori, J. T. Vogelstein, C. E. Priebe et al., Graph matching: Relax at your own risk, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.38, issue.1, p.6073, 2016.

A. Yury, D. A. Malkov, and . Yashunin, Ecient and robust approximate nearest neighbor search using hierarchical navigable small world graphs, 2016.

G. Marceau-caron and Y. Ollivier, Practical riemannian neural networks
URL : https://hal.archives-ouvertes.fr/hal-01695102

. Corr, , 2016.

K. Marino, R. Salakhutdinov, and A. Gupta, The more you know: Using knowledge graphs for image classication, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017.

M. Martineau, D. Conte, R. Raveaux, I. Arnault, D. Munier et al., A survey on image-based insect classication, Pattern Recognition, vol.65, p.273284, 2017.

M. Martineau, R. Raveaux, D. Conte, and G. Venturini, Learning errorcorrecting graph matching with a multiclass neural network, Pattern Recognition Letters, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01758990

D. Mateus, R. Horaud, D. Knossow, F. Cuzzolin, and E. Boyer, Articulated shape matching using laplacian eigenfunctions and unsupervised point registration, 2008 IEEE Conference on Computer Vision and Pattern Recognition, p.18, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00590251

B. T. Messmer and H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.20, issue.5, p.493504, 1998.

N. Mladenovic, J. Brimberg, P. Hansen, and J. A. Moreno-pérez, The p-median problem: A survey of metaheuristic approaches, European Journal of Operational Research, vol.179, issue.3, pp.927-939, 2007.

F. Monti, D. Boscaini, J. Masci, E. Rodolà, J. Svoboda et al.,

. Bronstein, Geometric deep learning on graphs and manifolds using mixture model cnns, 2016.

C. Francisco-moreno-garcía, X. Cortés, and F. Serratosa, A graph repository for learning error-tolerant graph matching, SSPR, p.519529, 2016.

L. M. Musmanno and C. C. Ribeiro, Heuristics for the generalized median graph problem

, European Journal of Operational Research, vol.254, issue.2, pp.371-384, 2016.

R. Myers, R. C. Wison, and E. R. Hancock, Bayesian graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, issue.6, p.628635, 2000.

J. A. Nelder and R. Mead, A simplex method for function minimization, The Computer Journal, vol.7, issue.4, p.308313, 1965.

, Machine Perception and Articial Intelligence, vol.68, p.1761, 2007.

M. Neuhaus and H. Bunke, Self-organizing maps for learning the edit costs in graph matching, IEEE Trans. Systems, Man, and Cybernetics, vol.35, issue.3, p.503514, 2005.

M. Neuhaus and H. Bunke, Automatic learning of cost functions for graph edit distance, Inf. Sci, vol.177, issue.1, p.239247, 2007.

M. Neuhaus, K. Riesen, and H. Bunke, Fast suboptimal algorithms for the computation of graph edit distance

R. Dick-de, Structural, Syntactic, and Statistical Pattern Recognition, vol.4109, p.163172, 2006.

A. Nowak, S. Villar, A. S. Bandeira, and J. Bruna, Revised Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks. arXiv e-prints, art, 2017.

A. Nowak, S. Villar, A. S. Bandeira, and J. Bruna, A note on learning algorithms for quadratic assignment with graph neural networks, 2017.

E. Ozdemir and C. Gunduz-demir, A hybrid classication model for digital pathology using structural and statistical pattern recognition, IEEE Transactions on Medical Imaging, vol.32, issue.2, p.474483, 2013.

J. Pang and G. Cheung, Graph laplacian regularization for inverse imaging: Analysis in the continuous domain, 2016.

B. Perozzi, R. Al-rfou, and S. Skiena, Deepwalk: Online learning of social representations. CoRR, abs/1403, vol.6652, 2014.

F. A. Potra and S. J. Wright, Interior-point methods, Journal of Computational and Applied Mathematics, vol.124, issue.1, pp.433-440, 2000.

A. Rajaraman and J. David-ullman, Mining of Massive Datasets, p.9781107015357, 2011.

R. Raveaux, Graph Mining and Graph Classication : application to cadastral map analysis. Theses, 2010.

R. Raveaux and G. Hillairet, Model driven image segmentation using a genetic algorithm for structured data

. Sebastían, Hybrid Articial Intelligence Systems, 5th International Conference, HAIS 2010, vol.6076, p.311318, 2010.

R. Raveaux, E. Barbu, H. Locteau, S. Adam, P. Héroux et al.,

, A graph classication approach using a multi-objective genetic algorithm application to symbol recognition, Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, vol.4538, p.361, 2007.

. Springer, , 2007.

R. Raveaux, J. Burie, and J. Ogier, A segmentation scheme based on a multi-graph representation: Application to colour cadastral maps, Graphics Recognition. Recent Advances and New Opportunities, 7th International Workshop, vol.5046, p.202212, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00442029

R. Raveaux, J. Burie, and J. Ogier, A colour document interpretation: Application to ancient cadastral maps, 9th International Conference on Document Analysis and Recognition, p.11281132, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00361102

, , 2007.

R. Raveaux, J. Burie, and J. Ogier, A contribution to ancient cadastral maps interpretation through colour analysis, Pattern Recognition in Information Systems, Proceedings of the 7th International Workshop on Pattern Recognition in Information Systems, PRIS 2007, In conjunction with ICEIS, p.8998, 2007.

R. Raveaux, J. Burie, and J. Ogier, Object extraction from colour cadastral maps, The Eighth IAPR International Workshop on Document Analysis Systems, p.506514, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00385910

R. Raveaux, J. Burie, and J. Ogier, A colour text/graphics separation based on a graph representation, 19th International Conference on Pattern Recognition (ICPR 2008), p.14, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00385906

R. Raveaux, J. Burie, and J. Ogier, A colour space selection scheme dedicated to information retrieval tasks, Pattern Recognition in Information Systems, Proceedings of the 8th International Workshop on Pattern Recognition in Information Systems, PRIS 2008, In conjunction with ICEIS, p.123134, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00385923

R. Raveaux, J. Burie, and J. Ogier, A graph matching method and a graph matching distance based on subgraph assignments, Pattern Recognition Letters, vol.31, issue.5, p.394406, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00442028

R. Raveaux, S. Adam, P. Héroux, and É. Trupin, Learning graph prototypes for shape recognition, Computer Vision and Image Understanding, vol.115, issue.7, p.905918, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00593453

R. Raveaux, J. Burie, and J. Ogier, A local evaluation of vectorized documents by means of polygon assignments and matching, vol.IJDAR, p.2143, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00717341

R. Raveaux, J. Burie, and J. Ogier, Structured representations in a content based image retrieval context, J. Visual Communication and Image Representation, vol.24, issue.8, p.12521268, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01079013

R. Raveaux, J. Burie, and J. Ogier, La vectorisation automatisée des plans Vasserot, dans Paris de parcelles en pixels, Analyse géomatique de l'espace parisien médiéval et moderne, p.5465, 2013.

R. Raveaux, M. Martineau, D. Conte, and G. Venturini, Learning graph matching with a graph-based perceptron in a classication context, p.4958, 2017.

J. W. Raymond and P. Willett, Maximum common subgraph isomorphism algorithms for the matching of chemical structures, Journal of Computer-Aided Molecular Design, vol.16, issue.7, p.521533, 2002.

A. Pau-riba and . Fischer, Josep Lladós, and Alicia Fornés. Learning graph distances with message passing neural networks. In ICPR, p.22392244, 2018.

K. Riesen, Structural Pattern Recognition with Graph Edit Distance -Approximation Algorithms and Applications. Advances in Computer Vision and Pattern Recognition, 2015.

K. Riesen, H. Bunke-;-fabio-roli, and J. T. , Iam graph database repository for graph based pattern recognition and machine learning, Niels da Vitoria Lobo, Takis Kasparis

M. Kwok, G. C. Georgiopoulos, M. Anagnostopoulos, and . Loog, Structural, Syntactic, and Statistical Pattern Recognition, p.287297, 2008.

K. Riesen and H. Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image Vision Comput, vol.27, issue.7, p.950959, 2009.

K. Riesen and H. Bunke, Graph Classication and Clustering Based on Vector Space Embedding, volume 77 of Series in Machine Perception and Articial Intelligence, 2010.

K. Riesen and H. Bunke, Graph Classication and Clustering Based on Vector Space Embedding, volume 77 of Series in Machine Perception and Articial Intelligence. WorldScientic, 2010.

K. Riesen and M. Ferrer, Predicting the correctness of node assignments in bipartite graph matching, Pattern Recognition Letters, vol.69, p.814, 2016.

K. Riesen, S. Fankhauser, and H. Bunke, Speeding up graph edit distance computation with a bipartite heuristic, IEEE Trans. Pattern Anal. Mach. Intell, vol.25, issue.12, p.15401551, 2003.

S. Sahni and T. Gonzalez, P-complete approximation problems, J. ACM, vol.23, issue.3, p.555565, 1976.

O. Sammoud, C. Solnon, and K. Ghédira, Ant algorithm for the graph matching problem, Proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP'05, p.213223, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01541554

F. Scarselli, M. Gori, A. Chung-tsoi, M. Hagenbuchner, and G. Monfardini, The graph neural network model, IEEE Trans. Neural Networks, vol.20, issue.1, p.6180, 2009.

/. Tnn, , 2008.

F. Serratosa, Computation of graph edit distance: Reasoning about optimality and speedup, Image Vision Comput, vol.40, p.3848, 2015.

F. Serratosa, Graph edit distance: Restrictions to be a metric, Pattern Recognition, vol.90, pp.250-256, 2019.

S. Shalev, -. Shwartz, and S. Ben-david, Understanding Machine Learning: From Theory to Algorithms, 2014.

L. G. Shapiro and R. M. Haralick, Structural descriptions and inexact matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.3, issue.5, p.504519, 1981.

N. Shervashidze, P. Schweitzer, E. J. Van-leeuwen, K. Mehlhorn, and K. M. ,

. Borgwardt, Weisfeiler-lehman graph kernels, J. Mach. Learn. Res, vol.12, p.25392561, 2011.

D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre et al., Mastering the game of Go with deep neural networks and tree search, Thore Graepel, and Demis Hassabis, vol.529, p.484489, 2016.

D. Singh and C. Mohan, Graph formulation of video activities for abnormal activity recognition, Pattern Recognition, vol.65, pp.265-272, 2017.

R. Sinkhorn and P. Knopp, Concerning nonnegative matrices and doubly stochastic matrices, Pacic J. Math, vol.21, issue.2, p.343348, 1967.

S. Sorlin, C. Solnon, and J. Jolion, A generic graph distance measure based on multivalent matchings, Applied Graph Theory in Computer Vision and Pattern Recognition, vol.52, p.151181, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01542509

M. Stauer, T. Tschachtli, A. Fischer, and K. Riesen, A survey on applications of bipartite graph edit distance, p.242252, 2017.

M. Stauer, A. Fischer, and K. Riesen, Keyword spotting in historical handwritten documents based on graph matching, Pattern Recognition, vol.81, pp.240-253, 2018.

P. Swoboda, C. Rother, D. Hassan-abu-alhaija, B. Kainmuller, and . Savchynskyy, A study of lagrangean decompositions and dual ascent solvers for graph matching, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017.

B. Taskar, C. Guestrin, and D. Koller, Max-margin markov networks, Proceedings of the 16th International Conference on Neural Information Processing Systems, NIPS'03, p.2532, 2003.

D. Teney, L. Liu, A. Van-den, and . Hengel, Graph-structured representations for visual question answering, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017.

L. Torresani, V. Kolmogorov, and C. Rother, A dual decomposition approach to feature correspondence, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.35, issue.2, p.259271, 2013.

L. Torresani, V. Kolmogorov, and C. Rother, Feature correspondence via graph matching: Models and global optimization, Computer Vision -ECCV, p.596609, 2008.

W. Tsai, S. Member, and K. Fu, Pattern Deformational Model and Bayes Error-Correcting Recognition System, IEEE Transactions on Systems, Man, and Cybernetics, vol.9, p.745756, 1979.

I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun, Support vector machine learning for interdependent and structured output spaces, Proceedings of the Twentyrst International Conference on Machine Learning, ICML '04, vol.104, 2004.

I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun, Large margin methods for structured and interdependent output variables, J. Mach. Learn. Res, vol.6, pp.1453-1484, 2005.

K. Jerey and . Uhlmann, Satisfying general proximity / similarity queries with metric trees, Information Processing Letters, vol.40, issue.4, pp.175-179, 1991.

J. R. Ullmann, An algorithm for subgraph isomorphism, J. ACM, vol.23, issue.1, p.3142, 1976.

L. G. Valiant, A theory of the learnable, Commun. ACM, vol.27, issue.11, p.11341142, 1984.

E. Valveny, M. Delalandre, R. Raveaux, and B. Lamiroy, Report on the symbol recognition and spotting contest, Graphics Recognition. New Trends and Challenges -9th International Workshop, vol.7423, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01178076

V. N. Vapnik, Statistical Learning Theory, 1998.

M. Vento, A long trip in the charming world of graphs for pattern recognition. Pattern Recognition, vol.48, pp.291-301, 2015.

C. Villani, Optimal Transport: Old and New. Grundlehren der mathematischen Wissenschaften, vol.3540710493, 2008.

C. Richard, P. Wilson, and . Zhu, A study of graph spectra for comparing graphs and trees, Pattern Recognition, vol.41, issue.9, pp.2833-2841, 2008.

J. Stephen and . Wright, Coordinate descent algorithms, Mathematical Programming, vol.151, p.334, 2015.

H. Xu, D. Luo, H. Zha, and L. Carin, Gromov-wasserstein learning for graph matching and node embedding, 2019.

K. Xu, W. Hu, J. Leskovec, and S. Jegelka, How powerful are graph neural networks? CoRR, 2018.

N. Peter and . Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, p.311321, 1993.

T. Yu and R. Wang, Scene parsing using graph matching on street-view data

, , vol.145, p.70, 2016.

A. Zanr and C. Sminchisescu, Deep learning of graph matching, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018.

M. Zaslavskiy, F. Bach, and J. Vert, A path following algorithm for the graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, p.22272242, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00433567

R. Zass and A. Shashua, Probabilistic graph and hypergraph matching, 2008 IEEE Conference on Computer Vision and Pattern Recognition, p.18, 2008.

Z. Zeng, K. H. Anthony, J. Tung, J. Wang, L. Feng et al., Comparing stars: On approximating graph edit distance, vol.PVLDB, p.2536, 2009.

Z. Zhang, Q. Shi, J. Mcauley, W. Wei, Y. Zhang et al., Pairwise matching through max-weight bipartite belief propagation, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), p.12021210, 2016.

Z. Zhang, Q. Shi, J. Mcauley, and W. Wei, Yanning Zhang, and Anton van den Hengel. Pairwise matching through max-weight bipartite belief propagation, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016.

Q. Zhao, S. E. Karisch, F. Rendl, and H. Wolkowicz, Semidenite programming relaxations for the quadratic assignment problem, Journal of Combinatorial Optimization, vol.2, issue.1, p.71109, 1998.

D. Zhou and B. Schölkopf, Regularization on discrete spaces

, Pattern Recognition, p.361368, 2005.

F. Zhou, F. De-la, and T. , Factorized graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.38, issue.9, p.17741789, 2016.

S. Zilberstein and S. J. Russell, Approximate reasoning using anytime algorithms, 1995.

, But from our discussion above, we also know that the log likelihood of t n is just the log of a particular entry oft n . In fact, it's the entry i which satises t

?. Raveaux-;-romain-raveaux, Graph Mining and Graph Classication : application to cadastral map analysis. Theses, 2010.

R. Raveaux, J. Burie, and J. Ogier, La vectorisation automatisée des plans Vasserot, dans Paris de parcelles en pixels. In Analyse géomatique de l'espace parisien médiéval et moderne, p.5465, 2013.

?. Abu-aisheh, Romain Raveaux, and Jean-Yves Ramel. Ecient k-nearest neighbors search in graph space, Pattern Recognition Letters, 2018.

?. Martineau, Learning error-correcting graph matching with a multiclass neural network, Pattern Recognition Letters, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01758990

?. Darwiche, Graph edit distance: Accuracy of local branching from an application point of view, Pattern Recognition Letters, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01761595

?. Darwiche, A local branching heuristic for solving a graph edit distance problem, Computers and Operations Research, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01587928

?. Abu-aisheh, A parallel graph edit distance algorithm, Expert Syst. Appl, vol.94, p.4157, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01629290

?. Alaei, Blind document image quality prediction based on modication of quality aware clustering method integrating a patch selection strategy, Expert Syst. Appl, vol.108, p.183192, 2018.

?. Martineau, A survey on image-based insect classication, Pattern Recognition, vol.65, p.273284, 2017.

?. Lerouge, New binary linear programming formulation to compute the graph edit distance, Pattern Recognition, vol.72, p.254265, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01619308

?. Abu-aisheh, Graph edit distance contest: Results and future challenges, Pattern Recognition Letters, vol.100, p.96103, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01624592

?. Alaei, Image quality assessment based on regions of interest. Signal, Image and Video Processing, vol.11, p.673680, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01405149

?. Abu-aisheh, Anytime graph matching, Pattern Recognition Letters, vol.84, p.215224, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01490832

?. Raveaux, Structured representations in a content based image retrieval context, J. Visual Communication and Image Representation, vol.24, issue.8, p.12521268, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01079013

?. Raveaux, A local evaluation of vectorized documents by means of polygon assignments and matching, IJ-DAR, vol.15, issue.1, p.2143, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00717341

?. Raveaux, Learning graph prototypes for shape recognition, Computer Vision and Image Understanding, vol.115, issue.7, p.905918, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00593453

?. Raveaux, A graph matching method and a graph matching distance based on subgraph assignments, Pattern Recognition Letters, vol.31, issue.5, p.394406, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00442028

S. Leturcq and R. Raveaux, Les graphes pour étudier les dynamiques spatiales à partir des séries scales médiévales et modernes. Etat des lieux de l'expérience Modelespace. Bulletin du Centre d'études médiévales d'Auxerre. Hors-série, E.1.4 Revues Nationales ? Leturcq and Raveaux, 2016.

, Conférences Internationales de rang A, 2018.

?. Lerouge, Zeina Abu-Aisheh, 2016.

I. A. Robles-kelly, M. Loog, B. Biggio, F. Escolano, and R. C. ,

. Wilson, Proceedings, Structural, Syntactic, and Statistical Pattern Recognition -Joint IAPR International Workshop, vol.10029, p.485495, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01573201

?. Alaei, Document image quality assessment based on improved gradient magnitude similarity deviation, 13th International Conference on Document Analysis and Recognition, p.176180, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01224875

?. Raveaux, A colour document interpretation: Application to ancient cadastral maps, 9th International Conference on Document Analysis and Recognition, p.11281132, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00361102

, E.1.6 Conférences Internationales de rang B, 2018.

?. Alaei, Document image quality assessment based on texture similarity index, 12th IAPR Workshop on Document Analysis Systems, p.132137, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01429042

?. Coustaty, Historical document analysis: A review of french projects and open issues, Proceedings of the 19th European Signal Processing Conference, p.14451449, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01247944

?. Raveaux, Object extraction from colour cadastral maps, The Eighth IAPR International Workshop on Document Analysis Systems, p.506514, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00385910

?. Raveaux, A colour text/graphics separation based on a graph representation, 19th International Con-E.1. LISTE DES PUBLICATIONS ference on Pattern Recognition (ICPR 2008), p.14, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00385906

?. Barbu, Graph classication using genetic algorithm and graph probing application to symbol recognition, 18th International Conference on Pattern Recognition, pp.20-24, 2006.

?. Locteau, Approximation of digital curves using a multi-objective genetic algorithm, 18th International Conference on Pattern Recognition, pp.20-24, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00440172

?. Darwiche, A local branching heuristic for the graph edit distance problem, Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications -22nd Iberoamerican Congress, vol.10657, p.194202, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02077687

?. Raveaux, Learning graph matching with a graph-based perceptron in a classication context, p.4958, 2017.

?. Abu-aisheh, Fast nearest neighbors search in graph space based on a branch-and-bound strategy, p.197207, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01617383

?. Abu-aisheh, A graph database repository and performance evaluation metrics for graph edit distance, Graph-Based Representations in Pattern Recognition -10th IAPR-TC-15 International Workshop, vol.9069, p.138147, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168809

?. Abu-aisheh, An exact graph edit distance algorithm for solving pattern recognition problems, Zeina Abu-Aisheh, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168816

, ICPRAM 2015 -Proceedings of the International Conference on Pattern Recognition Applications and Methods, vol.1, p.271278, 2015.

?. Valveny, Report on the symbol recognition and spotting contest, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01178076

M. Ogier, Graphics Recognition. New Trends and Challenges -9th International Workshop, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00389638

?. Raveaux, R. Hillairet, G. Raveaux, and . Hillairet, Model driven image segmentation using a genetic algorithm for structured data, 2010.

M. T. Corchado and . García-sebastían, Hybrid Articial Intelligence Systems, 5th International Conference, vol.6076, p.311318, 2010.

?. Raveaux, A colour space selection scheme dedicated to information retrieval tasks, Pattern Recognition in Information Systems, Proceedings of the 8th International Workshop on Pattern Recognition in Information Systems, PRIS 2008, In conjunction with ICEIS, p.123134, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00385923

?. Raveaux, A graph classication approach using a multi-objective genetic algorithm application to symbol recognition, Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, vol.4538, p.361370, 2007.

?. Raveaux, A segmentation scheme based on a multi-graph representation: Application to colour cadastral maps, Graphics Recognition. Recent Advances and New Opportunities, 7th International Workshop, GREC, vol.5046, p.202212, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00442029

?. Raveaux, A contribution to ancient cadastral maps interpretation through colour analysis, 2007.

A. K. Fred and . Jain, Pattern Recognition in Information Systems, Proceedings of the 7th International Workshop on Pattern Recognition in Information Systems, PRIS 2007, In conjunction with ICEIS, p.8998, 2007.

?. Locteau, Polygonal approximation of digital curves using a multiobjective genetic algorithm, Graphics Recognition. Ten Years Review and Future Perspectives, 6th Internation Workshop, GREC 2005, vol.3926, p.300311, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00601529