pith. sign in

Nikolaj Tatti

Identifiers

  • name variant Nikolaj Tatti 0.60 · backfill

Papers (43)

  1. Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering cs.DS · 2026 · author #2 as printed: Nikolaj tatti
  2. Multilayer Correlation Clustering cs.DS · 2024 · author #4
  3. Summarizing Data Succinctly with the Most Informative Itemsets cs.DS · 2019 · author #3
  4. Maximum Entropy Based Significance of Itemsets cs.LG · 2019 · author #1
  5. Mining Closed Episodes with Simultaneous Events cs.DB · 2019 · author #1
  6. Discovering Episodes with Compact Minimal Windows cs.LG · 2019 · author #1
  7. Mining Closed Strict Episodes cs.DB · 2019 · author #1
  8. Discovering Bands from Graphs cs.DS · 2019 · author #1
  9. Comparing Apples and Oranges: Measuring Differences between Exploratory Data Mining Results cs.DB · 2019 · author #1
  10. Finding Robust Itemsets Under Subsampling cs.DB · 2019 · author #1
  11. Fast Sequence Segmentation using Log-Linear Models cs.DS · 2019 · author #1
  12. Using Background Knowledge to Rank Itemsets cs.LG · 2019 · author #1
  13. Are your Items in Order? cs.DS · 2019 · author #1
  14. Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles cs.DS · 2019 · author #1
  15. The Long and the Short of It: Summarising Event Sequences with Serial Episodes cs.DS · 2019 · author #1
  16. Probably the Best Itemsets cs.DB · 2019 · author #1
  17. Significance of Episodes Based on Minimal Windows cs.DS · 2019 · author #1
  18. Finding Good Itemsets by Packing Data cs.DS · 2019 · author #1
  19. Dynamic hierarchies in temporal directed networks cs.DS · 2019 · author #1
  20. Inferring the strength of social ties: a community-driven approach cs.DS · 2019 · author #2
  21. Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks cs.DS · 2019 · author #1
  22. Discovering bursts revisited: guaranteed optimization of the model parameters cs.DS · 2019 · author #1
  23. Discovering Nested Communities cs.DS · 2019 · author #1
  24. What is the dimension of your binary data? cs.LG · 2019 · author #1
  25. Faster way to agony: Discovering hierarchies in directed graphs cs.DS · 2019 · author #1
  26. Distances between Data Sets Based on Summary Statistics cs.DS · 2019 · author #1
  27. Safe projections of binary data sets cs.DS · 2019 · author #1
  28. Ranking Episodes using a Partition Model cs.DS · 2019 · author #1
  29. Itemsets for Real-valued Datasets cs.DS · 2019 · author #1
  30. Computational Complexity of Queries Based on Itemsets cs.CC · 2019 · author #1
  31. Efficient estimation of AUC in a sliding window cs.LG · 2019 · author #1
  32. Boolean matrix factorization meets consecutive ones property cs.DS · 2019 · author #1
  33. Finding events in temporal networks: Segmentation meets densest-subgraph discovery cs.SI · 2018 · author #5
  34. Mining Periodic Patterns with a MDL Criterion cs.DB · 2018 · author #3
  35. Strongly polynomial efficient approximation scheme for segmentation cs.DS · 2018 · author #1
  36. Reconstructing a cascade from temporal observations cs.SI · 2018 · author #3
  37. Balancing Information Exposure in Social Networks cs.SI · 2017 · author #4
  38. Community-aware network sparsification cs.SI · 2017 · author #3
  39. Interactive and Iterative Discovery of Entity Network Subgraphs cs.SI · 2016 · author #4
  40. A note on adjusting $R^2$ for using with cross-validation cs.LG · 2016 · author #2
  41. Generating Realistic Synthetic Population Datasets cs.DB · 2016 · author #5
  42. Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models cs.DB · 2015 · author #4
  43. Skopus: Mining top-k sequential patterns under leverage cs.AI · 2015 · author #3

Mentions

  • 1506.08009 #3 · backfill · confidence 0.70 Nikolaj Tatti
  • 2602.04463 #2 · arxiv_oai · confidence 0.70 Nikolaj tatti
  • 2404.16676 #4 · arxiv_oai · confidence 0.70 Nikolaj Tatti

Frequent Coauthors