2020
DOI: 10.1002/int.22294
|View full text |Cite
|
Sign up to set email alerts
|

SAT‐based and CP‐based declarative approaches for Top‐Rank‐ K  closed frequent itemset mining

Abstract: Top-Rank-K Frequent Itemset (or Pattern) Mining (FPM) is an important data mining task, where user decides on the number of top frequency ranks of patterns (itemsets) they want to mine from a transactional dataset. This problem does not require the minimum support threshold parameter that is typically used in FPM problems. Rather, the algorithms solving the Top-Rank-K FPM problem are fed with K , the number of frequency ranks of itemsets required, to compute the threshold internally. This paper presents two de… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 28 publications
0
3
0
Order By: Relevance
“…Frequent itemsets are patterns that occur with a frequency greater than or equal to a user‐defined threshold in a dataset (Abed et al, 2021; Deng, 2013; Han et al, 2007). For instance, a frequent itemset is a collection of items, such as bread and cheese, that frequently appear together in a transaction dataset.…”
Section: Methodsmentioning
confidence: 99%
“…Frequent itemsets are patterns that occur with a frequency greater than or equal to a user‐defined threshold in a dataset (Abed et al, 2021; Deng, 2013; Han et al, 2007). For instance, a frequent itemset is a collection of items, such as bread and cheese, that frequently appear together in a transaction dataset.…”
Section: Methodsmentioning
confidence: 99%
“…The method proposed here removes tuples that get updated from the SlideTree thereby avoiding the need to visit the entire previous slide. To handle the top rank k-closed frequent pattern mining problem Abed et al [17] presented two approaches. The first was based on Boolean satisfiability where an efficient algorithm was designed to improve the encoding of the problem.…”
Section: Introductionmentioning
confidence: 99%
“…7 Association rule mining, [8][9][10] which is a branch of data mining, finds the relationship between items in a database. Frequent pattern mining, [11][12][13] which is a kind of association rule mining, finds frequent patterns that are sets of items in a binary database. Apriori 14 and FP-Growth 15 are representative pattern mining algorithms in regard to a binary database.…”
Section: Introductionmentioning
confidence: 99%