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
相关论文
共 37 条
  • [1] DMET-Miner: Efficient Learning of Association Rules from Genotyping Data for Personalized Medicine
    Guzzi, Pietro Hiram
    Agapito, Giuseppe
    Di Martino, Maria Teresa
    Arbitrio, Mariamena
    Tassone, Pierfrancesco
    Tagliaferri, Pierosandro
    Cannataro, Mario
    2014 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2014,
  • [2] Discovery of association rules in medical data
    Doddi, S
    Marathe, A
    Ravi, SS
    Torney, DC
    MEDICAL INFORMATICS AND THE INTERNET IN MEDICINE, 2001, 26 (01): : 25 - 33
  • [3] Interactive discovery of association rules over data streams
    Shin, Se Jung
    Lee, Won Suk
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2014, 29 (05): : 341 - 352
  • [4] Efficient mining of salinity and temperature association rules from ARGO data
    Huang, Yo-Ping
    Kao, Li-Jen
    Sandnes, Frode-Eika
    EXPERT SYSTEMS WITH APPLICATIONS, 2008, 35 (1-2) : 59 - 68
  • [5] Efficient Association Rules Mining from Streaming Data with a Fault Tolerance
    Abd Elaty, Amr Aly
    Salem, Rashed
    Abd Elkader, Hatem
    PROCEEDINGS OF 2018 13TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND SYSTEMS (ICCES), 2018, : 627 - 632
  • [6] 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
  • [7] 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
  • [8] Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees
    Riondato, Matteo
    Upfal, Eli
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2014, 8 (04)
  • [9] Discovery of Fuzzy Rare Association Rules from Large Transaction Databases
    Ouyang, Weimin
    PROCEEDINGS OF THE 2016 7TH INTERNATIONAL CONFERENCE ON EDUCATION, MANAGEMENT, COMPUTER AND MEDICINE (EMCM 2016), 2017, 59 : 160 - 165
  • [10] Selecting Relevant Association Rules From Imperfect Data
    L'Heritier, Cecile
    Harispe, Sebastien
    Imoussaten, Abdelhak
    Dusserre, Gilles
    Roig, Benoit
    SCALABLE UNCERTAINTY MANAGEMENT, SUM 2019, 2019, 11940 : 107 - 121