Sciweavers

10146 search results - page 320 / 2030
» Fast FAST
Sort
View
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 5 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 5 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2005
ACM
141views Data Mining» more  KDD 2005»
16 years 5 months ago
Fast window correlations over uncooperative time series
Richard Cole, Dennis Shasha, Xiaojian Zhao
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 5 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer