Mining association rules using fast algorithm
Published • Feb 1, 2010
NobleIDNI1P46W90R42S75
Authors:,,
M. Anandhavalli
Sandip Jain
Abhirup Chakraborti
Abstract
The most time consuming operation in Priori-like algorithms for association rule mining is the computation of the frequency of the occurrences of itemsets (called candidates) in the database. In this paper, a fast algorithm has been proposed for generating frequent itemsets without generating candid...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!