Nikolaj Tatti

Mach. Learn., April, 2024

2023

Column-coherent matrix decomposition.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., November, 2023

Fast computation of distance-generalized cores using sampling.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., June, 2023

Finding coherent node groups in directed graphs.

[BibT_eX]

[DOI]

Iiro Kumpulainen

Chamalee Wickrama Arachchi

CoRR, 2023

Node ranking in labeled networks.

[BibT_eX]

[DOI]

Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

Ranking with submodular functions on the fly.

[BibT_eX]

[DOI]

Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

Finding Favourite Tuples on Data Streams with Provably Few Comparisons.

[BibT_eX]

[DOI]

Chamalee Wickrama Arachchi

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Jaccard-Constrained Dense Subgraph Discovery.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 26th International Conference, 2023

2022

Maintaining AUC and H-measure over time.

[BibT_eX]

[DOI]

Mach. Learn., 2022

Ranking with submodular functions on a budget.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2022

Optimal deletion-robust coreset for submodular maximization.

[BibT_eX]

[DOI]

CoRR, 2022

Coresets remembered and items forgotten: submodular maximization with deletions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2022

Community Detection in Edge-Labeled Graphs.

[BibT_eX]

[DOI]

Iiro Kumpulainen

Chamalee Wickrama Arachchi

Proceedings of the Discovery Science - 25th International Conference, 2022

Recurrent Segmentation Meets Block Models in Temporal Networks.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 25th International Conference, 2022

2021

The network-untangling problem: from interactions to activity timelines.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2021

Approximation Algorithms for Confidence Bands for Time Series.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2021

2020

Finding events in temporal networks: segmentation meets densest subgraph discovery.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2020

2019

Density-Friendly Graph Decomposition.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2019

Strongly polynomial efficient approximation scheme for segmentation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Boolean matrix factorization meets consecutive ones property.

[BibT_eX]

[DOI]

Pauli Miettinen

Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

Fast Likelihood-Based Change Point Detection.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018

Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2018

Generating Realistic Synthetic Population Datasets.

[BibT_eX]

[DOI]

Hao Wu

Yue Ning

Prithwish Chakraborty

Naren Ramakrishnan

ACM Trans. Knowl. Discov. Data, 2018

Reconstructing a cascade from temporal observations.

[BibT_eX]

[DOI]

Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Dynamic Hierarchies in Temporal Directed Networks.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

Efficient Estimation of AUC in a Sliding Window.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

Mining Periodic Patterns with a MDL Criterion.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

2017

Finding Dynamic Dense Subgraphs.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2017

Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2017

Discovering recurring activity in temporal networks.

[BibT_eX]

[DOI]

Orestis Kostakis

Data Min. Knowl. Discov., 2017

Discovering bursts revisited: guaranteed optimization of the model parameters.

[BibT_eX]

[DOI]

Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Community-aware network sparsification.

[BibT_eX]

[DOI]

Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Balancing information exposure in social networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2016

Top-k overlapping densest subgraphs.

[BibT_eX]

[DOI]

Esther Galbrun

Data Min. Knowl. Discov., 2016

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

[BibT_eX]

[DOI]

Indre Zliobaite

CoRR, 2016

Interactive and Iterative Discovery of Entity Network Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2016

A Combinatorial Approach to Role Discovery.

[BibT_eX]

[DOI]

Albert Arockiasamy

Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015

Ranking episodes using a partition model.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2015

Beyond rankings: comparing directed acyclic graphs.

[BibT_eX]

[DOI]

Eric Malmi

Data Min. Knowl. Discov., 2015

Density-friendly Graph Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web, 2015

Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

Hierarchies in Directed Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

2014

Finding Robust Itemsets under Subsampling.

[BibT_eX]

[DOI]

Fabian Moerchen

Toon Calders

ACM Trans. Database Syst., 2014

A Panorama of Imminent Doctoral Research in Data Mining.

[BibT_eX]

[DOI]

Aparna S. Varde

SIGMOD Rec., 2014

MARBLES: Mining association rules buried in long event sequences.

[BibT_eX]

[DOI]

Boris Cule

Bart Goethals

Stat. Anal. Data Min., 2014

Uncovering the plot: detecting surprising coalitions of entities in multi-relational schemas.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2014

Discovering bands from graphs.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2014

Discovering episodes with compact minimal windows.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2014

Overlapping community detection in labeled graphs.

[BibT_eX]

[DOI]

Esther Galbrun

Data Min. Knowl. Discov., 2014

Faster Way to Agony - Discovering Hierarchies in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Discovering Dynamic Communities in Interaction Networks.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Event detection in activity networks.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Interesting Patterns.

[BibT_eX]

[DOI]

Proceedings of the Frequent Pattern Mining, 2014

2013

Fast sequence segmentation using log-linear models.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2013

Mining Connection Pathways for Marked Nodes in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 13th SIAM International Conference on Data Mining, 2013

Discovering Nested Communities.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Itemsets for Real-Valued Datasets.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

2012

Summarizing data succinctly with the most informative itemsets.

[BibT_eX]

[DOI]

Michael Mampaey

ACM Trans. Knowl. Discov. Data, 2012

Comparing apples and oranges: measuring differences between exploratory data mining results.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2012

Mining closed strict episodes.

[BibT_eX]

[DOI]

Boris Cule

Data Min. Knowl. Discov., 2012

Discovering Descriptive Tile Trees - By Mining Optimal Geometric Subtiles.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

The long and the short of it: summarising event sequences with serial episodes.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011

Are your Items in Order.

[BibT_eX]

[DOI]

Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Comparing Apples and Oranges - Measuring Differences between Data Mining Results.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

Mining closed episodes with simultaneous events.

[BibT_eX]

[DOI]

Boris Cule

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.

[BibT_eX]

[DOI]

Michael Mampaey

Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Finding Robust Itemsets under Subsampling.

[BibT_eX]

[DOI]

Fabian Moerchen

Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010

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

[BibT_eX]

[DOI]

Bart Goethals

SIGKDD Explor., 2010

Using background knowledge to rank itemsets.

[BibT_eX]

[DOI]

Michael Mampaey

Data Min. Knowl. Discov., 2010

Probably the best itemsets.

[BibT_eX]

[DOI]

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

2009

Tell me something I don't know: randomization strategies for iterative data mining.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the ICDM 2009, 2009

2008

Maximum entropy based significance of itemsets.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2008

Decomposable Families of Itemsets.

[BibT_eX]

[DOI]

Hannes Heikinheimo

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Finding Good Itemsets by Packing Data.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007

Distances between Data Sets Based on Summary Statistics.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2007

2006

Computational complexity of queries based on itemsets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Safe projections of binary data sets.

[BibT_eX]

[DOI]