DMET-Miner: Efficient discovery of association rules from pharmacogenomic data

被引:34
|
作者
Agapito, Giuseppe [1 ]
Guzzi, Pietro H. [1 ]
Cannataro, Mario [1 ,2 ]
机构
[1] Magna Graecia Univ Catanzaro, Dept Med & Surg Sci, Catanzaro, Italy
[2] CNR, ICAR, I-00185 Rome, Italy
关键词
Personalized medicine; Single nucleotide polymorphism; Frequent itemset mining; Association rules; COLORECTAL-CANCER PATIENTS; POLYMORPHISM;
D O I
10.1016/j.jbi.2015.06.005
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Microarray platforms enable the investigation of allelic variants that may be correlated to phenotypes. Among those, the Affymetrix DMET (Drug Metabolism Enzymes and Transporters) platform enables the simultaneous investigation of all the genes that are related to drug absorption, distribution, metabolism and excretion (ADME). Although recent studies demonstrated the effectiveness of the use of DMET data for studying drug response or toxicity in clinical studies, there is a lack of tools for the automatic analysis of DMET data. In a previous work we developed DMET-Analyzer, a methodology and a supporting platform able to automatize the statistical study of allelic variants, that has been validated in several clinical studies. Although DMET-Analyzer is able to correlate a single variant for each probe (related to a portion of a gene) through the use of the Fisher test, it is unable to discover multiple associations among allelic variants, due to its underlying statistic analysis strategy that focuses on a single variant for each time. To overcome those limitations, here we propose a new analysis methodology for DMET data based on Association Rules mining, and an efficient implementation of this methodology, named DMET-Miner. DMET-Miner extends the DMET-Analyzer tool with data mining capabilities and correlates the presence of a set of allelic variants with the conditions of patient's samples by exploiting association rules. To face the high number of frequent itemsets generated when considering large clinical studies based on DMET data, DMET-Miner uses an efficient data structure and implements an optimized search strategy that reduces the search space and the execution time. Preliminary experiments on synthetic DMET datasets, show how DMET-Miner outperforms off-the-shelf data mining suites such as the FP-Growth algorithms available in Weka and RapidMiner. To demonstrate the biological relevance of the extracted association rules and the effectiveness of the proposed approach from a medical point of view, some preliminary studies on a real clinical dataset are currently under medical investigation. (C) 2015 Elsevier Inc. All rights reserved.
引用
下载
收藏
页码:273 / 283
页数:11
相关论文
共 50 条
  • [21] Efficient Discovery of Differential Dependencies Through Association Rules Mining
    Kwashie, Selasi
    Liu, Jixue
    Li, Jiuyong
    Ye, Feiyue
    DATABASES THEORY AND APPLICATIONS, 2015, 9093 : 3 - 15
  • [22] PARM-An Efficient Algorithm to Mine Association Rules From Spatial Data
    Ding, Qin
    Ding, Qiang
    Perrizo, William
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2008, 38 (06): : 1513 - 1524
  • [23] An Efficient Approach for Extraction Positive and Negative Association Rules from Big Data
    Parfait, Bemarisika
    Harrimann, Ramanantsoa
    Andre, Totohasina
    MACHINE LEARNING AND KNOWLEDGE EXTRACTION, CD-MAKE 2018, 2018, 11015 : 79 - 97
  • [24] An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules
    Al-Opahi, Ahmed Abdul-Wahab
    Al-Maqaleh, Basheer Mohamad
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2015, 6 (06) : 169 - 173
  • [25] An Efficient Data Structure for Mining Generalized Association Rules
    Wu, Chieh-Ming
    Huang, Yin-Fu
    FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2008, : 565 - 571
  • [26] Efficient algorithm for the extraction of association rules in data mining
    Mitra, Pinaki
    Chaudhuri, Chitrita
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 2, 2006, 3981 : 1 - 10
  • [27] Discovery of Certain Association Rules from an Uncertain Database
    Arvind, Terrence Shebuel
    Badhe, Vivek
    2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS (CICN), 2015, : 827 - 831
  • [28] An Efficient Java']Java Implementation of a GA-based Miner for Relational Association Rules with Numerical Attributes
    Seki, Hirohisa
    Nagao, Masahiro
    2017 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2017, : 2028 - 2033
  • [29] NAR-Miner: Discovering Negative Association Rules from Code for Bug Detection
    Bian, Pan
    Liang, Bin
    Shi, Wenchang
    Huang, Jianjun
    Cai, Yan
    ESEC/FSE'18: PROCEEDINGS OF THE 2018 26TH ACM JOINT MEETING ON EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING, 2018, : 411 - 422
  • [30] An efficient data extraction mechanism for mining association rules from wireless sensor networks
    Boukerche, Azzedine
    Samarah, Samer
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 3936 - 3941