Mining Negative Associations from Medical Databases Considering Frequent, Regular, Closed and Maximal Patterns

被引:1
|
作者
Budaraju, Raja Rao [1 ]
Jammalamadaka, Sastry Kodanda Rama [2 ]
机构
[1] Koneru Lakshmaiah Educ Fdn, Dept Comp Sci & Engn, Guntur 522302, Andhra Pradesh, India
[2] Koneru Lakshmaiah Educ Fdn, Dept Elect & Comp Sci, Guntur 522302, Andhra Pradesh, India
关键词
data mining; databases; closed item sets; maximal item sets; regular patterns; frequent patterns; negative associations; INFREQUENT; RULES;
D O I
10.3390/computers13010018
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Many data mining studies have focused on mining positive associations among frequent and regular item sets. However, none have considered time and regularity bearing in mind such associations. The frequent and regular item sets will be huge, even when regularity and frequency are considered without any time consideration. Negative associations are equally important in medical databases, reflecting considerable discrepancies in medications used to treat various disorders. It is important to find the most effective negative associations. The mined associations should be as small as possible so that the most important disconnections can be found. This paper proposes a mining method that mines medical databases to find regular, frequent, closed, and maximal item sets that reflect minimal negative associations. The proposed algorithm reduces the negative associations by 70% when the maximal and closed properties have been used, considering any sample size, regularity, or frequency threshold.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] Mining frequent closed patterns in pointset databases
    Lee, Anthony J. T.
    Tsao, Wen-Kwang
    Chen, Po-Yin
    Lin, Ming-Chih
    Yang, Shih-Hui
    INFORMATION SYSTEMS, 2010, 35 (03) : 335 - 351
  • [2] Mining closed and maximal frequent subtrees from databases of labeled rooted trees
    Chi, Y
    Xia, Y
    Yang, YR
    Muntz, RR
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (02) : 190 - 202
  • [3] An efficient mining algorithm for maximal weighted frequent patterns in transactional databases
    Yun, Unil
    Shin, Hyeonil
    Ryu, Keun Ho
    Yoon, EunChul
    KNOWLEDGE-BASED SYSTEMS, 2012, 33 : 53 - 64
  • [4] An Improved Algorithm for Mining Maximal Frequent Patterns
    Hu, Yan
    Han, Ruixue
    FIRST IITA INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, : 746 - 749
  • [5] Frequent Treatment Sequence Mining from Medical Databases
    Toth, Krisztina
    Kosa, Istvan
    Vathy-Fogarassy, Agnes
    HEALTH INFORMATICS MEETS EHEALTH: DIGITAL INSIGHT - INFORMATION-DRIVEN HEALTH & CARE, 2017, 236 : 211 - 218
  • [6] A new framework for mining frequent interaction patterns from meeting databases
    Fariha, Anna
    Ahmed, Chowdhury Farhan
    Leung, Carson K.
    Samiullah, Md.
    Pervin, Suraiya
    Cao, Longbing
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2015, 45 : 103 - 118
  • [7] Incremental mining of weighted maximal frequent itemsets from dynamic databases
    Yun, Unil
    Lee, Gangin
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 54 : 304 - 327
  • [8] Mining maximal frequent patterns by considering weight conditions over data streams
    Yun, Unil
    Lee, Gangin
    Ryu, Keun Ho
    KNOWLEDGE-BASED SYSTEMS, 2014, 55 : 49 - 65
  • [9] Mining closed high utility patterns with negative utility in dynamic databases
    Meng Han
    Ni Zhang
    Le Wang
    Xiaojuan Li
    Haodong Cheng
    Applied Intelligence, 2023, 53 : 11750 - 11767
  • [10] Mining Maximal Frequent Itemsets over Sampling Databases
    Li, Haifeng
    PROCEEDINGS OF THE 2015 2ND INTERNATIONAL FORUM ON ELECTRICAL ENGINEERING AND AUTOMATION (IFEEA 2015), 2016, 54 : 28 - 31