Improving bipartite graph matching by assessing the assignment confidence
暂无分享,去创建一个
Kaspar Riesen | Francesc Serratosa | Miquel Ferrer | Miquel A. Ferrer | Kaspar Riesen | F. Serratosa
[1] Kaspar Riesen,et al. Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation , 2014, ANNPR.
[2] Mario Vento,et al. Symbolic Learning vs. Graph Kernels: An Experimental Comparison in a Chemical Application , 2010, ADBIS.
[3] Orestis Kostakis,et al. Classy: fast clustering streams of call-graphs , 2014, Data Mining and Knowledge Discovery.
[4] Alberto Sanfeliu,et al. On the Graph Edit Distance Cost: Properties and Applications , 2012, Int. J. Pattern Recognit. Artif. Intell..
[5] Horst Bunke,et al. A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance , 2005, AVBPA.
[6] Horst Bunke,et al. Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..
[7] Edwin R. Hancock,et al. Spectral embedding of graphs , 2003, Pattern Recognit..
[8] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[9] Kaspar Riesen,et al. Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation , 2015, MLDM.
[10] Benoit Gaüzère,et al. Two New Graph Kernels and Applications to Chemoinformatics , 2011, GbRPR.
[11] Francesc Serratosa,et al. Graduated Assignment Algorithm for Multiple Graph Matching Based on a Common Labeling , 2013, Int. J. Pattern Recognit. Artif. Intell..
[12] Edwin R. Hancock,et al. Computing approximate tree edit distance using relaxation labeling , 2003, Pattern Recognit. Lett..
[13] Thomas Gärtner,et al. A survey of kernels for structured data , 2003, SKDD.
[14] Edwin R. Hancock,et al. Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[15] Kaspar Riesen,et al. Recent advances in graph-based pattern recognition with applications in document analysis , 2011, Pattern Recognit..
[16] Edwin R. Hancock,et al. Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR&SPR 2010, Cesme, Izmir, Turkey, August 18-20, 2010. Proceedings , 2010, SSPR/SPR.
[17] Hans-Peter Kriegel,et al. Shortest-path kernels on graphs , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[18] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[19] Terry Caelli,et al. Inexact Graph Matching Using Eigen-Subspace Projection Clustering , 2004, Int. J. Pattern Recognit. Artif. Intell..
[20] Steven Gold,et al. A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[21] Ernest Valveny,et al. Embedding of Graphs with discrete Attributes via Label frequencies , 2013, Int. J. Pattern Recognit. Artif. Intell..
[22] Kaspar Riesen,et al. Graph Similarity Features for HMM-Based Handwriting Recognition in Historical Documents , 2010, 2010 12th International Conference on Frontiers in Handwriting Recognition.
[23] Mario Vento,et al. A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years , 2013, GbRPR.
[24] Kaspar Riesen,et al. IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.
[25] Quoc V. Le,et al. Learning graph matching. , 2009, IEEE transactions on pattern analysis and machine intelligence.
[26] A. Volgenant,et al. A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.
[27] Kaspar Riesen,et al. Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..
[28] Kaspar Riesen,et al. A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching , 2015, GbRPR.
[29] King-Sun Fu,et al. A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[30] Mario Vento,et al. Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..
[31] Edwin R. Hancock,et al. Bayesian graph edit distance , 1999, Proceedings 10th International Conference on Image Analysis and Processing.