2004
DOI: 10.1007/978-3-540-28651-6_23
|View full text |Cite
|
Sign up to set email alerts
|

A Framework for Mining Association Rules in Data Warehouses

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Mining multidimensional data need additional attention in terms of mining algorithms and tools. Taniar et al [36] and Tjioe and Taniar [37] propose association mining rules to data warehouse scenarios. Nimmagadda and Dreher [27] propose classical mining algorithms for analyzing the metadata views.…”
Section: Data Characterization and Miningmentioning
confidence: 99%
“…Mining multidimensional data need additional attention in terms of mining algorithms and tools. Taniar et al [36] and Tjioe and Taniar [37] propose association mining rules to data warehouse scenarios. Nimmagadda and Dreher [27] propose classical mining algorithms for analyzing the metadata views.…”
Section: Data Characterization and Miningmentioning
confidence: 99%
“…Now major difference between the frequent pattern-growth and other algorithms is found out to be that FP-growth does not essentially generate the candidates, rather it just tests them. Whereas the Apriori algorithm not only just tests the candidate item sets but beforehand generates them also [9]. The motivation behind FP-tree methods has been the following:…”
Section: Fp-growthmentioning
confidence: 99%