Frequent Closed Pattern Mining
Frequent Closed Pattern Mining is a method in frequent pattern mining that identifies maximal frequent itemsets by retaining only those patterns for which no proper superset has the same support, thus reducing redundancy while preserving complete frequency information.
168
Publications
13.2K
Citations
377
Authors
187
Institutions
Publications per year
2017–2026
29
Parents
168
CHARM: An Efficient Algorithm for Closed Itemset Mining
Mohammed J. Zaki, Ching-Jui Hsiao · 2002 · 901 citations
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Jian Pei · 2000 · 831 citations
BIDE: efficient mining of frequent closed sequences
Jiang Wang, Jiawei Han · 2004 · 611 citations
1–5 of 168
377
11
h-index
10
h-index
10
h-index
10
h-index
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo", Italy
6 publications · 439 citations
6
h-index
1–5 of 377
187
University of Illinois Urbana-Champaign
Urbana, United States
15 h-index
41 publications
7.6K citations
Ho Chi Minh City University of Technology
Ho Chi Minh City, Vietnam
11 h-index
13 publications
449 citations
Ho Chi Minh City University of Science
Ho Chi Minh City, Vietnam
10 h-index
12 publications
378 citations
National University of Singapore
Singapore, Singapore
9 h-index
26 publications
1.7K citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
21 publications
630 citations

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

Vietnam National University Ho Chi Minh City
Ho Chi Minh City, Vietnam
5 h-index
7 publications
222 citations
Tsinghua University
Beijing, China
5 h-index
10 publications
763 citations
1–8 of 187
15 publications · 439 citations
12
h-index
TKDE · 9 publications · 1.9K citations
9
h-index
7 publications · 269 citations
7
h-index
6 publications · 135 citations
6
h-index
5 publications · 107 citations
5
h-index
1–5