Nikolaj Tatti

Available identifiers

Publication	Date of Publication	Type
Column-coherent matrix decomposition	2023-11-15	Paper
Maintaining AUC and \(H\)-measure over time	2022-11-28	Paper
Ranking with submodular functions on a budget	2022-06-20	Paper
Finding Robust Itemsets under Subsampling	2021-11-25	Paper
The network-untangling problem: from interactions to activity timelines	2021-03-26	Paper
MARBLES: Mining association rules buried in long event sequences	2020-10-14	Paper
Discovering recurring activity in temporal networks	2019-05-03	Paper
Skopus: mining top-\(k\) sequential patterns under leverage	2019-05-03	Paper
Top-\(k\) overlapping densest subgraphs	2019-05-03	Paper
Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks	2019-05-03	Paper
Beyond rankings: comparing directed acyclic graphs	2019-01-29	Paper
Ranking episodes using a partition model	2019-01-29	Paper
Strongly polynomial efficient approximation scheme for segmentation	2018-12-05	Paper
Discovering bands from graphs	2016-08-04	Paper
Interesting Patterns	2014-11-12	Paper
Discovering episodes with compact minimal windows	2014-11-07	Paper
Fast sequence segmentation using log-linear models	2014-02-19	Paper
Mining closed strict episodes	2013-03-28	Paper
Comparing apples and oranges: measuring differences between exploratory data mining results	2013-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q3174070	2011-10-12	Paper
Computational complexity of queries based on itemsets	2010-01-18	Paper
Safe projections of binary data sets	2006-05-26	Paper

This page was built for person: Nikolaj Tatti