Learning Graph Matching with a Graph-Based Perceptron in a Classification Context
Authors:
- Romain RaveauxRRRomain Raveaux
- Chloé MartineauCMChloé Martineau
- 10 May 2017
- book chapter
- Published by Springer Nature
- p. 49-58
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Structured representations in a content based image retrieval contextJournal of Visual Communication and Image Representation, 2013
- Two new graphs kernels in chemoinformaticsPattern Recognition Letters, 2012
- Unsupervised Learning for Graph MatchingInternational Journal of Computer Vision, 2011
- A graph matching method and a graph matching distance based on subgraph assignmentsPattern Recognition Letters, 2010
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- Feature Correspondence Via Graph Matching: Models and Global Optimization2008
- IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning2008
- Automatic learning of cost functions for graph edit distanceInformation Sciences, 2007
- Fast Suboptimal Algorithms for the Computation of Graph Edit Distance2006
- Optimal cluster preserving embedding of nonmetric proximity dataIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003