Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Graph_edit_distance> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Graph_edit_distance abstract "In mathematics and computer science, graph edit distance (GED) is a measure of similarity (or dissimilarity) between two graphs.The concept of graph edit distance was first formalized mathematically by Alberto Sanfliu and King-Sun Fu in 1983.A major application of graph edit distance is in inexact graph matching, suchas error-tolerant pattern recognition in machine learning.The graph edit distance between two graphs is related to thestring edit distance between strings.With the interpretation of strings as connected Directed acyclic graphs of maximum degree one, classical definitionsof edit distance such as Levenshtein distance,Hamming distanceand Jaro–Winkler distance may be interepeted as graph edit distancesbetween suitably constrained graphs. Likewise, graph edit distance isalso a generalization of tree edit distance betweenrooted trees.".
- Graph_edit_distance wikiPageID "49270083".
- Graph_edit_distance wikiPageLength "8225".
- Graph_edit_distance wikiPageOutDegree "29".
- Graph_edit_distance wikiPageRevisionID "703684707".
- Graph_edit_distance wikiPageWikiLink A*_search_algorithm.
- Graph_edit_distance wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Graph_edit_distance wikiPageWikiLink Category:Graph_algorithms.
- Graph_edit_distance wikiPageWikiLink Category:Graph_theory.
- Graph_edit_distance wikiPageWikiLink Cheminformatics.
- Graph_edit_distance wikiPageWikiLink Computer_science.
- Graph_edit_distance wikiPageWikiLink Connected_component_(graph_theory).
- Graph_edit_distance wikiPageWikiLink Degree_(graph_theory).
- Graph_edit_distance wikiPageWikiLink Directed_acyclic_graph.
- Graph_edit_distance wikiPageWikiLink Directed_graph.
- Graph_edit_distance wikiPageWikiLink Edge_contraction.
- Graph_edit_distance wikiPageWikiLink Edit_distance.
- Graph_edit_distance wikiPageWikiLink Fingerprint_recognition.
- Graph_edit_distance wikiPageWikiLink Graph_(discrete_mathematics).
- Graph_edit_distance wikiPageWikiLink Graph_isomorphism.
- Graph_edit_distance wikiPageWikiLink Graph_labeling.
- Graph_edit_distance wikiPageWikiLink Graph_operations.
- Graph_edit_distance wikiPageWikiLink Hamming_distance.
- Graph_edit_distance wikiPageWikiLink Handwriting_recognition.
- Graph_edit_distance wikiPageWikiLink Jaro–Winkler_distance.
- Graph_edit_distance wikiPageWikiLink Levenshtein_distance.
- Graph_edit_distance wikiPageWikiLink Machine_learning.
- Graph_edit_distance wikiPageWikiLink Mathematics.
- Graph_edit_distance wikiPageWikiLink Pathfinding.
- Graph_edit_distance wikiPageWikiLink Pattern_recognition.
- Graph_edit_distance wikiPageWikiLink Shortest_path_problem.
- Graph_edit_distance wikiPageWikiLink Similarity_measure.
- Graph_edit_distance wikiPageWikiLink String_(computer_science).
- Graph_edit_distance wikiPageWikiLink Tree_(graph_theory).
- Graph_edit_distance wikiPageWikiLinkText "Graph edit distance".
- Graph_edit_distance wikiPageWikiLinkText "graph edit distance".
- Graph_edit_distance wikiPageUsesTemplate Template:Reflist.
- Graph_edit_distance subject Category:Computational_problems_in_graph_theory.
- Graph_edit_distance subject Category:Graph_algorithms.
- Graph_edit_distance subject Category:Graph_theory.
- Graph_edit_distance hypernym Measure.
- Graph_edit_distance type Software.
- Graph_edit_distance comment "In mathematics and computer science, graph edit distance (GED) is a measure of similarity (or dissimilarity) between two graphs.The concept of graph edit distance was first formalized mathematically by Alberto Sanfliu and King-Sun Fu in 1983.A major application of graph edit distance is in inexact graph matching, suchas error-tolerant pattern recognition in machine learning.The graph edit distance between two graphs is related to thestring edit distance between strings.With the interpretation of strings as connected Directed acyclic graphs of maximum degree one, classical definitionsof edit distance such as Levenshtein distance,Hamming distanceand Jaro–Winkler distance may be interepeted as graph edit distancesbetween suitably constrained graphs. ".
- Graph_edit_distance label "Graph edit distance".
- Graph_edit_distance wasDerivedFrom Graph_edit_distance?oldid=703684707.
- Graph_edit_distance isPrimaryTopicOf Graph_edit_distance.