72 citations · 760 across the 54 of their papers we have counts for
4 papers · 1 filter
Finding events in temporal networks: Segmentation meets densest-subgraph discovery
Polina Rozenshtein, Francesco Bonchi, Aristides Gionis +2
In this paper we study the problem of discovering a timeline of events in a temporal network. We model events as dense subgraphs that occur within intervals of network activity. We…
Mining Periodic Patterns with a MDL Criterion
Esther Galbrun, Peggy Cellier, Nikolaj Tatti +2
The quantity of event logs available is increasing rapidly, be they produced by industrial processes, computing systems, or life tracking, for instance. It is thus important to des…
Strongly polynomial efficient approximation scheme for segmentation
Nikolaj Tatti
Partitioning a sequence of length into coherent segments (Seg) is one of the classic optimization problems. As long as the optimization criterion is additive, Seg can be so…
Reconstructing a cascade from temporal observations
Han Xiao, Polina Rozenshtein, Nikolaj Tatti +1
Given a subset of active nodes in a network can we re- construct the cascade that has generated these observa- tions? This is a problem that has been studied in the literature, but…