| Community Detection in Edge-Labeled Graphs. | 0 | 0.34 | 2022 |
| Ranking with submodular functions on a budget | 0 | 0.34 | 2022 |
| Recurrent Segmentation Meets Block Models in Temporal Networks. | 0 | 0.34 | 2022 |
| Approximation Algorithms for Confidence Bands for Time Series | 0 | 0.34 | 2021 |
| Fast computation of distance-generalized cores using sampling | 0 | 0.34 | 2021 |
| Using background knowledge to rank itemsets | 12 | 0.60 | 2019 |
| Density-Friendly Graph Decomposition. | 0 | 0.34 | 2019 |
| Strongly polynomial efficient approximation scheme for segmentation. | 0 | 0.34 | 2019 |
| Mining closed strict episodes | 17 | 0.94 | 2019 |
| Fast sequence segmentation using log-linear models. | 1 | 0.36 | 2019 |
| Discovering episodes with compact minimal windows | 5 | 0.48 | 2019 |
| Boolean matrix factorization meets consecutive ones property. | 0 | 0.34 | 2019 |
| Faster Way to Agony - Discovering Hierarchies in Directed Graphs. | 1 | 0.35 | 2019 |
| Generating Realistic Synthetic Population Datasets. | 2 | 0.37 | 2018 |
| Reconstructing a cascade from temporal observations. | 1 | 0.37 | 2018 |
| Balancing information exposure in social networks | 2 | 0.40 | 2017 |
| Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks. | 3 | 0.41 | 2017 |
| Finding Dynamic Dense Subgraphs. | 8 | 0.42 | 2017 |
| The Network-Untangling Problem: From Interactions to Activity Timelines. | 1 | 0.35 | 2017 |
| Discovering bursts revisited: guaranteed optimization of the model parameters. | 0 | 0.34 | 2017 |
| Inferring the Strength of Social Ties: A Community-Driven Approach | 6 | 0.47 | 2017 |
| Discovering recurring activity in temporal networks. | 2 | 0.36 | 2017 |
| Community-aware network sparsification. | 0 | 0.34 | 2017 |
| A Combinatorial Approach to Role Discovery | 0 | 0.34 | 2016 |
| Skopus: Mining top-k sequential patterns under leverage. | 0 | 0.34 | 2016 |
| Top-k overlapping densest subgraphs. | 7 | 0.42 | 2016 |
| A note on adjusting $R^2$ for using with cross-validation. | 0 | 0.34 | 2016 |
| Interactive and Iterative Discovery of Entity Network Subgraphs. | 0 | 0.34 | 2016 |
| Density-friendly Graph Decomposition | 14 | 0.52 | 2015 |
| Ranking episodes using a partition model | 5 | 0.46 | 2015 |
| Beyond rankings: comparing directed acyclic graphs | 1 | 0.36 | 2015 |
| Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models | 3 | 0.36 | 2015 |
| Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks | 3 | 0.43 | 2015 |
| Hierarchies in Directed Networks | 5 | 0.45 | 2015 |
| Uncovering the plot: detecting surprising coalitions of entities in multi-relational schemas | 9 | 0.57 | 2014 |
| Event detection in activity networks | 17 | 0.59 | 2014 |
| Overlapping community detection in labeled graphs | 17 | 0.71 | 2014 |
| Discovering Dynamic Communities in Interaction Networks. | 11 | 0.53 | 2014 |
| A Panorama of Imminent Doctoral Research in Data Mining. | 0 | 0.34 | 2014 |
| Mining Connection Pathways for Marked Nodes in Large Graphs. | 15 | 0.71 | 2013 |
| Itemsets For Real-Valued Datasets | 1 | 0.35 | 2013 |
| Discovering Nested Communities. | 3 | 0.43 | 2013 |
| Discovering descriptive tile trees: by mining optimal geometric subtiles | 4 | 0.42 | 2012 |
| Comparing apples and oranges: measuring differences between exploratory data mining results | 11 | 0.53 | 2012 |
| MARBLES: Mining association rules buried in long event sequences | 6 | 0.54 | 2012 |
| The long and the short of it: summarising event sequences with serial episodes | 40 | 1.14 | 2012 |
| Summarizing data succinctly with the most informative itemsets | 25 | 0.78 | 2012 |
| Comparing apples and oranges: measuring differences between data mining results | 1 | 0.34 | 2011 |
| Finding Robust Itemsets under Subsampling | 5 | 0.43 | 2011 |
| Tell me what i need to know: succinctly summarizing data with itemsets | 57 | 1.36 | 2011 |
