2019
DOI: 10.1007/s11227-019-03053-8
|View full text |Cite
|
Sign up to set email alerts
|

The curse of indecomposable aggregates for big data exploratory analysis with a case for frequent pattern cubes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…In the process of mining large data frequent itemsets, there is an a priori property that can be used to compress the search space. A priori property belongs to all nonempty subsets of frequent itemsets [10,11]. Combined with this definition, if the itemset X is not frequent, it means that the itemset does not meet the requirements of minimum support.…”
Section: Big Data Frequent Itemsetmentioning
confidence: 99%
“…In the process of mining large data frequent itemsets, there is an a priori property that can be used to compress the search space. A priori property belongs to all nonempty subsets of frequent itemsets [10,11]. Combined with this definition, if the itemset X is not frequent, it means that the itemset does not meet the requirements of minimum support.…”
Section: Big Data Frequent Itemsetmentioning
confidence: 99%