Nikolaj Tatti - RankMe

164 papers A* 24A 11B 3Journal 104Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximating splits for decision trees quickly in sparse data streams. CoRR Nikolaj Tatti
2026	—	`ed.`	Proceedings of the Annual Doctoral Symposium of Computer Science 2025, TKTP 2025, Helsinki, Finland, June, 2025. TKTP Nikolaj Tatti, Jussi Kasurinen, Tero Päivärinta
2026	J	`jnl`	Simple 2-approximations for bad triangle transversals and some hardness results for related problems. CoRR Florian Adriaens, Nikolaj Tatti
2025	A	`conf`	Approximating splits for decision trees quickly in sparse data streams. SDM Nikolaj Tatti
2025	J	`jnl`	Dense Subgraph Discovery Meets Strong Triadic Closure. CoRR Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti
2025	—	`conf`	Fair Diversity Maximization with Few Representatives. KDD (2) Florian Adriaens, Nikolaj Tatti
2025	J	`jnl`	Fair Diversity Maximization with Few Representatives. CoRR Florian Adriaens, Nikolaj Tatti
2025	J	`jnl`	Fair densest subgraph across multiple graphs. CoRR Chamalee Wickrama Arachchi, Nikolaj Tatti
2025	A*	`conf`	From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs. AAAI Iiro Kumpulainen, Sebastian Dalleiger, Jilles Vreeken, Nikolaj Tatti
2025	J	`jnl`	Max-Min Diversification with Asymmetric Distances. CoRR Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
2025	J	`jnl`	Node ranking in labeled networks. CoRR Chamalee Wickrama Arachchi, Nikolaj Tatti
2025	A	`conf`	SpeedSteiner: A Fast CIKM Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2025	—	`conf`	The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards. ECML/PKDD (3) Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt
2025	J	`jnl`	The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. CoRR Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt
2024	A*	`conf`	Dense Subgraph Discovery Meets Strong Triadic Closure. KDD Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti
2024	J	`jnl`	Dense subgraphs induced by edge labels. Mach. Learn. Iiro Kumpulainen, Nikolaj Tatti
2024	J	`jnl`	Explainable decomposition of nested dense subgraphs. Data Min. Knowl. Discov. Nikolaj Tatti
2024	—	`conf`	Fair Densest Subgraph Across Multiple Graphs. ECML/PKDD (5) Chamalee Wickrama Arachchi, Nikolaj Tatti
2024	J	`jnl`	From your Block to our Block: How to Find Shared Structure between Stochastic Block Models over Multiple Graphs. CoRR Iiro Kumpulainen, Sebastian Dalleiger, Jilles Vreeken, Nikolaj Tatti
2024	J	`jnl`	Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs. CoRR Florian Adriaens, Iiro Kumpulainen, Nikolaj Tatti
2024	J	`jnl`	Jaccard-constrained dense subgraph discovery. Mach. Learn. Chamalee Wickrama Arachchi, Nikolaj Tatti
2024	A*	`conf`	Max-Min Diversification with Asymmetric Distances. KDD Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
2024	J	`jnl`	Multilayer Correlation Clustering. CoRR Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti
2024	J	`jnl`	Recurrent segmentation meets block models in temporal networks. Mach. Learn. Chamalee Wickrama Arachchi, Nikolaj Tatti
2023	J	`jnl`	Column-coherent matrix decomposition. Data Min. Knowl. Discov. Nikolaj Tatti
2023	J	`jnl`	Fast computation of distance-generalized cores using sampling. Knowl. Inf. Syst. Nikolaj Tatti
2023	J	`jnl`	Fast likelihood-based change point detection. CoRR Nikolaj Tatti
2023	—	`conf`	Finding Coherent Node Groups in Directed Graphs. PKDD/ECML Workshops (3) Iiro Kumpulainen, Nikolaj Tatti
2023	A*	`conf`	Finding Favourite Tuples on Data Streams with Provably Few Comparisons. KDD Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2023	J	`jnl`	Finding Favourite Tuples on Data Streams with Provably Few Comparisons. CoRR Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2023	J	`jnl`	Finding coherent node groups in directed graphs. CoRR Iiro Kumpulainen, Nikolaj Tatti
2023	B	`conf`	Jaccard-Constrained Dense Subgraph Discovery. DS Chamalee Wickrama Arachchi, Nikolaj Tatti
2023	J	`jnl`	Jaccard-constrained dense subgraph discovery. CoRR Chamalee Wickrama Arachchi, Nikolaj Tatti
2023	A	`conf`	Node ranking in labeled networks. SDM Chamalee Wickrama Arachchi, Nikolaj Tatti
2023	A	`conf`	Ranking with submodular functions on the fly. SDM Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2023	J	`jnl`	Ranking with submodular functions on the fly. CoRR Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2022	B	`conf`	Community Detection in Edge-Labeled Graphs. DS Iiro Kumpulainen, Nikolaj Tatti
2022	J	`jnl`	Community detection in edge-labeled graphs. CoRR Iiro Kumpulainen, Nikolaj Tatti
2022	A*	`conf`	Coresets remembered and items forgotten: submodular maximization with deletions. ICDM Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2022	J	`jnl`	Maintaining AUC and H-measure over time. Mach. Learn. Nikolaj Tatti
2022	J	`jnl`	Optimal deletion-robust coreset for submodular maximization. CoRR Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2022	J	`jnl`	Ranking with submodular functions on a budget. CoRR Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2022	J	`jnl`	Ranking with submodular functions on a budget. Data Min. Knowl. Discov. Guangyi Zhang, Nikolaj Tatti, Aristides Gionis
2022	B	`conf`	Recurrent Segmentation Meets Block Models in Temporal Networks. DS Chamalee Wickrama Arachchi, Nikolaj Tatti
2022	J	`jnl`	Recurrent segmentation meets block models in temporal networks. CoRR Chamalee Wickrama Arachchi, Nikolaj Tatti
2021	—	`conf`	Approximation Algorithms for Confidence Bands for Time Series. ECML/PKDD (1) Nikolaj Tatti
2021	J	`jnl`	Approximation algorithms for confidence bands for time series. CoRR Nikolaj Tatti
2021	A*	`conf`	Fast computation of distance-generalized cores using sampling. ICDM Nikolaj Tatti
2021	J	`jnl`	Fast computation of distance-generalized cores using sampling. CoRR Nikolaj Tatti
2021	J	`jnl`	Maintaining AUC and H-measure over time. CoRR Nikolaj Tatti
2021	J	`jnl`	The network-untangling problem: from interactions to activity timelines. Data Min. Knowl. Discov. Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2020	J	`jnl`	Decomposable Families of Itemsets. CoRR Nikolaj Tatti, Hannes Heikinheimo
2020	J	`jnl`	Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti
2020	J	`jnl`	Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Mining. CoRR Sami Hanhijärvi, Markus Ojala, Niko Vuokko, Kai Puolamäki, Nikolaj Tatti, Heikki Mannila
2019	J	`jnl`	Are your Items in Order? CoRR Nikolaj Tatti
2019	A	`conf`	Boolean matrix factorization meets consecutive ones property. SDM Nikolaj Tatti, Pauli Miettinen
2019	J	`jnl`	Boolean matrix factorization meets consecutive ones property. CoRR Nikolaj Tatti, Pauli Miettinen
2019	J	`jnl`	Comparing Apples and Oranges: Measuring Differences between Data Mining Results. CoRR Nikolaj Tatti, Jilles Vreeken
2019	J	`jnl`	Computational Complexity of Queries Based on Itemsets. CoRR Nikolaj Tatti
2019	J	`jnl`	Density-Friendly Graph Decomposition. ACM Trans. Knowl. Discov. Data Nikolaj Tatti
2019	J	`jnl`	Density-friendly Graph Decomposition. CoRR Nikolaj Tatti, Aristides Gionis
2019	J	`jnl`	Discovering Bands from Graphs. CoRR Nikolaj Tatti
2019	J	`jnl`	Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles. CoRR Nikolaj Tatti, Jilles Vreeken
2019	J	`jnl`	Discovering Episodes with Compact Minimal Windows. CoRR Nikolaj Tatti
2019	J	`jnl`	Discovering Nested Communities. CoRR Nikolaj Tatti, Aristides Gionis
2019	J	`jnl`	Discovering bursts revisited: guaranteed optimization of the model parameters. CoRR Nikolaj Tatti
2019	J	`jnl`	Distances between Data Sets Based on Summary Statistics. CoRR Nikolaj Tatti
2019	J	`jnl`	Dynamic hierarchies in temporal directed networks. CoRR Nikolaj Tatti
2019	J	`jnl`	Efficient estimation of AUC in a sliding window. CoRR Nikolaj Tatti
2019	—	`conf`	Fast Likelihood-Based Change Point Detection. ECML/PKDD (1) Nikolaj Tatti
2019	J	`jnl`	Fast Sequence Segmentation using Log-Linear Models. CoRR Nikolaj Tatti
2019	J	`jnl`	Faster way to agony: Discovering hierarchies in directed graphs. CoRR Nikolaj Tatti
2019	J	`jnl`	Finding Good Itemsets by Packing Data. CoRR Nikolaj Tatti, Jilles Vreeken
2019	J	`jnl`	Finding Robust Itemsets Under Subsampling. CoRR Nikolaj Tatti, Fabian Moerchen
2019	J	`jnl`	Hierarchies in directed networks. CoRR Nikolaj Tatti
2019	J	`jnl`	Inferring the strength of social ties: a community-driven approach. CoRR Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2019	J	`jnl`	Itemsets for Real-valued Datasets. CoRR Nikolaj Tatti
2019	J	`jnl`	Maximum Entropy Based Significance of Itemsets. CoRR Nikolaj Tatti
2019	J	`jnl`	Mining Closed Episodes with Simultaneous Events. CoRR Nikolaj Tatti, Boris Cule
2019	J	`jnl`	Mining Closed Strict Episodes. CoRR Nikolaj Tatti, Boris Cule
2019	J	`jnl`	Probably the Best Itemsets. CoRR Nikolaj Tatti
2019	J	`jnl`	Ranking Episodes using a Partition Model. CoRR Nikolaj Tatti
2019	J	`jnl`	Safe projections of binary data sets. CoRR Nikolaj Tatti
2019	J	`jnl`	Significance of Episodes Based on Minimal Windows. CoRR Nikolaj Tatti
2019	J	`jnl`	Strongly polynomial efficient approximation scheme for segmentation. Inf. Process. Lett. Nikolaj Tatti
2019	J	`jnl`	Summarizing Data Succinctly with the Most Informative Itemsets. CoRR Michael Mampaey, Jilles Vreeken, Nikolaj Tatti
2019	J	`jnl`	The Long and the Short of It: Summarising Event Sequences with Serial Episodes. CoRR Nikolaj Tatti, Jilles Vreeken
2019	J	`jnl`	Using Background Knowledge to Rank Itemsets. CoRR Nikolaj Tatti, Michael Mampaey
2019	J	`jnl`	What is the dimension of your binary data? CoRR Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila
2018	—	`conf`	Dynamic Hierarchies in Temporal Directed Networks. ECML/PKDD (2) Nikolaj Tatti
2018	—	`conf`	Efficient Estimation of AUC in a Sliding Window. ECML/PKDD (1) Nikolaj Tatti
2018	A*	`conf`	Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery. ICDM Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti
2018	J	`jnl`	Finding events in temporal networks: Segmentation meets densest-subgraph discovery. CoRR Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti
2018	J	`jnl`	Generating Realistic Synthetic Population Datasets. ACM Trans. Knowl. Discov. Data Hao Wu, Yue Ning, Prithwish Chakraborty, Jilles Vreeken, Nikolaj Tatti, Naren Ramakrishnan
2018	J	`jnl`	Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models. ACM Trans. Knowl. Discov. Data Hao Wu, Maoyuan Sun, Peng Mi, Nikolaj Tatti, Chris North, Naren Ramakrishnan
2018	—	`conf`	Mining Periodic Patterns with a MDL Criterion. ECML/PKDD (2) Esther Galbrun, Peggy Cellier, Nikolaj Tatti, Alexandre Termier, Bruno Crémilleux
2018	J	`jnl`	Mining Periodic Patterns with a MDL Criterion. CoRR Esther Galbrun, Peggy Cellier, Nikolaj Tatti, Alexandre Termier, Bruno Crémilleux
2018	A	`conf`	Reconstructing a cascade from temporal observations. SDM Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2018	J	`jnl`	Reconstructing a cascade from temporal observations. CoRR Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2018	J	`jnl`	Strongly polynomial efficient approximation scheme for segmentation. CoRR Nikolaj Tatti
2017	J	`jnl`	Balancing Information Exposure in Social Networks. CoRR Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
2017	—	`conf`	Balancing information exposure in social networks. NIPS Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
2017	A	`conf`	Community-aware network sparsification. SDM Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi
2017	J	`jnl`	Community-aware network sparsification. CoRR Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi
2017	A	`conf`	Discovering bursts revisited: guaranteed optimization of the model parameters. SDM Nikolaj Tatti
2017	J	`jnl`	Discovering recurring activity in temporal networks. Data Min. Knowl. Discov. Orestis Kostakis, Nikolaj Tatti, Aristides Gionis
2017	J	`jnl`	Finding Dynamic Dense Subgraphs. ACM Trans. Knowl. Discov. Data Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2017	A*	`conf`	Inferring the Strength of Social Ties: A Community-Driven Approach. KDD Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2017	—	`conf`	The Network-Untangling Problem: From Interactions to Activity Timelines. ECML/PKDD (1) Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2017	J	`jnl`	Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks. Data Min. Knowl. Discov. Nikolaj Tatti
2016	A*	`conf`	A Combinatorial Approach to Role Discovery. ICDM Albert Arockiasamy, Aristides Gionis, Nikolaj Tatti
2016	J	`jnl`	A note on adjusting $R^2$ for using with cross-validation. CoRR Indre Zliobaite, Nikolaj Tatti
2016	J	`jnl`	Generating Realistic Synthetic Population Datasets. CoRR Hao Wu, Yue Ning, Prithwish Chakraborty, Jilles Vreeken, Nikolaj Tatti, Naren Ramakrishnan
2016	J	`jnl`	Interactive and Iterative Discovery of Entity Network Subgraphs. CoRR Hao Wu, Maoyuan Sun, Jilles Vreeken, Nikolaj Tatti, Chris North, Naren Ramakrishnan
2016	—	`ed.`	Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part III ECML/PKDD (3) Bettina Berendt, Björn Bringmann, Élisa Fromont, Gemma C. Garriga, Pauli Miettinen, Nikolaj Tatti, Volker Tresp
2016	J	`jnl`	Skopus: Mining top-k sequential patterns under leverage. Data Min. Knowl. Discov. François Petitjean, Tao Li, Nikolaj Tatti, Geoffrey I. Webb
2016	J	`jnl`	Top-k overlapping densest subgraphs. Data Min. Knowl. Discov. Esther Galbrun, Aristides Gionis, Nikolaj Tatti
2015	J	`jnl`	Beyond rankings: comparing directed acyclic graphs. Data Min. Knowl. Discov. Eric Malmi, Nikolaj Tatti, Aristides Gionis
2015	A*	`conf`	Density-friendly Graph Decomposition. WWW Nikolaj Tatti, Aristides Gionis
2015	A*	`conf`	Hierarchies in Directed Networks. ICDM Nikolaj Tatti
2015	J	`jnl`	Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models. CoRR Hao Wu, Maoyuan Sun, Peng Mi, Nikolaj Tatti, Chris North, Naren Ramakrishnan
2015	—	`conf`	Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks. ECML/PKDD (2) Rohit Kumar, Toon Calders, Aristides Gionis, Nikolaj Tatti
2015	J	`jnl`	Ranking episodes using a partition model. Data Min. Knowl. Discov. Nikolaj Tatti
2014	J	`jnl`	A Panorama of Imminent Doctoral Research in Data Mining. SIGMOD Rec. Aparna S. Varde, Nikolaj Tatti
2014	—	`conf`	Discovering Dynamic Communities in Interaction Networks. ECML/PKDD (2) Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
2014	J	`jnl`	Discovering bands from graphs. Data Min. Knowl. Discov. Nikolaj Tatti
2014	J	`jnl`	Discovering episodes with compact minimal windows. Data Min. Knowl. Discov. Nikolaj Tatti
2014	A*	`conf`	Event detection in activity networks. KDD Polina Rozenshtein, Aris Anagnostopoulos, Aristides Gionis, Nikolaj Tatti
2014	—	`conf`	Faster Way to Agony - Discovering Hierarchies in Directed Graphs. ECML/PKDD (3) Nikolaj Tatti
2014	J	`jnl`	Finding Robust Itemsets under Subsampling. ACM Trans. Database Syst. Nikolaj Tatti, Fabian Moerchen, Toon Calders
2014	—	`ch.`	Interesting Patterns. Frequent Pattern Mining Jilles Vreeken, Nikolaj Tatti
2014	J	`jnl`	MARBLES: Mining association rules buried in long event sequences. Stat. Anal. Data Min. Boris Cule, Nikolaj Tatti, Bart Goethals
2014	J	`jnl`	Overlapping community detection in labeled graphs. Data Min. Knowl. Discov. Esther Galbrun, Aristides Gionis, Nikolaj Tatti
2014	J	`jnl`	Uncovering the plot: detecting surprising coalitions of entities in multi-relational schemas. Data Min. Knowl. Discov. Hao Wu, Jilles Vreeken, Nikolaj Tatti, Naren Ramakrishnan
2013	—	`conf`	Discovering Nested Communities. ECML/PKDD (2) Nikolaj Tatti, Aristides Gionis
2013	J	`jnl`	Fast sequence segmentation using log-linear models. Data Min. Knowl. Discov. Nikolaj Tatti
2013	A*	`conf`	Itemsets for Real-Valued Datasets. ICDM Nikolaj Tatti
2013	A	`conf`	Mining Connection Pathways for Marked Nodes in Large Graphs. SDM Leman Akoglu, Duen Horng Chau, Christos Faloutsos, Nikolaj Tatti, Hanghang Tong, Jilles Vreeken
2012	J	`jnl`	Comparing apples and oranges: measuring differences between exploratory data mining results. Data Min. Knowl. Discov. Nikolaj Tatti, Jilles Vreeken
2012	—	`conf`	Discovering Descriptive Tile Trees - By Mining Optimal Geometric Subtiles. ECML/PKDD (1) Nikolaj Tatti, Jilles Vreeken
2012	A	`conf`	MARBLES: Mining Association Rules Buried in Long Event Sequences. SDM Boris Cule, Nikolaj Tatti, Bart Goethals
2012	J	`jnl`	Mining closed strict episodes. Data Min. Knowl. Discov. Nikolaj Tatti, Boris Cule
2012	J	`jnl`	Summarizing data succinctly with the most informative itemsets. ACM Trans. Knowl. Discov. Data Michael Mampaey, Jilles Vreeken, Nikolaj Tatti
2012	A*	`conf`	The long and the short of it: summarising event sequences with serial episodes. KDD Nikolaj Tatti, Jilles Vreeken
2011	A	`conf`	Are your Items in Order. SDM Nikolaj Tatti
2011	—	`conf`	Comparing Apples and Oranges - Measuring Differences between Data Mining Results. ECML/PKDD (3) Nikolaj Tatti, Jilles Vreeken
2011	A*	`conf`	Finding Robust Itemsets under Subsampling. ICDM Nikolaj Tatti, Fabian Moerchen
2011	A*	`conf`	Mining closed episodes with simultaneous events. KDD Nikolaj Tatti, Boris Cule
2011	A*	`conf`	Tell me what i need to know: succinctly summarizing data with itemsets. KDD Michael Mampaey, Nikolaj Tatti, Jilles Vreeken
2010	A*	`conf`	Mining Closed Strict Episodes. ICDM Nikolaj Tatti, Boris Cule
2010	A*	`conf`	Probably the best itemsets. KDD Nikolaj Tatti
2010	J	`jnl`	Useful patterns (UP'10) ACM SIGKDD workshop report. SIGKDD Explor. Jilles Vreeken, Nikolaj Tatti, Bart Goethals
2010	J	`jnl`	Using background knowledge to rank itemsets. Data Min. Knowl. Discov. Nikolaj Tatti, Michael Mampaey
2009	A*	`conf`	Significance of Episodes Based on Minimal Windows. ICDM Nikolaj Tatti
2009	A*	`conf`	Tell me something I don't know: randomization strategies for iterative data mining. KDD Sami Hanhijärvi, Markus Ojala, Niko Vuokko, Kai Puolamäki, Nikolaj Tatti, Heikki Mannila
2008	—	`—`	Advances in Mining Binary Data: Itemsets as Summaries. Nikolaj Tatti
2008	—	`conf`	Decomposable Families of Itemsets. ECML/PKDD (2) Nikolaj Tatti, Hannes Heikinheimo
2008	A*	`conf`	Finding Good Itemsets by Packing Data. ICDM Nikolaj Tatti, Jilles Vreeken
2008	J	`jnl`	Maximum entropy based significance of itemsets. Knowl. Inf. Syst. Nikolaj Tatti
2007	J	`jnl`	Distances between Data Sets Based on Summary Statistics. J. Mach. Learn. Res. Nikolaj Tatti
2007	A*	`conf`	Maximum Entropy Based Significance of Itemsets. ICDM Nikolaj Tatti
2006	J	`jnl`	Computational complexity of queries based on itemsets. Inf. Process. Lett. Nikolaj Tatti
2006	J	`jnl`	Safe projections of binary data sets. Acta Informatica Nikolaj Tatti
2006	A*	`conf`	What is the Dimension of Your Binary Data? ICDM Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila