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)

Related topics

Related topics

5 relations
Computer scienceGraph isomorphismKEGGMaximum agreement subtree problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
2014
2014
Constrained Frequent Subtree Mining Method
With the semi-structured data rapidly growing, it is crucial to obtain valuable information for different applications. So many… 
2014
2014
A New Marketing Channel Management Strategy Based on Frequent Subtree Mining
ABSTRACT For most manufacturers, success or failure is determined by how effectively and efficiently their products are sold… 
Review
2011
Review
2011
Incorporating Qualitative Information for Credit Risk Assessment through Frequent Subtree Mining for XML
Credit risk assessment has been one of the most appealing topics in banking and finance studies, attracting both scholars’ and… 
2009
2009
Quantitative analysis of treebanks using frequent subtree mining methods
The first task of statistical computational linguistics, or any other type of data-driven processing of language, is the… 
2008
2008
Towards Argument Mining from Relational DataBase
. Argumentation theory is considered an interdisciplinary research area. Its techniques and results have found a wide range of… 
2007
2007
Implications of frequent subtree mining using hybrid support definitions
Frequent subtree mining has found many useful applications in areas where the domain knowledge is presented in a tree structured… 
2007
2007
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of… 
2006
2006
Mining Frequent Induced Subtree Patterns with Subtree-Constraint
Mining frequent induced subtree patterns is very useful in domains such as XML databases, Web log analyzing. However, because of… 
2005
2005
AMIOT: induced ordered tree mining in tree-structured databases
Frequent subtree mining has become increasingly important in recent years. In this paper, we present AMIOT algorithm to discover… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)