Sciweavers

302 search results - page 31 / 61
» Efficient frequent pattern mining over data streams
Sort
View
97
Voted
TKDE
2008
153views more  TKDE 2008»
14 years 9 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
14 years 7 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 10 months ago
Sustainable operation and management of data center chillers using temporal data mining
Motivation: Data centers are a critical component of modern IT infrastructure but are also among the worst environmental offenders through their increasing energy usage and the re...
Debprakash Patnaik, Manish Marwah, Ratnesh K. Shar...
IS
2010
14 years 8 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
JIIS
2010
106views more  JIIS 2010»
14 years 4 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...