Logo image
A fast association rule algorithm based on bitmap and granular computing
Conference proceeding

A fast association rule algorithm based on bitmap and granular computing

T Y Lin, X H Hu and E Louie
PROCEEDINGS OF THE 12TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1 AND 2, v 1, pp 678-683
01 Jan 2003

Abstract

Computer Science Computer Science, Artificial Intelligence Engineering Engineering, Electrical & Electronic Science & Technology Technology
Mining association rules from databases is a time-consuming process. Finding the large item set fast is the crucial step in the association rule algorithm. In this paper we present a fast association rule algorithm (Bit-AssoRule) based on granular computing. Our Bit-AssocRule doesn't follow the generation-and-test strategy of Apriori algorithm and adopts the divide-and-conquer strategy, thus avoids the time-consuming table scan to find and prune the itemsets, all the operations of finding large itemsets from the datasets are the fast bit operations based on its corresponding granular. The experimental result of our Bit-AssocRule algorithm with Apriori, AprioriTid and AprioirHybrid algorithms shows Bit-AssocRule is 2 to 3 orders of magnitudes faster. Our research indicates that bitmap and granular computing can greatly improve the performance of association rule algorithm, and are very promising for data mining applications.

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#3 Good Health and Well-Being

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Artificial Intelligence
Engineering, Electrical & Electronic
Logo image