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 Regular Closed Patterns in Transactional Databases
    Sreedevi, M.
    Reddy, L. S. S.
    7TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO 2013), 2013, : 380 - 383
  • [3] 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
  • [4] Parallel mining of maximal frequent itemsets from databases
    Chung, SM
    Luo, C
    15TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2003, : 134 - 139
  • [5] 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
  • [6] An Efficient Algorithm for Mining Maximal Frequent Sequential Patterns in Large Databases
    Su, Qiu-bin
    Lu, Lu
    Cheng, Bin
    2018 INTERNATIONAL CONFERENCE ON COMMUNICATION, NETWORK AND ARTIFICIAL INTELLIGENCE (CNAI 2018), 2018, : 404 - 410
  • [7] Mining Frequent Patterns from Hypergraph Databases
    Alam, Md Tanvir
    Ahmed, Chowdhury Farhan
    Samiullah, Md
    Leung, Carson K.
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2021, PT II, 2021, 12713 : 3 - 15
  • [8] Max-FTP:Mining maximal fault-tolerant frequent patterns from databases
    Bashir, Shariq
    Baig, A. Rauf
    DATA MANAGEMENT: DATA, DATA EVERYWHERE, PROCEEDINGS, 2007, 4587 : 235 - +
  • [9] Mining top-k frequent-regular closed patterns
    Amphawan, Komate
    Lenca, Philippe
    EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) : 7882 - 7894
  • [10] Mining of closed frequent subtrees from frequently updated databases
    Viet Anh Nguyen
    Yamamoto, Akihiro
    INTELLIGENT DATA ANALYSIS, 2012, 16 (06) : 953 - 967