An Efficient Approach for Candidate Set Generation
When Apriori was first introduced as an algorithm for discovering association rules in a database of market basket data, the problem of generating the candidate set of the large set was a bottleneck in Apriori's performance, both in space and computational requirements. At first, many unsuccessful attempts were made to improve the generation of a candidate set. Later, other algorithms that out performed Apriori were developed that generate association rules without using a candidate set. They used the counting property of association rules instead of generating the candidate set as Apriori does. However, the Apriori concept has been used in many different areas other than counting market basket items, and the candidate generation problem remains a bottleneck issue. The approach described here improves the overall time and space requirements by eliminating the need for a hash table/tree of formation for the candidate set.
Year of publication: |
2005
|
---|---|
Authors: | Malhis, Nawar ; Ruttan, Arden ; Refai, Hazem H. |
Published in: |
Journal of Information & Knowledge Management (JIKM). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-6926. - Vol. 04.2005, 04, p. 287-291
|
Publisher: |
World Scientific Publishing Co. Pte. Ltd. |
Subject: | Candidate set generation | apriori | association rules | gene regulatory network | frequent episodes |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
La Market Basket Analysis nell'e-commerce
TUCCI, Marilena, (2005)
-
Prokeinová, R. Benda, (2014)
-
Mining Customer Shopping Behavior: A Method Encoding Customer Purchase Decision Attitude
Yeh, Hsiao-ping, (2018)
- More ...