72 citations · 760 across the 54 of their papers we have counts for
8 papers · 1 filter
Finding coherent node groups in directed graphs
Iiro Kumpulainen, Nikolaj Tatti
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the g…
Dense subgraphs induced by edge labels
Iiro Kumpulainen, Nikolaj Tatti
Finding densely connected groups of nodes in networks is a widely used tool for analysis in graph mining. A popular choice for finding such groups is to find subgraphs with a high…
Recurrent segmentation meets block models in temporal networks
Chamalee Wickrama Arachchi, Nikolaj Tatti
A popular approach to model interactions is to represent them as a network with nodes being the agents and the interactions being the edges. Interactions are often timestamped, whi…
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…
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…
Balancing Information Exposure in Social Networks
Kiran Garimella, Aristides Gionis, Nikos Parotsidis +1
Social media has brought a revolution on how people are consuming news. Beyond the undoubtedly large number of advantages brought by social-media platforms, a point of criticism ha…
Community-aware network sparsification
Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti +1
Network sparsification aims to reduce the number of edges of a network while maintaining its structural properties; such properties include shortest paths, cuts, spectral measures,…
Interactive and Iterative Discovery of Entity Network Subgraphs
Hao Wu, Maoyuan Sun, Jilles Vreeken +3
Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of…