Pages that link to "Item:Q5754227"
From MaRDI portal
The following pages link to Bridging the Gap between Graph Edit Distance and Kernel Machines (Q5754227):
Displayed 13 items.
- Fast processing of graph queries on a large database of small and medium-sized data graphs (Q295652) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Recent advances in graph-based pattern recognition with applications in document analysis (Q632592) (← links)
- Depth-based complexity traces of graphs (Q898379) (← links)
- A theory of subtree matching and tree kernels based on the edit distance concept (Q906000) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics (Q1677061) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- A quotient space formulation for generative statistical analysis of graphical data (Q2036213) (← links)
- The graph matching problem (Q2444585) (← links)
- Graph ambiguity (Q2446033) (← links)
- Modeling the Uncertainty of a Set of Graphs Using Higher-Order Fuzzy Sets (Q3299861) (← links)
- Improving Graph Classification by Isomap (Q3637702) (← links)