Results 241 to 250 of about 333,836 (279)
Some of the next articles are maybe not open access.
Feature-based similarity search in graph structures
ACM Transactions on Database Systems, 2006Similarity search of complex structures is an important operation in graph-related applications since exact matching is often too restrictive. In this article, we investigate the issues of substructure similarity search using indexed features in graph databases.
YAN, Xifeng +3 more
openaire +2 more sources
Boosting Graph Similarity Search through Pre-Computation
Proceedings of the 2021 International Conference on Management of Data, 2021Graph similarity search is to retrieve all graphs from a graph database whose graph edit distance (GED) to a query graph is within a given threshold. As GED computation is NP-hard, existing solutions adopt the filtering-and-verification framework, where the main focus is on the filtering phase to reduce the number of GED verifications.
openaire +1 more source
Structure-based similarity search with graph histograms
Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99, 1999Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. The authors propose an efficient and effective graph manipulation technique that can be used in graph-based similarity search.
A.N. Papadopoulos, Y. Manolopoulos
openaire +1 more source
Speeding Up GED Verification for Graph Similarity Search
2020 IEEE 36th International Conference on Data Engineering (ICDE), 2020Graph similarity search retrieves from a database all graphs whose edit distance (GED) to a query graph is within a threshold. As GED computation is NP-hard, the existing works adopt the filtering-and-verification paradigm to reduce the number of GED verifications, and they mainly focus on designing filtering techniques while using the now out-dated ...
Lijun Chang +5 more
openaire +1 more source
Fast Similarity Search for Graphs by Edit Distance
Cybernetics and Systems Analysis, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Citation Graph Based Similarity Search Algorithm
2012Searching for similar documents from the large number of documents quickly and efficiently is an important and time-consuming problem. The existing algorithms first find the candidate document set, and then sort them based on a document related evaluation to identify the most relevant ones. A Citation Graph based document similarity search algorithm is
openaire +1 more source
Similarity Search over Personal Process Description Graph
2015People are involved in various processes in their daily lives, such as cooking a dish, applying for a job or opening a bank account. With the advent of easy-to-use Web-based sharing platforms, many of these processes are shared as step-by-step instructions e.g., "how-to guides" in eHow and wikiHow on-line in natural language form.
Jing Ouyang Hsu +2 more
openaire +1 more source
Efficiently Indexing Large Sparse Graphs for Similarity Search
IEEE Transactions on Knowledge and Data Engineering, 2012The graph structure is a very important means to model schemaless data with complicated structures, such as protein-protein interaction networks, chemical compounds, knowledge query inferring systems, and road networks. This paper focuses on the index structure for similarity search on a set of large sparse graphs and proposes an efficient indexing ...
Guoren Wang +3 more
openaire +1 more source
Graph Matching Algorithms for Business Process Model Similarity Search
2009We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specaifically application of graph matching algorithms to this similarity search problem. Since the corresponding graph matching problem is NP-complete, we seek to find a compromise between computational
Dijkman, R.M. +2 more
openaire +2 more sources
2011
Organizations create collections of hundreds or even thousands of business process models to describe their operations. This chapter explains how graphs can be used as underlying formalism to develop techniques for managing such collections. To this end it defines the business process graph formalism.
Dijkman, R.M. +2 more
openaire +2 more sources
Organizations create collections of hundreds or even thousands of business process models to describe their operations. This chapter explains how graphs can be used as underlying formalism to develop techniques for managing such collections. To this end it defines the business process graph formalism.
Dijkman, R.M. +2 more
openaire +2 more sources