2 citations · 4 across the 11 of their papers we have counts for
6 papers · 2 filters
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen +2
We consider a generalization of the densest subhypergraph problem where nonnegative rewards are given for including partial hyperedges in a dense subhypergraph. Prior work addresse…
Fair Diversity Maximization with Few Representatives
Florian Adriaens, Nikolaj Tatti
Diversity maximization problem is a well-studied problem where the goal is to find diverse items. Fair diversity maximization aims to select a diverse subset of items from…
Max-Min Diversification with Asymmetric Distances
Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
One of the most well-known and simplest models for diversity maximization is the Max-Min Diversification (MMD) model, which has been extensively studied in the data mining and data…
Dense Subgraph Discovery Meets Strong Triadic Closure
Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti
Finding dense subgraphs is a core problem with numerous graph mining applications such as community detection in social networks and anomaly detection. However, in many real-world…
Node ranking in labeled networks
Chamalee Wickrama Arachchi, Nikolaj Tatti
The entities in directed networks arising from real-world interactions are often naturally organized under some hierarchical structure. Given a directed, weighted, graph with edges…
Fair densest subgraph across multiple graphs
Chamalee Wickrama Arachchi, Nikolaj Tatti
Many real-world networks can be modeled as graphs. Finding dense subgraphs is a key problem in graph mining with applications in diverse domains. In this paper, we consider two var…