Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Franka Bause"'
The graph edit distance is an intuitive measure to quantify the dissimilarity of graphs, but its computation is NP-hard and challenging in practice. We introduce methods for answering nearest neighbor and range queries regarding this distance efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ddeb28565d839824b8430990f1c088a6
https://hdl.handle.net/11353/10.1643611
https://hdl.handle.net/11353/10.1643611
Publikováno v:
Similarity Search and Applications ISBN: 9783030896560
SISAP
SISAP
Finding the graphs that are most similar to a query graph in a large database is a common task with various applications. A widely-used similarity measure is the graph edit distance, which provides an intuitive notion of similarity and naturally supp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa2f39773a05905eebe7c2e98c6d4ec6
https://doi.org/10.1007/978-3-030-89657-7_24
https://doi.org/10.1007/978-3-030-89657-7_24
Publikováno v:
ICDM
Finding an optimal assignment between two sets of objects is a fundamental problem arising in many applications, including the matching of `bag-of-words' representations in natural language processing and computer vision. Solving the assignment probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62f36acc3aadea162bdc6d4433145c0a
http://arxiv.org/abs/1901.10356
http://arxiv.org/abs/1901.10356