The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration. [PDF]
PLoS ONE, 2014 Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived.
Maarten Houbraken +5 more
doaj +2 more sources
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees. [PDF]
PLoS ONE, 2013 Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than ...
Sofie Demeyer +5 more
doaj +2 more sources
ZeroBind: a protein-specific zero-shot predictor with subgraph matching for drug-target interactions [PDF]
Nature Communications, 2023 Existing drug-target interaction (DTI) prediction methods generally fail to generalize well to novel (unseen) proteins and drugs. In this study, we propose a protein-specific meta-learning framework ZeroBind with subgraph matching for predicting protein ...
Yuxuan Wang +5 more
doaj +2 more sources
Approximate subgraph matching-based literature mining for biomedical events and relations. [PDF]
PLoS ONE, 2013 The biomedical text mining community has focused on developing techniques to automatically extract important relations between biological components and semantic events involving genes or proteins from literature.
Haibin Liu +3 more
doaj +2 more sources
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph [PDF]
Complexity, 2020 Continuous subgraph matching problem on dynamic graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including information retrieval and community detection. Specifically, given a query graph q,
Yunhao Sun +3 more
doaj +2 more sources
Multi-GPU Programming Model for Subgraph Matching in Large Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 Subgraph matching is an important method of data mining in complex networks. In recent years, the subgraph matching algorithm based on GPU (graphics processing units) has shown obvious speed advantages.However, due to the large scale of graph data and a ...
LI Cenhao, CUI Pengjie, YUAN Ye, WANG Guoren
doaj +1 more source
Subgraph Matching Cardinality Estimation Combining Heuristic and Boosting Method [PDF]
Jisuanji kexue yu tansuo, 2022 Attributed to its innate advantage in modeling relational information, graph data have been widely leveraged in various applications including social network, knowledge representation, etc. Compared with traditional relational database systems, primitive
HOU Wenzhe, ZHAO Xiang
doaj +1 more source
GSO:A GNN-based Deep Learning Computation Graph Substitutions Optimization Framework [PDF]
Jisuanji kexue, 2022 Deep learning has achieved great success in various practical applications.How to effectively improve the model execution efficiency is one of the important research issues in this field.The existing deep learning frameworks usually model deep learning ...
MIAO Xu-peng, ZHOU Yue, SHAO Ying-xia, CUI Bin
doaj +1 more source
Isomorphic Subgraph Search Algorithm Based on Neighborhood Equivalence Class [PDF]
Jisuanji gongcheng, 2017 Node heterogeneous graph is often used as a data model for complex networks.Isomorphic subgraph search is an important problem in heterogeneous graph mining,but existing algorithms have shortcomings in subgraph removal,which reduces the efficiency of ...
ZHANG Yutong,WANG Simeng,CAO Jia
doaj +1 more source