What is the Dimension of Your Binary Data? - Nikolaj Tatti; Taneli Mielikäinen; Aristides Gionis; Heikki Mannila (ICDM, 2006)

Safe projections of binary data sets. - Nikolaj Tatti (Acta Informatica, 2006)

Computational complexity of queries based on itemsets. - Nikolaj Tatti (Inf. Process. Lett., 2006)

Distances between Data Sets Based on Summary Statistics. - Nikolaj Tatti (J. Mach. Learn. Res., 2007)

Finding Good Itemsets by Packing Data. - Nikolaj Tatti; Jilles Vreeken (ICDM, 2008)

Decomposable Families of Itemsets. - Nikolaj Tatti; Hannes Heikinheimo (ECML/PKDD (2), 2008)

Maximum entropy based significance of itemsets. - Nikolaj Tatti (Knowl. Inf. Syst., 2008)

Advances in Mining Binary Data: Itemsets as Summaries. - Nikolaj Tatti (2008)

Significance of Episodes Based on Minimal Windows. - Nikolaj Tatti (ICDM, 2009)

Tell me something I don't know: randomization strategies for iterative data mining. - Sami Hanhijärvi; Markus Ojala; Niko Vuokko; Kai Puolamäki; Nikolaj Tatti; Heikki Mannila (KDD, 2009)

Probably the best itemsets. - Nikolaj Tatti (KDD, 2010)

Using background knowledge to rank itemsets. - Nikolaj Tatti; Michael Mampaey (Data Min. Knowl. Discov., 2010)

Useful patterns (UP'10) ACM SIGKDD workshop report. - Jilles Vreeken; Nikolaj Tatti; Bart Goethals (SIGKDD Explor., 2010)

Finding Robust Itemsets under Subsampling. - Nikolaj Tatti; Fabian Moerchen (ICDM, 2011)

Tell me what i need to know: succinctly summarizing data with itemsets. - Michael Mampaey; Nikolaj Tatti; Jilles Vreeken (KDD, 2011)

Mining closed episodes with simultaneous events. - Nikolaj Tatti; Boris Cule (KDD, 2011)

Comparing Apples and Oranges - Measuring Differences between Data Mining Results. - Nikolaj Tatti; Jilles Vreeken (ECML/PKDD (3), 2011)

Are your Items in Order. - Nikolaj Tatti (SDM, 2011)

The long and the short of it: summarising event sequences with serial episodes. - Nikolaj Tatti; Jilles Vreeken (KDD, 2012)

Discovering Descriptive Tile Trees - By Mining Optimal Geometric Subtiles. - Nikolaj Tatti; Jilles Vreeken (ECML/PKDD (1), 2012)

Mining closed strict episodes. - Nikolaj Tatti; Boris Cule (Data Min. Knowl. Discov., 2012)

Comparing apples and oranges: measuring differences between exploratory data mining results. - Nikolaj Tatti; Jilles Vreeken (Data Min. Knowl. Discov., 2012)

Summarizing data succinctly with the most informative itemsets. - Michael Mampaey; Jilles Vreeken; Nikolaj Tatti (ACM Trans. Knowl. Discov. Data, 2012)

Itemsets for Real-Valued Datasets. - Nikolaj Tatti (ICDM, 2013)

Discovering Nested Communities. - Nikolaj Tatti; Aristides Gionis (ECML/PKDD (2), 2013)

Mining Connection Pathways for Marked Nodes in Large Graphs. - Leman Akoglu; Duen Horng Chau; Christos Faloutsos; Nikolaj Tatti; Hanghang Tong; Jilles Vreeken (SDM, 2013)

Fast sequence segmentation using log-linear models. - Nikolaj Tatti (Data Min. Knowl. Discov., 2013)

Interesting Patterns. - Jilles Vreeken; Nikolaj Tatti (Frequent Pattern Mining, 2014)

Event detection in activity networks. - Polina Rozenshtein; Aris Anagnostopoulos; Aristides Gionis; Nikolaj Tatti (KDD, 2014)

Discovering Dynamic Communities in Interaction Networks. - Polina Rozenshtein; Nikolaj Tatti; Aristides Gionis (ECML/PKDD (2), 2014)

Faster Way to Agony - Discovering Hierarchies in Directed Graphs. - Nikolaj Tatti (ECML/PKDD (3), 2014)

Overlapping community detection in labeled graphs. - Esther Galbrun; Aristides Gionis; Nikolaj Tatti (Data Min. Knowl. Discov., 2014)

Discovering episodes with compact minimal windows. - Nikolaj Tatti (Data Min. Knowl. Discov., 2014)

Discovering bands from graphs. - Nikolaj Tatti (Data Min. Knowl. Discov., 2014)

Uncovering the plot: detecting surprising coalitions of entities in multi-relational schemas. - Hao Wu 041; Jilles Vreeken; Nikolaj Tatti; Naren Ramakrishnan (Data Min. Knowl. Discov., 2014)

MARBLES: Mining association rules buried in long event sequences. - Boris Cule; Nikolaj Tatti; Bart Goethals (Stat. Anal. Data Min., 2014)

A Panorama of Imminent Doctoral Research in Data Mining. - Aparna S. Varde; Nikolaj Tatti (SIGMOD Rec., 2014)

Finding Robust Itemsets under Subsampling. - Nikolaj Tatti; Fabian Moerchen; Toon Calders (ACM Trans. Database Syst., 2014)

Hierarchies in Directed Networks. - Nikolaj Tatti (ICDM, 2015)

Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks. - Rohit Kumar 002; Toon Calders; Aristides Gionis; Nikolaj Tatti (ECML/PKDD (2), 2015)

Density-friendly Graph Decomposition. - Nikolaj Tatti; Aristides Gionis (WWW, 2015)

Beyond rankings: comparing directed acyclic graphs. - Eric Malmi; Nikolaj Tatti; Aristides Gionis (Data Min. Knowl. Discov., 2015)

Ranking episodes using a partition model. - Nikolaj Tatti (Data Min. Knowl. Discov., 2015)

A Combinatorial Approach to Role Discovery. - Albert Arockiasamy; Aristides Gionis; Nikolaj Tatti (ICDM, 2016)

Interactive and Iterative Discovery of Entity Network Subgraphs. - Hao Wu 041; Maoyuan Sun; Jilles Vreeken; Nikolaj Tatti; Chris North 001; Naren Ramakrishnan (CoRR, 2016)

A note on adjusting $R^2$ for using with cross-validation. - Indre Zliobaite; Nikolaj Tatti (CoRR, 2016)

Top-k overlapping densest subgraphs. - Esther Galbrun; Aristides Gionis; Nikolaj Tatti (Data Min. Knowl. Discov., 2016)

Skopus: Mining top-k sequential patterns under leverage. - François Petitjean; Tao Li; Nikolaj Tatti; Geoffrey I. Webb (Data Min. Knowl. Discov., 2016)

Inferring the Strength of Social Ties: A Community-Driven Approach. - Polina Rozenshtein; Nikolaj Tatti; Aristides Gionis (KDD, 2017)

Balancing information exposure in social networks. - Kiran Garimella; Aristides Gionis; Nikos Parotsidis; Nikolaj Tatti (NIPS, 2017)

Community-aware network sparsification. - Aristides Gionis; Polina Rozenshtein; Nikolaj Tatti; Evimaria Terzi (SDM, 2017)

Discovering bursts revisited: guaranteed optimization of the model parameters. - Nikolaj Tatti (SDM, 2017)

Discovering recurring activity in temporal networks. - Orestis Kostakis; Nikolaj Tatti; Aristides Gionis (Data Min. Knowl. Discov., 2017)

Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks. - Nikolaj Tatti (Data Min. Knowl. Discov., 2017)

Finding Dynamic Dense Subgraphs. - Polina Rozenshtein; Nikolaj Tatti; Aristides Gionis (ACM Trans. Knowl. Discov. Data, 2017)

Mining Periodic Patterns with a MDL Criterion. - Esther Galbrun; Peggy Cellier; Nikolaj Tatti; Alexandre Termier; Bruno Crémilleux (ECML/PKDD (2), 2018)

Efficient Estimation of AUC in a Sliding Window. - Nikolaj Tatti (ECML/PKDD (1), 2018)

Dynamic Hierarchies in Temporal Directed Networks. - Nikolaj Tatti (ECML/PKDD (2), 2018)

Reconstructing a cascade from temporal observations. - Han Xiao 009; Polina Rozenshtein; Nikolaj Tatti; Aristides Gionis (SDM, 2018)

Generating Realistic Synthetic Population Datasets. - Hao Wu 041; Yue Ning 001; Prithwish Chakraborty; Jilles Vreeken; Nikolaj Tatti; Naren Ramakrishnan (ACM Trans. Knowl. Discov. Data, 2018)

Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models. - Hao Wu 041; Maoyuan Sun; Peng Mi; Nikolaj Tatti; Chris North 001; Naren Ramakrishnan (ACM Trans. Knowl. Discov. Data, 2018)

Fast Likelihood-Based Change Point Detection. - Nikolaj Tatti (ECML/PKDD (1), 2019)

Boolean matrix factorization meets consecutive ones property. - Nikolaj Tatti; Pauli Miettinen (SDM, 2019)

Strongly polynomial efficient approximation scheme for segmentation. - Nikolaj Tatti (Inf. Process. Lett., 2019)

Density-Friendly Graph Decomposition. - Nikolaj Tatti (ACM Trans. Knowl. Discov. Data, 2019)

Finding events in temporal networks: segmentation meets densest subgraph discovery. - Polina Rozenshtein; Francesco Bonchi; Aristides Gionis; Mauro Sozio; Nikolaj Tatti (Knowl. Inf. Syst., 2020)

Approximation Algorithms for Confidence Bands for Time Series. - Nikolaj Tatti (ECML/PKDD (1), 2021)

The network-untangling problem: from interactions to activity timelines. - Polina Rozenshtein; Nikolaj Tatti; Aristides Gionis (Data Min. Knowl. Discov., 2021)

Community Detection in Edge-Labeled Graphs. - Iiro Kumpulainen; Nikolaj Tatti (DS, 2022)

Coresets remembered and items forgotten: submodular maximization with deletions. - Guangyi Zhang 001; Nikolaj Tatti; Aristides Gionis (ICDM, 2022)

Optimal deletion-robust coreset for submodular maximization. - Guangyi Zhang 001; Nikolaj Tatti; Aristides Gionis (CoRR, 2022)

Ranking with submodular functions on a budget. - Guangyi Zhang 001; Nikolaj Tatti; Aristides Gionis (Data Min. Knowl. Discov., 2022)

Maintaining AUC and H-measure over time. - Nikolaj Tatti (Mach. Learn., 2022)

Finding Favourite Tuples on Data Streams with Provably Few Comparisons. - Guangyi Zhang 001; Nikolaj Tatti; Aristides Gionis (KDD, 2023)

Finding Coherent Node Groups in Directed Graphs. - Iiro Kumpulainen; Nikolaj Tatti (PKDD/ECML Workshops (3), 2023)

Ranking with submodular functions on the fly. - Guangyi Zhang 001; Nikolaj Tatti; Aristides Gionis (SDM, 2023)

Node ranking in labeled networks. - Chamalee Wickrama Arachchi; Nikolaj Tatti (SDM, 2023)

Fast computation of distance-generalized cores using sampling. - Nikolaj Tatti (Knowl. Inf. Syst., 2023)

Column-coherent matrix decomposition. - Nikolaj Tatti (Data Min. Knowl. Discov., 2023)

Dense Subgraph Discovery Meets Strong Triadic Closure. - Chamalee Wickrama Arachchi; Iiro Kumpulainen; Nikolaj Tatti (KDD, 2024)

Max-Min Diversification with Asymmetric Distances. - Iiro Kumpulainen; Florian Adriaens; Nikolaj Tatti (KDD, 2024)

Fair Densest Subgraph Across Multiple Graphs. - Chamalee Wickrama Arachchi; Nikolaj Tatti (ECML/PKDD (5), 2024)

Multilayer Correlation Clustering. - Atsushi Miyauchi 001; Florian Adriaens; Francesco Bonchi; Nikolaj Tatti (CoRR, 2024)

Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs. - Florian Adriaens; Iiro Kumpulainen; Nikolaj Tatti (CoRR, 2024)

Dense subgraphs induced by edge labels. - Iiro Kumpulainen; Nikolaj Tatti (Mach. Learn., 2024)

Recurrent segmentation meets block models in temporal networks. - Chamalee Wickrama Arachchi; Nikolaj Tatti (Mach. Learn., 2024)

Jaccard-constrained dense subgraph discovery. - Chamalee Wickrama Arachchi; Nikolaj Tatti (Mach. Learn., 2024)

Explainable decomposition of nested dense subgraphs. - Nikolaj Tatti (Data Min. Knowl. Discov., 2024)

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 (AAAI, 2025)

Approximating splits for decision trees quickly in sparse data streams. - Nikolaj Tatti (SDM, 2025)

Fair Diversity Maximization with Few Representatives. - Florian Adriaens; Nikolaj Tatti (CoRR, 2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. - Vedangi Bengali; Nikolaj Tatti; Iiro Kumpulainen; Florian Adriaens; Nate Veldt (CoRR, 2025)