b'Nikolaj Tatti'

research

∙ 08/30/2023

Jaccard-constrained dense subgraph discovery

Finding dense subgraphs is a core problem in graph mining with many appl...

0 {Chamalee Wickrama Arachchi, et al. ∙

research

∙ 07/06/2023

Finding Favourite Tuples on Data Streams with Provably Few Comparisons

One of the most fundamental tasks in data science is to assist a user wi...

0 Guangyi Zhang, et al. ∙

research

∙ 01/21/2023

Fast likelihood-based change point detection

Change point detection plays a fundamental role in many real-world appli...

0 Nikolaj Tatti, et al. ∙

research

∙ 01/17/2023

Ranking with submodular functions on the fly

Maximizing submodular functions have been studied extensively for a wide...

0 Guangyi Zhang, et al. ∙

research

∙ 10/19/2022

Community detection in edge-labeled graphs

Finding dense communities in networks is a widely-used tool for analysis...

0 Iiro Kumpulainen, et al. ∙

research

∙ 05/19/2022

Recurrent segmentation meets block models in temporal networks

A popular approach to model interactions is to represent them as a netwo...

0 {Chamalee Wickrama Arachchi, et al. ∙

research

∙ 04/08/2022

Ranking with submodular functions on a budget

Submodular maximization has been the backbone of many important machine-...

0 Guangyi Zhang, et al. ∙

research

∙ 03/02/2022

Optimal deletion-robust coreset for submodular maximization

In recent years we have witnessed an increase on the development of meth...

0 Guangyi Zhang, et al. ∙

research

∙ 12/12/2021

Approximation algorithms for confidence bands for time series

Confidence intervals are a standard technique for analyzing data. When a...

0 Nikolaj Tatti, et al. ∙

research

∙ 12/12/2021

Maintaining AUC and H-measure over time

Measuring the performance of a classifier is a vital task in machine lea...

0 Nikolaj Tatti, et al. ∙

research

∙ 12/12/2021

Fast computation of distance-generalized cores using sampling

Core decomposition is a classic technique for discovering densely connec...

0 Nikolaj Tatti, et al. ∙

research

∙ 06/16/2020

Decomposable Families of Itemsets

The problem of selecting a small, yet high quality subset of patterns fr...

0 Nikolaj Tatti, et al. ∙

research

∙ 06/16/2020

Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Mining

There is a wide variety of data mining methods available, and it is gene...

0 Sami Hanhijärvi, et al. ∙

research

∙ 04/25/2019

Summarizing Data Succinctly with the Most Informative Itemsets

Knowledge discovery from data is an inherently iterative process. That i...

0 Michael Mampaey, et al. ∙

research

∙ 04/25/2019

Tell Me What I Need to Know: Succinctly Summarizing Data with Itemsets

Data analysis is an inherently iterative process. That is, what we know ...

0 Michael Mampaey, et al. ∙

research

∙ 04/24/2019

Maximum Entropy Based Significance of Itemsets

We consider the problem of defining the significance of an itemset. We s...

0 Nikolaj Tatti, et al. ∙

research

∙ 04/16/2019

Mining Closed Episodes with Simultaneous Events

Sequential pattern discovery is a well-studied field in data mining. Epi...

0 Nikolaj Tatti, et al. ∙

research

∙ 04/15/2019

Discovering Episodes with Compact Minimal Windows

Discovering the most interesting patterns is the key problem in the fiel...

0 Nikolaj Tatti, et al. ∙

research

∙ 04/14/2019

Mining Closed Strict Episodes

Discovering patterns in a sequence is an important aspect of data mining...

0 Nikolaj Tatti, et al. ∙

research

∙ 04/09/2019

Discovering Bands from Graphs

Discovering the underlying structure of a given graph is one of the fund...

0 Nikolaj Tatti, et al. ∙

research

∙ 04/06/2019

Density-friendly Graph Decomposition

Decomposing a graph into a hierarchical structure via k-core analysis is...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/18/2019

Comparing Apples and Oranges: Measuring Differences between Exploratory Data Mining Results

Deciding whether the results of two different mining algorithms provide ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/18/2019

Comparing Apples and Oranges: Measuring Differences between Data Mining Results

Deciding whether the results of two different mining algorithms provide ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/18/2019

Finding Robust Itemsets Under Subsampling

Mining frequent patterns is plagued by the problem of pattern explosion ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/08/2019

Fast Sequence Segmentation using Log-Linear Models

Sequence segmentation is a well-studied problem, where given a sequence ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/08/2019

Using Background Knowledge to Rank Itemsets

Assessing the quality of discovered results is an important open problem...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/08/2019

Are your Items in Order?

Items in many datasets can be arranged to a natural order. Such orders a...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/07/2019

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles

When analysing binary data, the ease at which one can interpret results ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/07/2019

The Long and the Short of It: Summarising Event Sequences with Serial Episodes

An ideal outcome of pattern mining is a small set of informative pattern...

6 Nikolaj Tatti, et al. ∙

research

∙ 02/07/2019

Probably the Best Itemsets

One of the main current challenges in itemset mining is to discover a sm...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/07/2019

Significance of Episodes Based on Minimal Windows

Discovering episodes, frequent sets of events from a sequence has been a...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/06/2019

Finding Good Itemsets by Packing Data

The problem of selecting small groups of itemsets that represent the dat...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/05/2019

Dynamic hierarchies in temporal directed networks

The outcome of interactions in many real-world systems can be often expl...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/05/2019

Inferring the strength of social ties: a community-driven approach

Online social networks are growing and becoming denser. The social conne...

0 Polina Rozenshtein, et al. ∙

research

∙ 02/05/2019

Hierarchies in directed networks

Interactions in many real-world phenomena can be explained by a strong h...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/05/2019

Discovering bursts revisited: guaranteed optimization of the model parameters

One of the classic data mining tasks is to discover bursts, time interva...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

Discovering Nested Communities

Finding communities in graphs is one of the most well-studied problems i...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

What is the dimension of your binary data?

Many 0/1 datasets have a very large number of variables; on the other ha...

24 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

Faster way to agony: Discovering hierarchies in directed graphs

Many real-world phenomena exhibit strong hierarchical structure. Consequ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

Distances between Data Sets Based on Summary Statistics

The concepts of similarity and distance are crucial in data mining. We c...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

Safe projections of binary data sets

Selectivity estimation of a boolean query based on frequent itemsets can...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

Ranking Episodes using a Partition Model

One of the biggest setbacks in traditional frequent pattern mining is th...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/02/2019

Itemsets for Real-valued Datasets

Pattern mining is one of the most well-studied subfields in exploratory ...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/02/2019

Computational Complexity of Queries Based on Itemsets

We investigate determining the exact bounds of the frequencies of conjun...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/02/2019

Efficient estimation of AUC in a sliding window

In many applications, monitoring area under the ROC curve (AUC) in a sli...

0 Nikolaj Tatti, et al. ∙

research

∙ 01/17/2019

Boolean matrix factorization meets consecutive ones property

Boolean matrix factorization is a natural and a popular technique for su...

0 Nikolaj Tatti, et al. ∙

research

∙ 08/28/2018

Finding events in temporal networks: Segmentation meets densest-subgraph discovery

In this paper we study the problem of discovering a timeline of events i...

0 Polina Rozenshtein, et al. ∙

research

∙ 07/04/2018

Mining Periodic Patterns with a MDL Criterion

The quantity of event logs available is increasing rapidly, be they prod...

0 Esther Galbrun, et al. ∙

research

∙ 05/28/2018

Strongly polynomial efficient approximation scheme for segmentation

Partitioning a sequence of length n into k coherent segments is one of t...

0 Nikolaj Tatti, et al. ∙

research

∙ 05/05/2016

A note on adjusting R^2 for using with cross-validation

We show how to adjust the coefficient of determination (R^2) when used f...

0 Indre Zliobaite, et al. ∙

Nikolaj Tatti

Featured Co-authors