Grasping frequent subgraph mining for bioinformatics applications

被引:0
|
作者
Aida Mrzic
Pieter Meysman
Wout Bittremieux
Pieter Moris
Boris Cule
Bart Goethals
Kris Laukens
机构
[1] Department of Mathematics and Computer Science,
[2] University of Antwerp,undefined
[3] Biomedical Informatics Research Center Antwerp (biomina),undefined
[4] University of Antwerp/Antwerp University Hospital,undefined
来源
BioData Mining | / 11卷
关键词
Subgraph mining; Frequent subgraphs; Graph motifs; Biological networks; Pattern discovery; Pattern mining;
D O I
暂无
中图分类号
学科分类号
摘要
Searching for interesting common subgraphs in graph data is a well-studied problem in data mining. Subgraph mining techniques focus on the discovery of patterns in graphs that exhibit a specific network structure that is deemed interesting within these data sets. The definition of which subgraphs are interesting and which are not is highly dependent on the application. These techniques have seen numerous applications and are able to tackle a range of biological research questions, spanning from the detection of common substructures in sets of biomolecular compounds, to the discovery of network motifs in large-scale molecular interaction networks. Thus far, information about the bioinformatics application of subgraph mining remains scattered over heterogeneous literature. In this review, we provide an introduction to subgraph mining for life scientists. We give an overview of various subgraph mining algorithms from a bioinformatics perspective and present several of their potential biomedical applications.
引用
收藏
相关论文
共 50 条
  • [1] Grasping frequent subgraph mining for bioinformatics applications
    Mrzic, Aida
    Meysman, Pieter
    Bittremieux, Wout
    Moris, Pieter
    Cule, Boris
    Goethals, Bart
    Laukens, Kris
    BIODATA MINING, 2018, 11
  • [2] Generalization for frequent subgraph mining
    Inokuchi, Akihiro
    Washio, Takashi
    Motoda, Hiroshi
    Transactions of the Japanese Society for Artificial Intelligence, 2004, 19 (05) : 368 - 378
  • [3] Frequent Subgraph Mining on BigData
    Sreedevi, K. M.
    Hareesh, M. J.
    Kunjachan, Honeytta
    PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 555 - 560
  • [4] Frequent mining of subgraph structures
    Guo, Ping
    Wang, Xin-Ru
    Kang, Yan-Rong
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2006, 18 (04) : 513 - 521
  • [5] A Parallel Algorithm for Frequent Subgraph Mining
    Bay Vo
    Dang Nguyen
    Thanh-Long Nguyen
    ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2015, 358 : 163 - 173
  • [6] Frequent subgraph mining in outerplanar graphs
    Tamás Horváth
    Jan Ramon
    Stefan Wrobel
    Data Mining and Knowledge Discovery, 2010, 21 : 472 - 508
  • [7] Frequent Subgraph Mining Based on Pregel
    Zhao, Xiang
    Chen, Yifan
    Xiao, Chuan
    Ishikawa, Yoshiharu
    Tang, Jiuyang
    COMPUTER JOURNAL, 2016, 59 (08): : 1113 - 1128
  • [8] The Gaston Tool for Frequent Subgraph Mining
    Nijssen, Siegfried
    Kok, Joost N.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 127 (01) : 77 - 87
  • [9] A survey of frequent subgraph mining algorithms
    Jiang, Chuntao
    Coenen, Frans
    Zito, Michele
    KNOWLEDGE ENGINEERING REVIEW, 2013, 28 (01): : 75 - 105
  • [10] Differentially Private Frequent Subgraph Mining
    Xu, Shengzhi
    Su, Sen
    Xiong, Li
    Cheng, Xiang
    Xiao, Ke
    2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2016, : 229 - 240