Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2015
2015
Unordered tree mining has important research value in the field of XML data, bioinformatics, Web structure. In this paper, we… 
2010
2010
Most algorithms for mining frequent subtrees are mining completed frequent sets, so the searching space and results are very huge… 
Review
2010
Review
2010
Large corpora of formal proofs have been developed over the years, that sit in the repositories of the various existing proof… 
2009
2009
As a technology based on database, statistics and AI, data mining provides biological research a useful information analyzing… 
2008
2008
— The inherent flexibilities of XML in both structure and semantics makes mining from XML data a complex task with more… 
2006
2006
Summary Mining frequent subtree patterns has many useful applications in XML mining, bioinformatics, network routing, etc. Most… 
2006
2006
XML is playing an increasing role in data exchanges and the volume of available resources is thus growing dramatically. As they…