Fast discovery of association rules
Advances in knowledge discovery and data mining
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Global partial orders from sequential data
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Machine Learning
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth
Proceedings of the 17th International Conference on Data Engineering
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Web Mining: Information and Pattern Discovery on the World Wide Web
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Fuzzy Tree Mining: Go Soft on Your Nodes
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
FTMnodes: Fuzzy tree mining based on partial inclusion
Fuzzy Sets and Systems
Tree pattern mining with tree automata constraints
Information Systems
Frequent subtrees minging based on projected node
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Improving constrained pattern mining with first-fail-based heuristics
Data Mining and Knowledge Discovery
Mining maximum frequent access patterns in web logs based on unique labeled tree
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Hi-index | 0.00 |
With the development of Internet, frequent pattern mining has been extended to more complex patterns like tree mining and graph mining. Such applications arise in complex domains like bioinformatics, web mining, etc. In this paper, we present a novel algorithm, named Chopper, to discover frequent subtrees from ordered labeled trees. An extensive performance study shows that the newly developed algorithm outperforms TreeMiner V, one of the fastest methods proposed previously, in mining large databases. At the end of this paper, the potential improvement of Chopper is mentioned.