We show under which conditions and with what methods we can identify whether two continuous variables are subject to selection bias. More information here.
Identifying Selection Bias from Observational Data. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), AAAI, 2023. |
Given data from multiple environments, Orion discovers the fully directed overall causal network as well as tells which environments are subject to what interventions. More information here.
Information-Theoretic Causal Discovery and Intervention Detection over Multiple Environments. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), AAAI, 2023. |
Vario can discover which environments share the same mechanism, as well as those that behave differently, e.g. because of an intervention. More information here.
Discovering Invariant and Changing Mechanisms from Data. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 1242-1252, ACM, 2022. |
Heci infers, with very high accuracy, the most likely direction of causation between two numeric univariate variables even if noise is heteroscedastic. More information here.
Inferring Cause and Effect in the Presence of Heteroscedastic Noise. In: Proceedings of the International Conference on Machine Learning (ICML), PMLR, 2022. |
With Dice, we can efficiently mine reliable causal rules from observational data. More information here.
Discovering Reliable Causal Rules. In: Proceedings of the SIAM International Conference on Data Mining (SDM), SIAM, 2021. |
Based on the Algorithmic Markov Condition, Globe discovers fully oriented causal networks from observational data. More information here.
Discovering Fully Oriented Causal Networks. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), AAAI, 2021. |
We show under which conditions regularized regression can be used to identify cause from effect between pairs of univariate continuous-valued random variables. More information here.
Identifiability of Cause and Effect using Regularized Regression. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, 2019. |
With CoCa, we can tell whether two continuous variables are causally related, or jointly caused by a hidden confounder. More information here.
We Are Not Your Real Parents: Telling Causal From Confounded by MDL. In: SIAM International Conference on Data Mining (SDM), SIAM, 2019. |
With Acid, we can highly robustly infer the correct causal direction between two univariate discrete variables using stochastic complexity. More information here.
Accurate Causal Inference on Discrete Data. In: Proceedings of the IEEE International Conference on Data Mining (ICDM'18), IEEE, 2018. |
Slope infers, with very high accruacy, the most likely direction of causation between two numeric univariate variables based on local and global regression. More information here.
Telling Cause from Effect by Local and Global Regression. Knowledge and Information Systems vol.60(3), pp 1277-1305, IEEE, 2019. |
We propose the Crack algorithm for identifying the most likely direction of causation between two univariate or multivariate variables of single or mixed-type data. More information here.
Causal Inference on Multivariate and Mixed Type Data. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Data (ECMLPKDD), Springer, 2018. |
With CuTe, we can robustly infer the correct causal direction between two event sequences using sequential normalized maximum likelihood. More information here.
Causal Inference on Event Sequences. In: Proceedings of the SIAM Conference on Data Mining (SDM), pp 55-63, SIAM, 2018. |
With CiSC, we can highly robustly infer the correct causal direction between two univariate discrete variables using stochastic complexity. More information here.
MDL for Causal Inference on Discrete Data. In: Proceedings of the IEEE International Conference on Data Mining (ICDM'17), pp 751-756, IEEE, 2017. |
We propose the Origo algorithm for identifying the most likely direction of causation between two univariate or multivariate discrete nominal or binary variables. More information here.
Origo: Causal Inference by Compression. Knowledge and Information Systems vol.56(2), pp 285-307, Springer, 2018. |
FedDC makes it possible to learning high quality models in a federated manner when every site only has very litte training data available. More information here.
Federated Learning from Small Datasets. In: Proceedings of the International Conference on Representation Learning (ICLR), OpenReview, 2023. |
Peri discovers causal networks from observational data in a privacy-preserving and federated manner exchanging nothing but regret values. More information here.
Nothing but Regrets — Privacy-Preserving Federated Causal Discovery. In: Proceedings of the 26nd International Conference on Artificial Intelligence and Statistics (AISTATS), PMLR, 2023. |
elBMF is a highly scalable and very accurate approach to Boolean matrix factorization. More information here.
Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent. In: Proceedings of Neural Information Processing Systems (NeurIPS), PMLR, 2022. |
Given binary data from one or multiple envirnoments, we show how to discover a succinct and non-redundant set of significant patterns under sequential FWER or FDR. More information here.
Discovering Significant Patterns under Sequential False Discovery Control. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 263-272, ACM, 2022. |
In this paper we propose BinaPs, a mph{differentiable} rather than a combinatorial approach to pattern set mining that scales extremely well in both \(n\) and \(m\), naturally handles noise, and copes equally well with sparse and dense data. More information here.
Differentiable Pattern Set Mining. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 383-392, ACM, 2021. |
With ExplaiNN, we can find robust rules that explain how deep neural networks perceive the world. More information here.
What's in the Box? Explaining Neural Networks with Robust Rules. In: Proceedings of the International Conference on Machine Learning (ICML), PMLR, 2021. |
With Reaper, we can highly efficiently discover high quality pattern sets. More information here.
The Relaxed Maximum Entropy Distribution and its Application to Pattern Discovery. In: Proceedings of the IEEE International Conference on Data Mining (ICDM'20), IEEE, 2020. |
With Mexican, we can efficiently discover pattern sets expressing co-occurrence and mutual exclusivity from discrete data. More information here.
Discovering Succinct Pattern Sets Expressing Co-Occurrence and Mutual Exclusivity . In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, 2020. |
With Disc, we can efficiently discover the pattern composition of a binary dataset. More information here.
Explainable Data Decompositions. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'20), AAAI, 2020. |
Grab discovers succinct, non-redundant and highly characteristic sets of rules and patterns from binary data. More information here.
Sets of Robust Rules, and How to Find Them. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Data (ECMLPKDD), Springer, 2019. |
Suppose we are given a set of databases, such as sales records over different branches. How can we characterise the differences and the norm between these datasets? What are the patterns that characterise the overall distribution, and what are those that are important for the individual datasets? That is exactly what the DiffNorm algorithm reveals. More information here.
The Difference and the Norm – Characterising Similarities and Differences between Databases. In: Proceedings of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), pp 206-223, Springer, 2015. |
Self-sufficient itemsets are an effective way to summarise the key associations in data. However, their computation appears demanding, as assessing whether an itemset is self-sufficient requires consideration of all pairwise partitions of an itemset, as well as all its supersets. We propose an branch-and-bound algorithm that employs two powerful pruning techniques to extract them efficiently. More information here.
Efficient Discovery of the Most Interesting Associations. Transactions on Knowledge Discovery from Data vol.8(3), pp 1-31, ACM, 2014. |
We propose CueMin for discovering queueing models that explain and predict waiting and sojourn times. More information here.
Why Are We Waiting? Discovering Interpretable Models for Predicting Sojourn and Waiting Times. In: SIAM International Conference on Data Mining (SDM), SIAM, 2023. |
We propose Consequence for discovering accurate, yet easily understandable models for predicting event sequences from meta-data. More information here.
Mining Interpretable Data-to-Sequence Generators. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), AAAI, 2022. |
We propose Proseqo for discovering accurate, yet easily understandable models from complex event sequence data. More information here.
Mining Easily Understandable Models from Complex Event Data. In: SIAM International Conference on Data Mining (SDM), SIAM, 2021. |
How can we discover patterns that are not just reliable in that they accurately predict that something of interest will happen, but also reliable in that they can tell us when this will happen? With Omen we can. More information here.
Omen: Discovering Sequential Patterns with Reliable Prediction Delays. Knowledge and Information Systems vol.64(4), pp 1013-1045, Springer, 2022. |
With CuTe, we can robustly infer the correct causal direction between two event sequences using sequential normalized maximum likelihood. More information here.
Causal Inference on Event Sequences. In: Proceedings of the SIAM Conference on Data Mining (SDM), pp 55-63, SIAM, 2018. |
We consider mining informative serial episodes — subsequences allowing for gaps — from event sequence data. We formalize the problem by the Minimum Description Length principle, and give algorithms for selecting good pattern sets from candidate collections as well as for parameter free mining of such models directly from data. More information here.
Efficiently Summarising Event Sequences with Rich Interleaving Patterns. In: Proceedings of the SIAM Conference on Data Mining (SDM), pp 795-803, SIAM, 2017. |
We study how to obtain concise descriptions of discrete multivariate sequential data in terms of rich multivariate sequential patterns. We introduce Ditto, and show it discovers succinct pattern sets that capture highly interesting associations within and between sequences. More information here.
Keeping it Short and Simple: Summarising Complex Event Sequences with Multivariate Patterns. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'16), pp 735-744, ACM, 2016. |
Detecting whether any important statistics over your time series changed is an important aspect of time series analysis. With Light, we tackle the problem of efficiently and effectively detecting non-linear changes over very high dimensional time series. More information here.
Linear-time Detection of Non-Linear Changes in Massively High Dimensional Time Series. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp 828-836, SIAM, 2016. |
Given a set of graphs and a partition of these graphs into groups, we aim to discover what graphs in a group have in common, how they systematically differ from graphs in other groups, and how multiple groups of graphs are related. More information here.
Differentially Describing Groups of Graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), AAAI, 2022. |
We treat graph similarity assessment as a description problem, rather than as a measurement problem. Having formalized this problem as a model selection task using the Minimum Description Length principle, we propose Momo (Model of models), which solves the problem by breaking it into two parts and introducing efficient algorithms for each. More information here.
Graph Similarity Description: How Are These Graphs Similar?. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 185-195, ACM, 2021. |
We propose Susan, an efficient to compute random walk graph kernel that picks up structural similarity. More information here.
SUSAN: The Structural Similarity Random Walk Kernel. In: Proceedings of the SIAM International Conference on Data Mining (SDM), SIAM, 2021. |
We introduce a unified solution to knowledge graph characterization by formulating the problem as unsupervised summarization with a set of inductive, soft rules, which describe what is normal, and thus can be used to identify what is abnormal, whether it be strange or missing. More information here.
What is Normal, What is Strange, and What is Missing in a Knowledge Graph. In: Proceedings of the Web Conference (WWW), ACM, 2020. |
With CulT, we propose a method to reconstruct an epidemic over time, or, more general, reconstructing the propagation of an activity in a network. More information here.
Reconstructing an Epidemic over Time. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), pp 1835-1844, ACM, 2016. |
We propose Facets, a new scalable approach that helps users adaptively explore large million-node graphs from a local perspective, guiding them to focus on nodes and neighborhoods that are most subjectively interesting to users. More information here.
Adaptive Local Exploration of Large Graphs. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp 597-605, SIAM, 2017. |
Measuring the difference between data mining results is an important open problem in exploratory data mining. We discuss an information theoretic approach for measuring how much information is shared between results, and give a proof of concept for binary data. More information here.
VoG: Summarizing and Understanding Large Graphs. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp 91-99, SIAM, 2014. |
We consider the problem of finding subsets from the data that accept a simple description, but also exhibit anomalous behaviour, as seen by a positive definite kernel. This enables us to put a name on subsets of entities that stand out, each of which can have arbitrary structure, like being a graph, image, time-series, chemical, etc. More information here.
Naming the most anomalous cluster in Hilbert Space for structures with attribute information. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), AAAI, 2022. |
We consider the problem of discovering robustly connected subgraphs that have simple descriptions. Our aim is, hence, to discover vertex sets which not only a) induce a subgraph that is difficult to fragment into disconnected components, but also b) can be selected from the entire graph using just a simple conjunctive query on their vertex attributes. More information here.
Discovering Robustly Connected Subgraphs with Simple Descriptions. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), IEEE, 2019. |
We argue that in many applications, such as scientific discovery, subgroups are only useful if they are additionally representative of the global distribution with regard to a control variable: when the distribution of this control variable is the same, or almost the same, as over the whole data. We give an efficient algorithm to find such subgroups in the case of a numeric target and binary control variable. More information here.
Efficiently Discovering Locally Exceptional yet Globally Representative Subgroups. In: Proceedings of the IEEE International Conference on Data Mining (ICDM'17), IEEE, 2017. |
In subgroup discovery, discovering discover high quality one-dimensional subgroups as well as high quality refinements is a crucial task. For nominal attributes this is easy, but for numerical attributes this is more challenging. We propose to use optimal binning to find high quality binary features for numeric and ordinal attributes. More information here.
Flexibly Mining Better Subgroups. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp 585-593, SIAM, 2016. |
Anomalies are often characterised as the absence of patterns. We observe that the co-occurrence of patterns can also be anomalous – many people prefer Coca Cola, while others prefer buy Pepsi Cola, and hence anyone who buys both stands out. We formally introduce this new class of anomalies, and propose UpC, an efficient algorithm to discover these anomalies in transaction data. More information here.
Efficiently Discovering Unexpected Pattern-Co-Occurrences. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp 126-134, SIAM, 2017. |
Given a database and a target attribute, we are after telling whether there exists a functional, or approximately functional dependency of the target on any set of other attributes in the data, regardless of whether these are nominal or continuous valued, to do so efficiently, as well as reliably, without bias to sample size or dimensionality. To this end we propose the MixDora algorithm. More information here.
Discovering Functional Dependencies from Mixed-Type Data. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, 2020. |
Given a database and a target attribute, we are after telling whether there exists a functional, or approximately functional dependency of the target on any set of other attributes in the data, to do so efficiently, as well as reliably, without bias to sample size or dimensionality. To this end we propose the Fedora algorithm. More information here.
Discovering Dependencies with Reliable Mutual Information. Knowledge and Information Systems vol.62, pp 4223-4253, Springer, 2020. |
In this paper we propose a corrected-for-chance, consistent, and efficient estimator for normalized total correlation, by which we obtain a reliable, naturally inpretable, non-parametric measure for correlation over multivariate sets of categorical variables. We also propose an efficient algorithm for discovering reliable correlations. More information here.
Discovering Reliable Correlations in Categorical Data. In: Proceedings of the IEEE International Conference on Data Mining (ICDM'19), IEEE, 2019. |
Given a database and a target attribute, we are after telling whether there exists a functional, or approximately functional dependency of the target on any set of other attributes in the data, to do so efficiently, as well as reliably, without bias to sample size or dimensionality. To this end we propose the Dora algorithm. More information here.
Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms. In: Proceedings of the IEEE International Conference on Data Mining (ICDM'18), IEEE, 2018. |