Elimination of Redundant Association Rules-An Efficient Linear Approach

被引:1
|
作者
Jeyapal, Akilandeswari [1 ]
Ganesan, Jothi [1 ]
机构
[1] Sona Coll Technol, Dept IT, Salem, Tamil Nadu, India
关键词
Data mining; Association rule mining; Non-redundant rules; Market basket analysis; Frequent itemsets;
D O I
10.1007/978-981-10-0251-9_18
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Association rule mining plays an important role in data mining and knowledge discovery. Market basket analysis, medical diagnosis, protein sequence analysis, social media analysis etc., are some prospective research areas of association rule mining. These types of datasets contain huge numbers of features/item sets. Traditional association rule mining algorithms generate lots of rules based on the support and confidence values, many such rules thus generated are redundant. The eminence of the information is affected by the redundant association rules. Therefore, it is essential to eliminate the redundant rules to improve the quality of the results. The proposed algorithm removes redundant association rules to improve the quality of the rules and decreases the size of the rule list. It also reduces memory consumption for further processing of association rules. The experimental results show that, our proposed method effectively removes the redundancy.
引用
收藏
页码:171 / 180
页数:10
相关论文
共 50 条
  • [31] Massive Pruning for Building an Operational Set of Association Rules: Metarules for Eliminating Conflicting and Redundant Rules
    Cadot, Martine
    Lelu, Alain
    INTERNATIONAL CONFERENCE ON INFORMATION, PROCESS, AND KNOWLEDGE MANAGEMENT: EKNOW 2009, PROCEEDINGS, 2009, : 90 - +
  • [32] Efficient sanitization of informative association rules
    Wang, Shyue-Liang
    Maskey, Rajeev
    Jafari, Ayat
    Hong, Tzung-Pei
    EXPERT SYSTEMS WITH APPLICATIONS, 2008, 35 (1-2) : 442 - 450
  • [33] Efficient mining of intertransaction association rules
    Tung, AKH
    Lu, HJ
    Han, JW
    Feng, L
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2003, 15 (01) : 43 - 56
  • [34] An Approach for Mining Non-Redundant Sequential Rules Efficiently
    Minh-Thai Tran
    Bay Vo
    Bac Le
    Tzung-Pei Hong
    PROCEEDINGS OF 2015 2ND NATIONAL FOUNDATION FOR SCIENCE AND TECHNOLOGY DEVELOPMENT CONFERENCE ON INFORMATION AND COMPUTER SCIENCE NICS 2015, 2015, : 277 - 282
  • [35] An Efficient Measure for Evaluating Association Rules
    Djenouri, Youcef
    Gheraibia, Youcef
    Mehdi, Malika
    Bendjoudi, Ahcene
    Nouali-Taboudjemat, Nadia
    2014 6TH INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION (SOCPAR), 2014, : 406 - 410
  • [36] Efficient statistical pruning of association rules
    Ableson, A
    Glasgow, J
    KNOWLEDGE DISCOVERY IN DATABASES: PKDD 2003, PROCEEDINGS, 2003, 2838 : 23 - 34
  • [37] Efficient progressive sampling for association rules
    Parthasarathy, S
    2002 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2002, : 354 - 361
  • [38] Mining of Multiobjective Non-redundant Association Rules in Data Streams
    Gupta, Anamika
    Kumar, Naveen
    Bhatnagar, Vasudha
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II, 2012, 7268 : 73 - 81
  • [39] Mining non-redundant association rules based on concise bases
    Xu, Yue
    Li, Yuefeng
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2007, 21 (04) : 659 - 675
  • [40] Extracting minimal non-redundant association rules from QCIL
    Li, Y
    Liu, ZT
    Chen, L
    Cheng, W
    Xie, CH
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 986 - 991