Nikolaj Tatti

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 103

Top Venues

CoRR

Data Min. Knowl. Discov.

SDM

KDD

Publications

Chamalee Wickrama Arachchi, Nikolaj Tatti
Recurrent segmentation meets block models in temporal networks. Mach. Learn. 113 (8) (2024)
Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti
Dense Subgraph Discovery Meets Strong Triadic Closure. KDD (2024)
Chamalee Wickrama Arachchi, Nikolaj Tatti
Jaccard-constrained dense subgraph discovery. Mach. Learn. 113 (9) (2024)
Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
Max-Min Diversification with Asymmetric Distances. KDD (2024)
Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti
Multilayer Correlation Clustering. CoRR (2024)
Iiro Kumpulainen, Nikolaj Tatti
Dense subgraphs induced by edge labels. Mach. Learn. 113 (4) (2024)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Finding Favourite Tuples on Data Streams with Provably Few Comparisons. CoRR (2023)
Chamalee Wickrama Arachchi, Nikolaj Tatti
Node ranking in labeled networks. SDM (2023)
Nikolaj Tatti
Fast likelihood-based change point detection. CoRR (2023)
Nikolaj Tatti
Fast computation of distance-generalized cores using sampling. Knowl. Inf. Syst. 65 (6) (2023)
Chamalee Wickrama Arachchi, Nikolaj Tatti
Jaccard-constrained dense subgraph discovery. CoRR (2023)
Iiro Kumpulainen, Nikolaj Tatti
Finding coherent node groups in directed graphs. CoRR (2023)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Ranking with submodular functions on the fly. SDM (2023)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Finding Favourite Tuples on Data Streams with Provably Few Comparisons. KDD (2023)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Ranking with submodular functions on the fly. CoRR (2023)
Nikolaj Tatti
Column-coherent matrix decomposition. Data Min. Knowl. Discov. 37 (6) (2023)
Chamalee Wickrama Arachchi, Nikolaj Tatti
Jaccard-Constrained Dense Subgraph Discovery. DS (2023)
Iiro Kumpulainen, Nikolaj Tatti
Community Detection in Edge-Labeled Graphs. DS (2022)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Ranking with submodular functions on a budget. CoRR (2022)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Ranking with submodular functions on a budget. Data Min. Knowl. Discov. 36 (3) (2022)
Iiro Kumpulainen, Nikolaj Tatti
Community detection in edge-labeled graphs. CoRR (2022)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Coresets remembered and items forgotten: submodular maximization with deletions. ICDM (2022)
Nikolaj Tatti
Maintaining AUC and H-measure over time. Mach. Learn. 111 (8) (2022)
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
Optimal deletion-robust coreset for submodular maximization. CoRR (2022)
Chamalee Wickrama Arachchi, Nikolaj Tatti
Recurrent Segmentation Meets Block Models in Temporal Networks. DS (2022)
Chamalee Wickrama Arachchi, Nikolaj Tatti
Recurrent segmentation meets block models in temporal networks. CoRR (2022)
Nikolaj Tatti
Fast computation of distance-generalized cores using sampling. CoRR (2021)
Nikolaj Tatti
Maintaining AUC and H-measure over time. CoRR (2021)
Nikolaj Tatti
Approximation Algorithms for Confidence Bands for Time Series. ECML/PKDD (1) (2021)
Nikolaj Tatti
Fast computation of distance-generalized cores using sampling. ICDM (2021)
Nikolaj Tatti
Approximation algorithms for confidence bands for time series. CoRR (2021)
Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
The network-untangling problem: from interactions to activity timelines. Data Min. Knowl. Discov. 35 (1) (2021)
Nikolaj Tatti, Hannes Heikinheimo
Decomposable Families of Itemsets. CoRR (2020)
Sami Hanhijärvi, Markus Ojala, Niko Vuokko, Kai Puolamäki, Nikolaj Tatti, Heikki Mannila
Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Mining. CoRR (2020)
Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti
Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. 62 (4) (2020)
Nikolaj Tatti, Boris Cule
Mining Closed Strict Episodes. CoRR (2019)
Nikolaj Tatti
Fast Likelihood-Based Change Point Detection. ECML/PKDD (1) (2019)
Nikolaj Tatti
Strongly polynomial efficient approximation scheme for segmentation. Inf. Process. Lett. 142 (2019)
Nikolaj Tatti
Faster way to agony: Discovering hierarchies in directed graphs. CoRR (2019)
Nikolaj Tatti
Distances between Data Sets Based on Summary Statistics. CoRR (2019)
Nikolaj Tatti, Aristides Gionis
Density-friendly Graph Decomposition. CoRR (2019)
Nikolaj Tatti
Discovering Bands from Graphs. CoRR (2019)
Michael Mampaey, Jilles Vreeken, Nikolaj Tatti
Summarizing Data Succinctly with the Most Informative Itemsets. CoRR (2019)
Nikolaj Tatti
Maximum Entropy Based Significance of Itemsets. CoRR (2019)
Nikolaj Tatti
Itemsets for Real-valued Datasets. CoRR (2019)
Nikolaj Tatti
Fast Sequence Segmentation using Log-Linear Models. CoRR (2019)
Nikolaj Tatti, Fabian Moerchen
Finding Robust Itemsets Under Subsampling. CoRR (2019)
Nikolaj Tatti
Significance of Episodes Based on Minimal Windows. CoRR (2019)
Nikolaj Tatti, Pauli Miettinen
Boolean matrix factorization meets consecutive ones property. CoRR (2019)
Nikolaj Tatti
Computational Complexity of Queries Based on Itemsets. CoRR (2019)
Nikolaj Tatti
Efficient estimation of AUC in a sliding window. CoRR (2019)
Nikolaj Tatti
Hierarchies in directed networks. CoRR (2019)
Nikolaj Tatti, Jilles Vreeken
Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles. CoRR (2019)
Nikolaj Tatti, Jilles Vreeken
Comparing Apples and Oranges: Measuring Differences between Data Mining Results. CoRR (2019)
Nikolaj Tatti
Density-Friendly Graph Decomposition. ACM Trans. Knowl. Discov. Data 13 (5) (2019)
Nikolaj Tatti
Safe projections of binary data sets. CoRR (2019)
Nikolaj Tatti, Jilles Vreeken
The Long and the Short of It: Summarising Event Sequences with Serial Episodes. CoRR (2019)
Nikolaj Tatti
Are your Items in Order? CoRR (2019)
Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
Inferring the strength of social ties: a community-driven approach. CoRR (2019)
Nikolaj Tatti
Discovering Episodes with Compact Minimal Windows. CoRR (2019)
Nikolaj Tatti, Pauli Miettinen
Boolean matrix factorization meets consecutive ones property. SDM (2019)
Nikolaj Tatti, Aristides Gionis
Discovering Nested Communities. CoRR (2019)
Nikolaj Tatti
Dynamic hierarchies in temporal directed networks. CoRR (2019)
Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila
What is the dimension of your binary data? CoRR (2019)
Nikolaj Tatti, Jilles Vreeken
Finding Good Itemsets by Packing Data. CoRR (2019)
Nikolaj Tatti, Michael Mampaey
Using Background Knowledge to Rank Itemsets. CoRR (2019)
Nikolaj Tatti
Ranking Episodes using a Partition Model. CoRR (2019)
Nikolaj Tatti, Boris Cule
Mining Closed Episodes with Simultaneous Events. CoRR (2019)
Nikolaj Tatti
Probably the Best Itemsets. CoRR (2019)
Nikolaj Tatti
Discovering bursts revisited: guaranteed optimization of the model parameters. CoRR (2019)
Hao Wu, Maoyuan Sun, Peng Mi, Nikolaj Tatti, Chris North, Naren Ramakrishnan
Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models. ACM Trans. Knowl. Discov. Data 12 (1) (2018)
Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
Reconstructing a cascade from temporal observations. CoRR (2018)
Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
Reconstructing a cascade from temporal observations. SDM (2018)
Nikolaj Tatti
Strongly polynomial efficient approximation scheme for segmentation. CoRR (2018)
Nikolaj Tatti
Dynamic Hierarchies in Temporal Directed Networks. ECML/PKDD (2) (2018)
Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti
Finding events in temporal networks: Segmentation meets densest-subgraph discovery. CoRR (2018)
Hao Wu, Yue Ning, Prithwish Chakraborty, Jilles Vreeken, Nikolaj Tatti, Naren Ramakrishnan
Generating Realistic Synthetic Population Datasets. ACM Trans. Knowl. Discov. Data 12 (4) (2018)
Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti
Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery. ICDM (2018)
Nikolaj Tatti
Efficient Estimation of AUC in a Sliding Window. ECML/PKDD (1) (2018)
Esther Galbrun, Peggy Cellier, Nikolaj Tatti, Alexandre Termier, Bruno Crémilleux
Mining Periodic Patterns with a MDL Criterion. ECML/PKDD (2) (2018)
Esther Galbrun, Peggy Cellier, Nikolaj Tatti, Alexandre Termier, Bruno Crémilleux
Mining Periodic Patterns with a MDL Criterion. CoRR (2018)
Orestis Kostakis, Nikolaj Tatti, Aristides Gionis
Discovering recurring activity in temporal networks. Data Min. Knowl. Discov. 31 (6) (2017)
Nikolaj Tatti
Discovering bursts revisited: guaranteed optimization of the model parameters. SDM (2017)
Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
Balancing information exposure in social networks. NIPS (2017)
Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi
Community-aware network sparsification. CoRR (2017)
Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
The Network-Untangling Problem: From Interactions to Activity Timelines. ECML/PKDD (1) (2017)
Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
Balancing Information Exposure in Social Networks. CoRR (2017)
Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi
Community-aware network sparsification. SDM (2017)
Nikolaj Tatti
Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks. Data Min. Knowl. Discov. 31 (3) (2017)
Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
Inferring the Strength of Social Ties: A Community-Driven Approach. KDD (2017)
Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
Finding Dynamic Dense Subgraphs. ACM Trans. Knowl. Discov. Data 11 (3) (2017)
Hao Wu, Yue Ning, Prithwish Chakraborty, Jilles Vreeken, Nikolaj Tatti, Naren Ramakrishnan
Generating Realistic Synthetic Population Datasets. CoRR (2016)
Hao Wu, Maoyuan Sun, Jilles Vreeken, Nikolaj Tatti, Chris North, Naren Ramakrishnan
Interactive and Iterative Discovery of Entity Network Subgraphs. CoRR (2016)
Indre Zliobaite, Nikolaj Tatti
A note on adjusting $R^2$ for using with cross-validation. CoRR (2016)
François Petitjean, Tao Li, Nikolaj Tatti, Geoffrey I. Webb
Skopus: Mining top-k sequential patterns under leverage. Data Min. Knowl. Discov. 30 (5) (2016)
Albert Arockiasamy, Aristides Gionis, Nikolaj Tatti
A Combinatorial Approach to Role Discovery. ICDM (2016)
Esther Galbrun, Aristides Gionis, Nikolaj Tatti
Top-k overlapping densest subgraphs. Data Min. Knowl. Discov. 30 (5) (2016)
Eric Malmi, Nikolaj Tatti, Aristides Gionis
Beyond rankings: comparing directed acyclic graphs. Data Min. Knowl. Discov. 29 (5) (2015)
Nikolaj Tatti, Aristides Gionis
Density-friendly Graph Decomposition. WWW (2015)
Nikolaj Tatti
Ranking episodes using a partition model. Data Min. Knowl. Discov. 29 (5) (2015)

Nikolaj Tatti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nikolaj Tatti