Iiro Kumpulainen

According to our database, Iiro Kumpulainen authored at least 9 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards.

Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt

CoRR, June, 2025

From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs.

Iiro Kumpulainen, Sebastian Dalleiger, Jilles Vreeken, Nikolaj Tatti

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Dense subgraphs induced by edge labels.

Iiro Kumpulainen, Nikolaj Tatti

Mach. Learn., April, 2024

Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs.

Florian Adriaens, Iiro Kumpulainen, Nikolaj Tatti

CoRR, 2024

Max-Min Diversification with Asymmetric Distances.

Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Dense Subgraph Discovery Meets Strong Triadic Closure.

Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023

Finding Coherent Node Groups in Directed Graphs.

Iiro Kumpulainen, Nikolaj Tatti

Proceedings of the Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2023

2022

Community Detection in Edge-Labeled Graphs.

Iiro Kumpulainen, Nikolaj Tatti

Proceedings of the Discovery Science - 25th International Conference, 2022

2021

BERT-fused Model for Finnish-Swedish Translation.

Iiro Kumpulainen, Jouko Vankka

Proceedings of the Eighth International Conference on Social Network Analysis, 2021