Recent advances in graph-based pattern recognition with applications in document analysis
From MaRDI portal
Publication:632592
DOI10.1016/j.patcog.2010.11.015zbMath1209.68443MaRDI QIDQ632592
Publication date: 25 March 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.11.015
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
Related Items
Intrinsic Graph Structure Estimation Using Graph Laplacian, A reductive approach to hypergraph clustering: an application to image segmentation, A distance measure for large graphs based on prime graphs, A long trip in the charming world of graphs for pattern recognition, The resistance perturbation distance: a metric for the analysis of dynamic networks, Fuzzy multilevel graph embedding, Graph based analysis for gene segment organization in a scrambled genome, Using extremal events to characterize noisy time series, A comparative study: globality versus locality for graph construction in discriminant analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Riemannian approach to graph embedding
- On the generative power of sequential and parallel programmed graph grammars
- The tree-to-tree editing problem
- Spectral embedding of graphs.
- A graph-theoretic approach to enterprise network dynamics.
- Machine learning in document analysis and recognition
- The Dissimilarity Representation for Pattern Recognition
- Mining Graph Data
- Kernels for Structured Data
- Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation
- Finding Groups in Data
- Inexact graph matching for structural pattern recognition
- Learning Theory and Kernel Machines
- Learning Theory and Kernel Machines
- Graph-Based Representations in Pattern Recognition
- Character Recognition Systems
- Graph-Theoretic Techniques for Web Content Mining
- Bridging the Gap between Graph Edit Distance and Kernel Machines