Association rule mining algorithm DB-growth based on relational database
by Sixue Bai; Shilin Duan
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 4, No. 1, 2015

Abstract: Excavating potential multidimensional valuable association rules from big data has wide application. The main association rule mining algorithm Apriori has the bottlenecks of scanning repeatedly database and generating big number of candidate sets, though the FP algorithm does not generate candidate sets, but FP-tree cannot handle the problem of storage and traversal of big data. In addition, Apriori and FP-growth algorithm needs to reconstruct association rules while implementing increment mining, its not available for growth-oriented data mining. Facing those problems, designing DB-growth algorithm based on relational database table SourceIndex, applying string combinate to generate pattern, insert or update database to construct frequent sets, mining association rules by querying database. In addition, it supports increment mining and depth mining.

Online publication date: Tue, 16-Feb-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com