Subgraph Matching
Extracting Biomedical Events and Modifications Using Subgraph Matching with Noisy Training Data
... the subgraph matching method, as an instance-based learning strategy (Alpaydin, 2004), is dependent on having good training examples that express the events in a range of syntactic structures, the ...
10
Large Graph Database for Subgraph Matching with Set Similarity Using String Metric Algorithm
... dominating-set-based subgraph matching is motivated by two observations: (1) finding candidates in SMS2 queries are much more expensive than that in typical subgraph search, because set similarity ...
5
Subgraph Matching with Set Similarity in a Large Graph Database
... during subgraph matching. Therefore, the subgraph matching cost can also be reduced by decreasing the size of intermediate ...DS-Match subgraph matching algorithm to obtain ...
6
Generalizing an Approximate Subgraph Matching based System to Extract Events in Molecular Biology and Cancer Genetics
... We participated in the BioNLP 2013 shared tasks, addressing the GENIA (GE) and the Can- cer Genetics (CG) event extraction tasks. Our event extraction is based on the system we re- cently proposed for mining relations ...
10
Subgraph Matching Using Graph Neural Network
... F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini have proposed a GNN structure which can be considered as an extension of recurrent neural net- work (RNN) to process very general types of graphs. The ...
5
From Graphs to Events: A Subgraph Matching Approach for Information Extraction from Biomedical Text
... graph matching-based approach (Liu et ...a subgraph matching problem, which corresponds to the search for a subgraph isomor- phic to a rule graph within a sentence ...
9
An Framework for image co-segmentationMaximum Common Subgraph Matching
... Region matching was applied to exploit inter- imageinformation by inaugurating correspondences between thecommon objects in the scene. This allows us to jointlyestimate the appearance distributions of both the ...
5
Case Study on Graph Processing Using Graph Engine
... Microsoft’s Graph Engine is a very vast topic to research on and we as a group have made is effort to cover as many modules as possible. We have listed advantages and disadvantages of the same and have developed a deep ...
5
External Evaluation of Event Extraction Classifiers for Automatic Pathway Curation: An extended study of the mTOR pathway
... Subgraph matching strategies are combina- tions of matching strategies for species, reactions (and for edges which is always the ...the matching strategy nmeq, sboeq is the most strict and ...
10
Efficient Subgraph Query Algorithm in Large Graph
... for subgraph query based on decomposition-join ...path matching result into the subgraph matching ...a subgraph query method named NTree, based on neighbor tree ...the matching ...
6
Computer Vision Problems in 3D Plant Phenotyping
... a subgraph matching algorithm, using the feature points as graph ...any subgraph curve to be “overlaid”, we then compare the shapes using the Fr´echet distance ...
112
A survey of frequent subgraph mining algorithms
... The straightforward idea behind FSM is to “grow” candidate subgraphs, in either a breadth first or depth first manner (candidate generation), and then determine if the identified candidate subgraphs occur frequently ...
31
A new multivariate two-sample test using regular minimum-weight spanning subgraphs
... However, the cross-match test has relatively low power. Since only a single non- bipartite matching is considered in this test, information contained in the proximity of many pairs of points is ignored. Friedman ...
12
Complexity Theory and Algorithms for Graph Problems Driven by Comparative Analysis of Large-Scale Biological Networks.
... For the first class of problems—the multiple alignment of biological networks—this research thesis answers open questions on the parameterized complexity of the problem and proposes ef- ficient and biologically relevant ...
112
Vertex unique labelled subgraph mining
... Unique Subgraph Mining (Min-BFS-REUSM) algorithm, to improve the efficiency of the VULSM process (with respect to the REVULSM algorithm presented in ...labelled subgraph mining for vertex ...
215
Labeling Subgraph Embeddings and Cordiality of Graphs
... In this paper, we determined the cordiality of a family of cubic graphs by the labeling subgraph embeddings method. The results in [3] show that this method may be used to determine the cordiality of all families ...
14
Disconnectedness of the subgraph F3 for the group Γ3
... Author details 1 Department of Mathematics, Karadeniz Technical University, Trabzon, 61080, Turkey.. 2 Department of Mathematics, Recep Tayyip Erdoğan University, Rize, 53100, Turkey.[r] ...
7
Grasping frequent subgraph mining for bioinformatics applications
... Phylogenetic trees The construction of phylogenetic trees that represent similarity between sequences is a common staple in bioinformatics. As a tree is a specific type of graph, many of the approaches detailed here can ...
24
A language independent method for the extraction of RDF verbalization templates
... We present an approach to induce RDF verbal- ization templates from a parallel text-data cor- pus. (1) The approach is distant-supervised, since it does not require labeled data but instead auto- matically aligns a ...
9
Maximum Common Subgraph Isomorphism Algorithms
... by matching based on these atom types and the resulting mapping is then used to seed the search for the actual MCS, in which the atomic symbol is used as the ...
24