Mining association rules using inverted hashing and pruning

Authors:
John D. Holt;Soon M. Chung
Affiliations:
Department of Computer Science and Engineering, Wright State University, Dayton, OH;Department of Computer Science and Engineering, Wright State University, Dayton, OH
Venue:
Information Processing Letters
Year:
2002

Citing 6
Cited 15

Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multipass algorithms for mining association rules in text databases

Knowledge and Information Systems
Data Mining: An Overview from a Database Perspective

IEEE Transactions on Knowledge and Data Engineering
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules

IEEE Transactions on Knowledge and Data Engineering
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

Change Profiles

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
An efficient cluster and decomposition algorithm for mining association rules

Information Sciences—Informatics and Computer Science: An International Journal
Research and implementation on datamining applied to learning guidance system

ICEC '05 Proceedings of the 7th international conference on Electronic commerce
Parallel mining of association rules from text databases

The Journal of Supercomputing
BitTableFI: An efficient mining frequent itemsets algorithm

Knowledge-Based Systems
Searching customer patterns of mobile service using clustering and quantitative association rule

Expert Systems with Applications: An International Journal
Mining association rules from imprecise ordinal data

Fuzzy Sets and Systems
Making items suggestions in non online environments

AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
Approximate mining of frequent patterns on streams

Intelligent Data Analysis - Knowlegde Discovery from Data Streams
Efficient mining of maximal frequent itemsets from databases on a cluster of workstations

Knowledge and Information Systems
FIUT: A new method for mining frequent itemsets

Information Sciences: an International Journal
Mining fuzzy association rules from uncertain data

Knowledge and Information Systems
Advanced Matrix Algorithm (AMA): reducing number of scans for association rule generation

International Journal of Business Intelligence and Data Mining
A matrix algorithm for mining association rules

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Design and implementation of an intelligent automatic question answering system based on data mining

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we propose a new algorithm named Inverted Hashing and Pruning (IHP) for mining association rules between items in transaction databases. The performance of the IHP algorithm was evaluated for various cases and compared with those of two well-known mining algorithms, Apriori algorithm [Proc. 20th VLDB Conf., 1994, pp. 487-499] and Direct Hashing and Pruning algorithm [IEEE Trans. on Knowledge Data Engrg. 9 (5) (1997) 813-825]. It has been shown that the IHP algorithm has better performance for databases with long transactions.