1,450 Hits in 5.4 sec

Generating Non-redundant Multilevel Association Rules Using Min-max Exact Rules

R. Vijaya Prakash, S. S. V. N. Sarma, M. Sheshikala
2018 International Journal of Electrical and Computer Engineering (IJECE)  
Mining non-redundant Association Rules in multi-level dataset is a big concern in field of Data mining.  ...  The given non-redundant Association Rules are loss less representation for any datasets.  ...  GENERATION OF NON-REDUNDANT MULTI-LEVEL ASSOCIATION RULES The use of frequent itemsets as the basis for Association Rule mining often results in the generation of many rules.  ... 
doi:10.11591/ijece.v8i6.pp4568-4576 fatcat:nglaocszorfovk2ttkh6mzsppa

Closed Itemset Mining and Non-redundant Association Rule Mining [chapter]

Kenneth A. Ross, Christian S. Jensen, Richard Snodgrass, Curtis E. Dyreson, Christian S. Jensen, Richard Snodgrass, Spiros Skiadopoulos, Cristina Sirangelo, Mary Lynette Larsgaard, Gösta Grahne, Daniel Kifer, Hans-Arno Jacobsen (+106 others)
2009 Encyclopedia of Database Systems  
The aim of non-redundant association rule mining is to generate a rule basis, a small, non-redundant set of rules, from which all other association rules can be derived.  ...  An (frequent) itemset is called closed if it has no (frequent) superset having the same support. An association rule is an expression A ⇒ B, where A and B are itemsets, and A ∩ B = ∅.  ...  Non-Redundant Association Rules: Given the set of closed frequent itemsets C, one can generate all nonredundant association rules.  ... 
doi:10.1007/978-0-387-39940-9_66 fatcat:5pik2way2rgzlncqmtqkn7xa3e

Concise representations for association rules in multi-level datasets

Yue Xu, Gavin Shaw, Yuefeng Li
2009 Journal of Systems Science and Systems Engineering  
Experiments show that our extension can effectively generate multilevel non-redundant rules.  ...  In this paper, we firstly present a definition for redundancy and a concise representation called Reliable basis for representing non-redundant association rules, then we propose an extension to the previous  ...  Acknowledgment The authors appreciate the referees for their valuable comments and suggestions.  ... 
doi:10.1007/s11518-009-5098-x fatcat:mlp747kcyrg2fa2wgbvsdryq7q

Mining Constant Conditional Functional Dependencies for Improving Data Quality

D DeviKalyani
2013 International Journal of Computer Applications  
This allows one to find minimal non-redundant association rules.  ...  From these frequent closed itemsets and minimal generators, given a user specified confidence , we retrieve set of Minimum Non Redundant(MNR)association rules.  ... 
doi:10.5120/12960-9988 fatcat:cnxydmn5q5a2hkbe5wyon5j2ka

Extracting Non-redundant Approximate Rules from Multi-level Datasets

Gavin Shaw, Yue Xu, Shlomo Geva
2008 2008 20th IEEE International Conference on Tools with Artificial Intelligence  
2009) Extracting non-redundant approximate rules from multi-level datasets. Abstract Association rule mining plays an important job in knowledge and information discovery.  ...  Experimentation shows our approach can effectively generate both multi-level and cross level non-redundant rule sets which are lossless.  ...  Generation of Non-Redundant Approximate Multi-level Association Rules The use of frequent itemsets as the basis for association rule mining often results in the generation of a large number of rules and  ... 
doi:10.1109/ictai.2008.54 dblp:conf/ictai/ShawXG08 fatcat:pifk5bxqvvcqnf7p2rp3ymouju

Closed Association Rules

László Szathmáry
2020 Annales Mathematicae et Informaticae  
In this paper we present a new basis for association rules called Closed Association Rules ( ℛ). This basis contains all valid association rules that can be generated from frequent closed itemsets.  ...  The number of generated rules can be much less, and beside frequent closed itemsets nothing else is required.  ...  ℛ contains more rules than minimal non-redundant association rules (ℳ ℛ), but for the extraction of closed association rules we only need frequent closed itemsets, nothing else.  ... 
doi:10.33039/ami.2020.07.009 fatcat:lpankonk4nb2xjowraduaoz3em

ZART: A Multifunctional Itemset Mining Algorithm

Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznetsov
2007 International Conference on Concept Lattices and their Applications  
These characteristics allow one to extract minimal non-redundant association rules, a useful and lossless representation of association rules.  ...  This makes Zart a complete algorithm for computing classes of itemsets including generators and closed itemsets.  ...  Finding Minimal Non-Redundant Association Rules with Zart Generating all valid association rules from FIs produces too many rules of which many are redundant.  ... 
dblp:conf/cla/SzathmaryNK07 fatcat:355ij6rinfahxaf5fki2mheahi

Mining Non-Redundant Association Rules

Mohammed J. Zaki
2004 Data mining and knowledge discovery  
We present a new framework for associations based on the concept of closed frequent itemsets.  ...  The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected.  ...  We on the other hand are specifically interested in generating a smaller non-redundant rule set, after mining the frequent closed itemsets.  ... 
doi:10.1023/b:dami.0000040429.96086.c7 fatcat:sjgjtlwyvnfj3hlkhrl4wmr4yu

Generating non-redundant association rules

Mohammed J. Zaki
2000 Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '00  
We present a new framework for associations based on the concept of closed frequent itemsets.  ...  The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected.  ...  We present a new framework for association rule mining based on the concept of closed frequent itemsets.  ... 
doi:10.1145/347090.347101 dblp:conf/kdd/Zaki00 fatcat:cx5mvmphwnbd7h464h42r2nyka

A lattice-based approach for mining most generalization association rules

Bay Vo, Tzung-Pei Hong, Bac Le
2013 Knowledge-Based Systems  
However, the execution time for generating MGARs increased with an increasing number of frequent closed itemsets.  ...  Firstly, a new algorithm for building a frequent-closed-itemset lattice is introduced. After that, a theorem on pruning nodes in the lattice for rule generation is derived.  ...  In the past, some methods have been proposed for mining association rules, such as traditional association rules [1] , non-redundant association rules [29, 30] , and minimal non-redundant association  ... 
doi:10.1016/j.knosys.2013.02.003 fatcat:pswqzucc5rfv5n5unc2oj32tau

Removal of Duplicate Rules for Association Rule Mining from Multilevel Dataset

A.K. Chandanan, M.K. Shukla
2015 Procedia Computer Science  
The redundancy in association rules affects the quality of the information presented. The goal of redundancy elimination is to improve the quality and usefulness of the rules.  ...  There are many potential application areas for association rule approach which include design, layout, and customer segregation and so on.  ...  Conclusion Redundancy in association rules mining decreases the speed for rules generation. It cause so many rules to be generated for same set of attribute.  ... 
doi:10.1016/j.procs.2015.03.106 fatcat:up2t3fsgozgs7gdez764mmeu6y

A Recent Review on Itemset Tree Mining: MEIT Technique

Tanvi P.Patel, Warish D. Patel
2015 International Journal of Computer Applications  
Hence, Association rule mining is imperative to mine patterns and then generate rules from these obtained patterns.  ...  For mining maximal frequent pattern various algorithms used which optimization the search space for pruning.  ...  Tseng introduces [6] Mining Top-K Non-Redundant Association Rules. In this there is an approximate algorithm named TNR using for mining the top-k non-redundant association rules.  ... 
doi:10.5120/19922-2121 fatcat:4dvzjqhewffinb5szgvhoggake

An Efficient Method for Finding Closed Subspace Clusters for High Dimensional Data

S. Anuradha
2016 International Journal Of Engineering And Computer Science  
The set of non redundant subspace clusters is helpful for easy analysis. In order to accomplish this, the concept of closedness has been applied to the subspace clusters.  ...  Hence there is a need for eliminating such redundant subspace clusters and output only those subspace clusters which are non redundant and each of them contributing some unique information to the data  ...  By mining the association rules from the closed frequent itemsets, the number of rules generated reduces greatly.  ... 
doi:10.18535/ijecs/v5i10.31 fatcat:grnygpya5ne6fgxkc7pwocwywu

VIE_MGB: A Visual Interactive Exploration of Minimal Generic Basis of Association Rules

Cherif Chiraz Latiri, Wissem Bellegha, Sadok Ben Yahia, Ghada Guesmi
2005 International Conference on Concept Lattices and their Applications  
In this paper, we introduce a new minimal generic basis MGB of non-redundant association rules based on the augmented Iceberg Galois lattice.  ...  Mining association rules is an important task, even though the number of rules discovered is often huge.  ...  The database of interest has previously been mined, using an efficient algorithm for mining frequent closed itemsets and their minimal generators.  ... 
dblp:conf/cla/LatiriBYG05 fatcat:fxq6tzwfuzhdfga6ttonquwr24

Reliable representations for association rules

Yue Xu, Yuefeng Li, Gavin Shaw
2011 Data & Knowledge Engineering  
The Reliable basis contains a set of nonredundant rules which are derived using frequent closed itemsets and their generators instead of using frequent itemsets that are usually used by traditional association  ...  Mining non-redundant rules is a promising approach to solve this problem.  ...  Acknowledgment The authors would like to thank the referees for their valuable comments and suggestions.  ... 
doi:10.1016/j.datak.2011.02.003 fatcat:j6hy72usojbndafb4biwxscqeu
« Previous Showing results 1 — 15 out of 1,450 results