72 citations · 760 across the 54 of their papers we have counts for
5 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…
Jaccard-constrained dense subgraph discovery
Chamalee Wickrama Arachchi, Nikolaj Tatti
Finding dense subgraphs is a core problem in graph mining with many applications in diverse domains. At the same time many real-world networks vary over time, that is, the dataset…
Finding Favourite Tuples on Data Streams with Provably Few Comparisons
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
One of the most fundamental tasks in data science is to assist a user with unknown preferences in finding high-utility tuples within a large database. To accurately elicit the unkn…
Fast likelihood-based change point detection
Nikolaj Tatti
Change point detection plays a fundamental role in many real-world applications, where the goal is to analyze and monitor the behaviour of a data stream. In this paper, we study ch…
Ranking with submodular functions on the fly
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Maximizing submodular functions have been studied extensively for a wide range of subset-selection problems. However, much less attention has been given to the role of submodularit…