Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques
Data mining: concepts and techniques
Algorithms for association rule mining — a general survey and comparison
ACM SIGKDD Explorations Newsletter
Mining association rules using inverted hashing and pruning
Information Processing Letters
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An efficient cluster and decomposition algorithm for mining association rules
Information Sciences—Informatics and Computer Science: An International Journal
BitTableFI: An efficient mining frequent itemsets algorithm
Knowledge-Based Systems
Index-BitTableFI: An improved algorithm for mining frequent itemsets
Knowledge-Based Systems
CBAR: an efficient method for mining association rules
Knowledge-Based Systems
A matrix algorithm for mining association rules
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
A new parallel association rule mining algorithm on distributed shared memory system
International Journal of Business Intelligence and Data Mining
FAR-miner: a fast and efficient algorithm for fuzzy association rule mining
International Journal of Business Intelligence and Data Mining
Hi-index | 0.00 |
Existing Association Rules Mining (ARM) algorithms basically use multiple scans to extract a rule from a transaction database. Sometime ARM algorithms exit without a rule in the desktop environment due to the high volume of transactions. Matrix Algorithm (MA) is proposed to minimise this issue. However, it is a computational expensive solution. In this paper, we propose Advanced Matrix Algorithm (AMA), to generate an efficient rule by a single scan using the Boolean matrix concept. AMA is comparatively effective and efficient than traditional approaches in terms of computational cost for database scan and frequently candidate sets generation.