1217 search results - page 52 / 244 » On compressing frequent patterns |
151
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
150
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
233
Voted
PODS
2009
ACM
16 years 4 months ago
2009
ACM
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
154
Voted
TKDE
2008
15 years 3 months ago
2008
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...
113
Voted
KDD
2003
ACM
16 years 4 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...