47 citations · 100 across the 13 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
On Finding Similar Items in a Stream of Transactions
Andrea Campagna, Rasmus Pagh
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similari…
cs.DS2010
On Finding Frequent Patterns in Event Sequences
Andrea Campagna, Rasmus Pagh
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some maximum le…