A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Graph similarity search with edit distance constraint in large graph databases
2013
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13
Preserved Fulltext
In this paper, we study the problem of graph similarity search, which retrieves graphs that are similar to a given query graph under the constraint of the minimum edit distance. ...
Due to many real applications of graph databases, it has become increasingly important to retrieve graphs g (in graph database D) that approximately match with query graph q, rather than exact subgraph ...
An interesting topic is to study graph similarity search, which retrieves all graphs g (in graph database D) that approximately match with q under some similarity measure constraint. ...
doi:10.1145/2505515.2505723
dblp:conf/cikm/ZhengZLWZ13
fatcat:2c4vvsubwfghvmhx35qmbkckey
Metric Indexing for Graph Similarity Search
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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 supports graphs with vertex and edge attributes. ...
A common task is to search a database containing a large number of graphs for those that are most similar to a given query graph. ...
arXiv:2110.01283v1
fatcat:4ax53ysapvbs3eqfl7h232ef3u
Exact and Inexact Graph Matching: Methodology and Applications
[chapter]
2010
Managing and Mining Graph Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Graphs provide us with a powerful and flexible representation formalism which can be employed in various fields of intelligent information processing. ...
The former approach aims at finding a strict correspondence between two graphs to be matched, while the latter is able to cope with errors and measures the difference of two graphs in a broader sense. ...
Yet, using graph edit distance allows us to deal with a large class of graphs (directed, undirected, unlabeled, node and/or edge labels from any finite or infinite domain). ...
doi:10.1007/978-1-4419-6045-0_7
dblp:series/ads/RiesenJB10
fatcat:mr2bpz5xwnbiva5x3mxbzqrnhm
A partition-based approach to structure similarity search
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A fundamental and critical query primitive is to efficiently search similar structures in a large collection of graphs. This paper studies the graph similarity queries with edit distance constraints. ...
By dividing data graphs into variable-size nonoverlapping partitions, the edit distance constraint is converted to a graph containment constraint for candidate generation. ...
Zhang were in part supported by NSFC61232006, NSFC61021004, ARC DP120104168, DP110102937 and DE120102144. C. Xiao was supported by FIRST Program, Japan and KAKENHI (23650047 and 25280039). ...
doi:10.14778/2732232.2732236
fatcat:yu4do4by7rgfhemjgm7edusf4u
Efficient Graph Similarity Joins with Edit Distance Constraints
2012
2012 IEEE 28th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the graph similarity join problem that returns pairs of graphs such that their edit distances are no larger than a threshold. ...
Graphs are widely used to model complicated data semantics in many applications in bioinformatics, chemistry, social networks, pattern recognition, etc. ...
The fourth author was also supported in partial by ARC DP0987273 and DP0881779. ...
doi:10.1109/icde.2012.91
dblp:conf/icde/ZhaoXLW12
fatcat:uder5qe7onhi5ly4etwo4ia5iu
EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Empirically we show that for many real-world graphs our lower bounds are already close to the exact graph edit distance, while our index construction and search scales to very large databases. ...
We introduce methods for answering nearest neighbor and range queries regarding this distance efficiently for large databases with up to millions of graphs. ...
This renders similarity search regarding the graph edit distance in databases di cult, which is relevant in many applications. ...
arXiv:2111.07761v2
fatcat:2psp3up6bnaynmoxa4eaz2idnu
Graph edit distance: Accuracy of local branching from an application point of view
2018
Pattern Recognition Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the context of graph-based representations, comparing and measuring the dissimilarities between graphs can be done by solving the Graph Edit Distance (GED) problem. ...
Similarity search and graph matching are considered as final applications. Three experiments are conducted to evaluate the accuracy and efficiency of the heuristics. ...
For instance, an unknown graph that models an object in an image must be compared with all graphs in a database of known objects in order to find similarities. ...
doi:10.1016/j.patrec.2018.03.033
fatcat:vkqnnyvp7vhxnhbctaa4bfzie4
Current Situation and Application of Graph Data Mining Technology
2017
International Journal of Database Theory and Application
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
With the setting up of social network, web network and other network in figure data, data mining technology has gradually become a hot research. ...
mining, and graphic database development status. ...
Graph search, graph database, graphic modeling, chemical map data and application in bioinformatics will be the hot research in the future. ...
doi:10.14257/ijdta.2017.10.3.01
fatcat:voyvocal3vf6vhvnb7yykl2vzm
Comparing stars
2009
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
With the rapidly increasing amounts of graph data(e.g., chemical compounds and social network data), supporting scalable graph search over large graph databases becomes an important database research problem ...
Unfortunately, the problem of graph edit distance computation is NP-Hard in general. ...
In this scenario, similarity search becomes an appealing and natural choice. There are also a number of systems supporting similarity search over graph databases. ...
doi:10.14778/1687627.1687631
fatcat:gjpo5ulwljdmpmaae474vke3pm
Probabilistic Path Queries in Path Networks: An Effective and Efficient Clustering Methods
2015
Journal of advance research in computer science & enigneering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Some pervious works aim at finding the most likely SP (the path with largest probability to be SP), and others search the least-expected-weight path. ...
In all these works, the definitions of the shortest path query are based on simple probabilistic models which can be converted into the multi-objective optimal issues on a weighted graph. ...
In a specific market, the similarity among customers in market behavior can be modeled as a similarity graph.
III. ...
doi:10.53555/nncse.v2i3.477
fatcat:ovqhiky5irdhxfoxbf2ivyx3m4
Edit distance from graph spectra
2003
Proceedings Ninth IEEE International Conference on Computer Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This paper is concerned with computing graph edit distance. ...
The edit costs are defined in terms of the a posteriori probability of visiting a site on the lattice. We demonstrate the method with results on a data-set of Delaunay graphs. ...
The edit sequence delivers correspondences that are robust to structural error and can be used to cluster graphs into meaningful classes for purposes of image-database indexing and retrieval. ...
doi:10.1109/iccv.2003.1238347
dblp:conf/iccv/Robles-KellyH03
fatcat:ktrmlhn33jg5tn54b2ktwgkpze
Similar Supergraph Search Based on Graph Edit Distance
2021
Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The problem is to identify all graphs in a database that are similar to any subgraph of a query graph, where similarity is defined as edit distance. ...
Our experiments show that the computation time increased exponentially as the distance threshold increased, but increased sublinearly with the number of graphs in the database. ...
Most of methods for graph search problems use this graph edit distance to measure similarities among graphs. ...
doi:10.3390/a14080225
fatcat:q64qjvtff5drpau2xbtxiprh2m
Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagrams
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The main objective of our research is to efficiently find similar records between two data collections under the constraints of the number of added and deleted items. ...
We also present the experimental results obtained by comparing their performance with other systems and the results obtained by using real huge data collections to demonstrate their efficiency in actual ...
The objectives in these researches have been to find similar records based on "exact" matching under various constraints such as cosine measure, Jaccard similarity and edit distance. ...
doi:10.1007/978-3-642-37487-6_7
fatcat:3xx3aolz75fejnktvpbo543is4
Anytime and Distributed Approaches for Graph Matching
2016
ELCVIA Electronic Letters on Computer Vision and Image Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the domain of GM, over the last decade, Graph Edit Distance (GED) has been given a specific attention due to its flexibility to match many types of graphs [2] . ...
Moreover, DF does not exhaust memory as the number of pending tree search nodes is relatively small thanks to the depth-first search where the number of pending nodes, or so-called partial edit paths, ...
GDR4GED is annotated with graph-level information like graph edit distances and their matching correspondences for some representative graph databases [10, 1] . ...
doi:10.5565/rev/elcvia.986
fatcat:ozvnj5jilba6zkvr6stnjzrkye
A Survey on Efficient Clustering Methods with Effective Pruning Techniques for Probabilistic Graphs
2015
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper provides a survey on K-NN queries, DCR query, agglomerative complete linkage clustering and Extension of edit-distance-based definition graph algorithm and solving decision problems under uncertainty ...
This existing system give an beginning to Graph agglomeration aims to divide information into clusters per their similarities, and variety of algorithms are planned for agglomeration graphs, the pKwik ...
Distance-constraint reachability plays a main and even critical role in a wide range of applications. ...
doi:10.5120/19979-0721
fatcat:htcebdqalba7xliy475o3hvuyi
« Previous
Showing results 1 — 15 out of 17,959 results