Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 239,031,015 papers from all fields of science
Search
Sign In
Create Free Account
Frequent subtree mining
In computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computer science
Graph isomorphism
KEGG
Maximum agreement subtree problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Frequent Subtree Mining Algorithm for Ribonucleic Acid Topological Pattern
Zhi-Qiang Li
,
Chengjie Xu
,
Chen Liu
Rev. d'Intelligence Artif.
2019
Corpus ID: 201892455
ABSTRACT
2015
2015
Study on A Fast Algorithm for Mining Disorder Tree
Xin Guo
2015
Corpus ID: 59607731
Unordered tree mining has important research value in the field of XML data, bioinformatics, Web structure. In this paper, we…
Expand
2010
2010
Maximal Frequent Subtree Mining Algorithm Based on Subtree Constraint
Dong-Jun Chen
2010
Corpus ID: 124186716
Most algorithms for mining frequent subtrees are mining completed frequent sets, so the searching space and results are very huge…
Expand
Review
2010
Review
2010
Formal proof mining , a structure-oriented approach
Matthias Puech
2010
Corpus ID: 17324057
Large corpora of formal proofs have been developed over the years, that sit in the repositories of the various existing proof…
Expand
2009
2009
Efficiently Methods for Embedded Frequent Subtree Mining on Biological Data
W. Liu
,
Ling Chen
,
Lan-jiang Zheng
2009
Corpus ID: 16553736
As a technology based on database, statistics and AI, data mining provides biological research a useful information analyzing…
Expand
2008
2008
A New Model for Discovering XML Association Rules from XML Documents
R. AliMohammadzadeh
,
M. Rahgozar
,
A. Zarnani
2008
Corpus ID: 5607026
— The inherent flexibilities of XML in both structure and semantics makes mining from XML data a complex task with more…
Expand
2007
2007
An Analysis of Sequential Data with Hierarchical Structure of Time Frame Using Frequent Subtree Mining
Ryohei Fukuda
,
Hiroyuki Oono
,
Inazumi Hiroshige
2007
Corpus ID: 86573195
2006
2006
Complete Discovery of Weighted Frequent Subtrees in Tree-Structured Datasets
R. AliMohammadzadeh
,
A. Zarnani
,
M. Rahgozar
,
M. H. Chehreghani
2006
Corpus ID: 18871170
Summary Mining frequent subtree patterns has many useful applications in XML mining, bioinformatics, network routing, etc. Most…
Expand
2006
2006
Frequent Subtree Mining Based on Projected Branch
Chuan-Shen Zhao
,
Zhi-Hui Sun
,
Jing Zhang
2006
Corpus ID: 58080810
2006
2006
Data Structures for Efficient Tree Mining with Soft Embedding Constraints
F. del Razo López
,
Stéphane Sanchez
,
A. Laurent
,
P. Poncelet
,
M. Teisseire
2006
Corpus ID: 16552804
XML is playing an increasing role in data exchanges and the volume of available resources is thus growing dramatically. As they…
Expand