Frequent Tree Mining
Frequent Tree Mining is a computational method in the field of frequent pattern mining that identifies recurring tree-structured subgraphs within a dataset of tree-structured data, distinguished by its focus on discovering subtrees that appear with a frequency above a specified threshold.
126
Publications
6K
Citations
320
Authors
143
Institutions
Publications per year
2017–2026
12
Parents
126
Efficiently mining frequent trees in a forest
Mohammed J. Zaki · 2002 · 467 citations
Frequent Subtree Mining - An Overview
Yün Chi, Richard R. Muntz, Siegfried Nijssen et al. · 2004 · 264 citations · Full text
Mining top-k frequent closed patterns without minimum support
Jiawei Han, Jianyong Wang, Ying Lu et al. · 2003 · 254 citations
1–5 of 126
320
8
h-index
6
h-index
6
h-index
6
h-index
6
h-index
1–5 of 320
143
University of California, Los Angeles
Los Angeles, United States
7 h-index
21 publications
2.1K citations

National University of Kaohsiung
Kaohsiung City, Taiwan
6 h-index
8 publications
433 citations

National Sun Yat-sen University
Kaohsiung City, Taiwan
5 h-index
8 publications
436 citations
University of Technology Sydney
Sydney, Australia
5 h-index
14 publications
382 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
5 h-index
11 publications
295 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
4 h-index
9 publications
824 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
10 publications
806 citations

University of Manitoba
Winnipeg, Canada
4 h-index
10 publications
848 citations
1–8 of 143
4 publications · 409 citations
4
h-index
IDA · 3 publications · 57 citations
3
h-index
TKDE · 3 publications · 488 citations
3
h-index
2 publications · 43 citations
2
h-index
2 publications · 114 citations
2
h-index
1–5