A primer to frequent itemset mining for bioinformatics

被引:80
|
作者
Naulaerts, Stefan [1 ]
Meysman, Pieter [1 ]
Bittremieux, Wout [1 ]
Trung Nghia Vu [1 ]
Vanden Berghe, Wim [1 ]
Goethals, Bart [1 ]
Laukens, Kris [1 ]
机构
[1] Univ Antwerp, B-2020 Antwerp, Belgium
关键词
pattern mining; frequent item set; association rule; market basket analysis; biclustering; PROTEIN-PROTEIN INTERACTION; FALSE DISCOVERY RATE; ASSOCIATION RULES; GENE-EXPRESSION; EFFICIENT ALGORITHM; PATTERNS; MICROARRAY; EXTRACTION; PREDICTION; BINDING;
D O I
10.1093/bib/bbt074
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Over the past two decades, pattern mining techniques have become an integral part of many bioinformatics solutions. Frequent itemset mining is a popular group of pattern mining techniques designed to identify elements that frequently co-occur. An archetypical example is the identification of products that often end up together in the same shopping basket in supermarket transactions. A number of algorithms have been developed to address variations of this computationally non-trivial problem. Frequent itemset mining techniques are able to efficiently capture the characteristics of (complex) data and succinctly summarize it. Owing to these and other interesting properties, these techniques have proven their value in biological data analysis. Nevertheless, information about the bioinformatics applications of these techniques remains scattered. In this primer, we introduce frequent itemset mining and their derived association rules for life scientists. We give an overview of various algorithms, and illustrate how they can be used in several real-life bioinformatics application domains. We end with a discussion of the future potential and open challenges for frequent itemset mining in the life sciences.
引用
收藏
页码:216 / 231
页数:16
相关论文
共 50 条
  • [1] Frequent Itemset Mining on Hadoop
    Ferenc Kovacs
    Illes, Janos
    [J]. IEEE 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL CYBERNETICS (ICCC 2013), 2013, : 241 - 245
  • [2] On A Visual Frequent Itemset Mining
    Lim, SeungJin
    [J]. 2009 FOURTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION MANAGEMENT, 2009, : 25 - 30
  • [3] Verified Programs for Frequent Itemset Mining
    Loulergue, Frederic
    Whitney, Christopher D.
    [J]. 2018 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2018, : 1516 - 1523
  • [4] Oracle and Vertica for Frequent Itemset Mining
    Kyurkchiev, Hristo
    Kaloyanova, Kalinka
    [J]. DATA MINING AND BIG DATA, DMBD 2016, 2016, 9714 : 77 - 85
  • [5] Frequent Itemset Mining in Multirelational Databases
    Jimenez, Aida
    Berzal, Fernando
    Cubero, Juan-Carlos
    [J]. FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS, 2009, 5722 : 15 - 24
  • [6] A Survey Paper on Frequent Itemset Mining
    Sastry, J. S. V. R. S.
    Suresh, V
    [J]. INTERNATIONAL CONFERENCE ON COMPUTER VISION AND MACHINE LEARNING, 2019, 1228
  • [7] A parallel algorithm for frequent itemset mining
    Li, L
    Zhai, DH
    Fan, J
    [J]. PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 868 - 871
  • [8] Frequent itemset mining with parallel RDBMS
    Shang, XQ
    Sattler, KU
    [J]. ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2005, 3518 : 539 - 544
  • [9] An efficient frequent itemset mining algorithm
    Luo, Ke
    Zhang, Xue-Mao
    [J]. PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 756 - 761
  • [10] Frequent closed informative itemset mining
    Fu, Huaiguo
    Foghlu, Micheal O.
    Donnelly, Willie
    [J]. CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS, 2007, : 232 - +