72 citations · 658 across the 45 of their papers we have counts for
4 papers · 1 filter
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…
Ranking with submodular functions on a budget
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Submodular maximization has been the backbone of many important machine-learning problems, and has applications to viral marketing, diversification, sensor placement, and more. How…
Coresets remembered and items forgotten: submodular maximization with deletions
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
In recent years we have witnessed an increase on the development of methods for submodular optimization, which have been motivated by the wide applicability of submodular functions…