Results 71 to 80 of about 75,062 (184)
On the editing distance of graphs [PDF]
Journal of Graph Theory, 2008 AbstractAn edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from G to $\cal G$ is the smallest number of edge‐operations needed to modify G into a graph from $\cal G$.
Axenovich, Maria +2 more
openaire +2 more sources
String Edit Distance, Random Walks and Graph Matching [PDF]
International Journal of Pattern Recognition and Artificial Intelligence, 2002 This paper shows how the eigenstructure of the adjacency matrix can be used for the purposes of robust graph matching. We commence from the observation that the leading eigenvector of a transition probability matrix is the steady state of the associated Markov chain.
ANTONIO ROBLES-KELLY, EDWIN R. HANCOCK
openaire +1 more source
Anytime and Distributed Approaches for Graph Matching
ELCVIA Electronic Letters on Computer Vision and Image Analysis, 2016 Due to the inherent genericity of graph-based representations, and thanks to the improvement of computer capacities, structural representations have become more and more popular in the field of Pattern Recognition (PR).
Zeina Abu-Aisheh
doaj +1 more source
The Edit Distance for Reeb Graphs of Surfaces [PDF]
Discrete & Computational Geometry, 2016 An extended abstract of this work appeared in: E. Barcucci et al. (Eds.): DGCI 2014, LNCS 8668, pp.
DI FABIO, Barbara, LANDI, Claudia
openaire +5 more sources
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Algorithms for Molecular BiologyThe graph traversal edit distance (GTED), introduced by Ebrahimpour Boroojeny et al. (2018), is an elegant distance measure defined as the minimum edit distance between strings reconstructed from Eulerian trails in two edge-labeled graphs.
Yutong Qiu, Yihang Shen, Carl Kingsford
doaj +1 more source
A Comprehensive Process Similarity Measure Based on Models and Logs
IEEE Access, 2019 Process similarity measure plays an important role in business process management and is usually considered as a versatile solution to fulfill the effective utilization of process models.
Changhong Zhou +4 more
doaj +1 more source
IGFM: An Enhanced Graph Similarity Computation Method with Fine-Grained Analysis
Data Science and EngineeringIn the rapidly advancing field of graph-based applications, accurate graph similarity computing (GSC) has become increasingly important. However, due to the complexity of graph structures, this task remains a challenge because of the intricate ...
Min Pei +5 more
doaj +1 more source
Research on Personalized Course Resource Recommendation Method Based on GEMRec
Applied SciencesWith the rapid growth of online educational resources, existing personalized course recommendation systems face challenges in multimodal feature integration and limited recommendation interpretability when dealing with complex and diverse instructional ...
Enliang Wang, Zhixin Sun
doaj +1 more source
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree [PDF]
, 2019 Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the pattern $P[1..m]$.
Equi, Massimo +2 more
core +2 more sources
If the Current Clique Algorithms are Optimal, so is Valiant's Parser
, 2015 The CFG recognition problem is: given a context-free grammar $\mathcal{G}$ and a string $w$ of length $n$, decide if $w$ can be obtained from $\mathcal{G}$. This is the most basic parsing question and is a core computer science problem.
Abboud, Amir +2 more
core +1 more source