Top-k Frequent Pattern Mining
Top-K Frequent Pattern Mining is a frequent pattern mining approach that identifies the k most frequent itemsets exceeding all others in support count, without requiring a user-specified minimum support threshold.
105
Publications
6.3K
Citations
274
Authors
146
Institutions
Publications per year
2017–2026
39
Variants
Top-k Pattern Mining
Parents
105
Frequent pattern mining: current status and future directions
Jiawei Han, Hong Cheng, Dong Xin et al. · Data Mining and Knowledge Discovery · 2007 · 1.4K citations · Full text
Raymond C. K. Chan, Qiang Yang, Yi-Dong Shen · 2004 · 413 citations
Mining top-k frequent closed patterns without minimum support
Jiawei Han, Jianyong Wang, Ying Lu et al. · 2003 · 254 citations
1–5 of 105
274
7
h-index
5
h-index
5
h-index
5
h-index
5
h-index
1–5 of 274
146

Peking University
Beijing, China
7 h-index
14 publications
834 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
22 publications
8.4K citations
Ho Chi Minh City University of Technology
Ho Chi Minh City, Vietnam
6 h-index
6 publications
133 citations

Sejong University
Seoul, South Korea
6 h-index
9 publications
505 citations

Harbin Institute of Technology
Harbin, China
6 h-index
9 publications
411 citations

Ton Duc Thang University
Ho Chi Minh City, Vietnam
5 h-index
6 publications
209 citations

Hunan University
Changsha, China
4 h-index
10 publications
527 citations
HUTECH University
Ho Chi Minh City, Vietnam
4 h-index
4 publications
88 citations
1–8 of 146
11 publications · 322 citations
11
h-index
9 publications · 283 citations
8
h-index
6 publications · 298 citations
6
h-index
6 publications · 270 citations
6
h-index
5 publications · 1.6K citations
5
h-index
1–5