Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
KDD
/
Paper
A fast algorithm for finding frequent episodes in event streams.
Srivatsan Laxman
,
P. S. Sastry
,
K. P. Unnikrishnan
Venue
A*
KDD
Year
2007
Proceedings
KDD
DBLP record
conf/kdd/LaxmanSU07 ↗
Browse the full
KDD paper archive
.