Nikolaj Tatti

According to our database1, Nikolaj Tatti
  • authored at least 61 papers between 2006 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Finding Dynamic Dense Subgraphs.
TKDD, 2017

Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks.
Data Min. Knowl. Discov., 2017

Discovering recurring activity in temporal networks.
Data Min. Knowl. Discov., 2017

Balancing Information Exposure in Social Networks.
CoRR, 2017

Community-aware network sparsification.
CoRR, 2017

Discovering bursts revisited: guaranteed optimization of the model parameters.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Community-aware network sparsification.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Balancing information exposure in social networks.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Inferring the Strength of Social Ties: A Community-Driven Approach.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

2016
Skopus: Mining top-k sequential patterns under leverage.
Data Min. Knowl. Discov., 2016

Top-k overlapping densest subgraphs.
Data Min. Knowl. Discov., 2016

A note on adjusting $R^2$ for using with cross-validation.
CoRR, 2016

Interactive and Iterative Discovery of Entity Network Subgraphs.
CoRR, 2016

Generating Realistic Synthetic Population Datasets.
CoRR, 2016

A Combinatorial Approach to Role Discovery.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
Ranking episodes using a partition model.
Data Min. Knowl. Discov., 2015

Beyond rankings: comparing directed acyclic graphs.
Data Min. Knowl. Discov., 2015

Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models.
CoRR, 2015

Density-friendly Graph Decomposition.
Proceedings of the 24th International Conference on World Wide Web, 2015

Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

Hierarchies in Directed Networks.
Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

2014
Finding Robust Itemsets under Subsampling.
ACM Trans. Database Syst., 2014

A Panorama of Imminent Doctoral Research in Data Mining.
SIGMOD Record, 2014

MARBLES: Mining association rules buried in long event sequences.
Statistical Analysis and Data Mining, 2014

Uncovering the plot: detecting surprising coalitions of entities in multi-relational schemas.
Data Min. Knowl. Discov., 2014

Discovering bands from graphs.
Data Min. Knowl. Discov., 2014

Discovering episodes with compact minimal windows.
Data Min. Knowl. Discov., 2014

Overlapping community detection in labeled graphs.
Data Min. Knowl. Discov., 2014

Faster Way to Agony - Discovering Hierarchies in Directed Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Discovering Dynamic Communities in Interaction Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Event detection in activity networks.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Interesting Patterns.
Proceedings of the Frequent Pattern Mining, 2014

2013
Fast sequence segmentation using log-linear models.
Data Min. Knowl. Discov., 2013

Mining Connection Pathways for Marked Nodes in Large Graphs.
Proceedings of the 13th SIAM International Conference on Data Mining, 2013

Discovering Nested Communities.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Itemsets for Real-Valued Datasets.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

2012
Summarizing data succinctly with the most informative itemsets.
TKDD, 2012

Comparing apples and oranges: measuring differences between exploratory data mining results.
Data Min. Knowl. Discov., 2012

Mining closed strict episodes.
Data Min. Knowl. Discov., 2012

MARBLES: Mining Association Rules Buried in Long Event Sequences.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Discovering Descriptive Tile Trees - By Mining Optimal Geometric Subtiles.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

The long and the short of it: summarising event sequences with serial episodes.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011
Are your Items in Order.
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Comparing Apples and Oranges - Measuring Differences between Data Mining Results.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

Mining closed episodes with simultaneous events.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Tell me what i need to know: succinctly summarizing data with itemsets.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Finding Robust Itemsets under Subsampling.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
Useful patterns (UP'10) ACM SIGKDD workshop report.
SIGKDD Explorations, 2010

Using background knowledge to rank itemsets.
Data Min. Knowl. Discov., 2010

Probably the best itemsets.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

Mining Closed Strict Episodes.
Proceedings of the ICDM 2010, 2010

2009
Tell me something I don't know: randomization strategies for iterative data mining.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Significance of Episodes Based on Minimal Windows.
Proceedings of the ICDM 2009, 2009

2008
Maximum entropy based significance of itemsets.
Knowl. Inf. Syst., 2008

Decomposable Families of Itemsets.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Finding Good Itemsets by Packing Data.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007
Distances between Data Sets Based on Summary Statistics.
Journal of Machine Learning Research, 2007

Maximum Entropy Based Significance of Itemsets.
Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006
Computational complexity of queries based on itemsets.
Inf. Process. Lett., 2006

Safe projections of binary data sets.
Acta Inf., 2006

What is the Dimension of Your Binary Data?
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006


  Loading...