Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Managing and analyzing carbohydrate data
ACM SIGMOD Record
Finding hot query patterns over an XQuery stream
The VLDB Journal — The International Journal on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
Online mining of frequent query trees over XML data streams
Proceedings of the 15th international conference on World Wide Web
Mining maximal frequent itemsets from data streams
Journal of Information Science
Mining adaptively frequent closed unlabeled rooted trees in data streams
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent closed itemsets from a landmark window over online data streams
Computers & Mathematics with Applications
Mining non-derivable frequent itemsets over data stream
Data & Knowledge Engineering
Mining Local Correlation Patterns in Sets of Sequences
DS '09 Proceedings of the 12th International Conference on Discovery Science
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Efficient algorithms for finding frequent substructures from semi-structured data streams
JSAI'03/JSAI04 Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence
Incremental mining of closed frequent subtrees
DS'10 Proceedings of the 13th international conference on Discovery science
Mining frequent closed trees in evolving data streams
Intelligent Data Analysis - Ubiquitous Knowledge Discovery
Dynamically mining frequent patterns over online data streams
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Extracting structural features among words from document data streams
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
A false negative maximal frequent itemset mining algorithm over stream
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
Kernel-based selective ensemble learning for streams of trees
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
A lossy counting based approach for learning on streams of graphs on a budget
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Mining of closed frequent subtrees from frequently updated databases
Intelligent Data Analysis
| Hi-index | 0.00 |
In this paper, we study an online data mining problemfrom streams of semi-structured data such as XML data.Modeling semi-structured data and patterns as labeled orderedtrees, we present an online algorithm StreamT thatreceives fragments of an unseen possibly infinite semi-structureddata in the document order through a datastream, and can return the current set of frequent patternsimmediately on request at any time. A crucial part of our algorithmis the incremental maintenance of the occurrencesof possibly frequent patterns using a tree sweeping technique.We give modifications of the algorithm to other on-linemining model. We present theoretical and empiricalanalyses to evaluate the performance of the algorithm.