Jilles Vreeken

Jilles Vreeken

Auto-generated profile, based on publicly available information

Jilles Vreeken

CISPA Helmholtz Center for Information Security, Saarbrücken, Germany

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 September 2020 in Nature Communications
Verified
Journal Article
Open access
PDF file
CSChristopher Sutton
Christopher Sutton
MBMario Boley
Mario Boley
LGLuca M. Ghiringhelli
Luca M. Ghiringhelli
MRMatthias Rupp
Matthias Rupp
JVJilles Vreeken
Jilles Vreeken
MSMatthias Scheffler
Matthias Scheffler
Although machine learning (ML) models promise to substantially accelerate the discovery of novel materials, their performance is often still insufficient to draw reliable conclusions. Improved ML models are therefore actively researched, but their design is currently guided mainly by monitoring the average model test error. This can render different models indistinguishable although their performance differs substantially across materials, or it can make a model appear generally insufficient while it actually works well in specific sub-domains. Here, we present a method, based on subgroup discovery, for detecting domains of applicability (DA) of models within a materials class. The utility of this approach is demonstrated by analyzing three state-of-the-art ML models for predicting the formation energy of transparent conducting oxides. We find that, despite having a mutually indistinguishable and unsatisfactory average error, the models have DAs with distinctive features and notably improved performance.

22 October 2015 in Journal of the Association for Information Science and Technology
Verified
Journal Article
Open access
PDF file
KAKumaripaba Athukorala
Kumaripaba Athukorala
DGDorota Głowacka
Dorota Głowacka
GJGiulio Jacucci
Giulio Jacucci
AOAntti Oulasvirta
Antti Oulasvirta
JVJilles Vreeken
Jilles Vreeken
Exploratory search is an increasingly important activity yet challenging for users. Although there exists an ample amount of research into understanding exploration, most of the major information retrieval (IR) systems do not provide tailored and adaptive support for such tasks. One reason is the lack of empirical knowledge on how to distinguish exploratory and lookup search behaviors in IR systems. The goal of this article is to investigate how to separate the 2 types of tasks in an IR system using easily measurable behaviors. In this article, we first review characteristics of exploratory search behavior. We then report on a controlled study of 6 search tasks with 3 exploratory—comparison, knowledge acquisition, planning—and 3 lookup tasks—fact‐finding, navigational, question answering. The results are encouraging, showing that IR systems can distinguish the 2 search categories in the course of a search session. The most distinctive indicators that characterize exploratory search behaviors are query length, maximum scroll depth, and task completion time. However, 2 tasks are borderline and exhibit mixed characteristics. We assess the applicability of this finding by reporting on several classification experiments. Our results have valuable implications for designing tailored and adaptive IR systems.

28 June 2017 in Data Mining and Knowledge Discovery
Verified
Journal Article
Open access
PDF file
MBMario Boley
Mario Boley
BGBryan R. Goldsmith
Bryan R. Goldsmith
LGLuca M. Ghiringhelli
Luca M. Ghiringhelli
JVJilles Vreeken
Jilles Vreeken
Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical applications, especially in scientific domains, futile. Therefore, we here extend the optimistic estimator framework for optimal subgroup discovery to a new class of objective functions: we show how tight estimators can be computed efficiently for all functions that are determined by subgroup size (non-decreasing dependence), the subgroup median value, and a dispersion measure around the median (non-increasing dependence). In the important special case when dispersion is measured using the mean absolute deviation from the median, this novel approach yields a linear time algorithm. Empirical evaluation on a wide range of datasets shows that, when used within branch-and-bound search, this approach is highly efficient and indeed discovers subgroups with much smaller errors.

4 April 2014 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
HNHoang-Vu Nguyen
Hoang-Vu Nguyen
EMEmmanuel Müller
Emmanuel Müller
JVJilles Vreeken
Jilles Vreeken
KBKlemens Böhm
Klemens Böhm

18 November 2017 in Knowledge and Information Systems
Verified
Journal Article
Open access
PDF file
KBKailash Budhathoki
Kailash Budhathoki
JVJilles Vreeken
Jilles Vreeken
Causal inference from observational data is one of the most fundamental problems in science. In general, the task is to tell whether it is more likely that \(X\) caused \(Y\), or vice versa, given only data over their joint distribution. In this paper we propose a general inference framework based on Kolmogorov complexity, as well as a practical and computable instantiation based on the Minimum Description Length principle. Simply put, we propose causal inference by compression. That is, we infer that \(X\) is a likely cause of \(Y\) if we can better compress the data by first encoding \(X\), and then encoding \(Y\) given \(X\), than in the other direction. To show this works in practice, we propose Origo, an efficient method for inferring the causal direction from binary data. Origo employs the lossless Pack compressor and searches for that set of decision trees that encodes the data most succinctly. Importantly, it works directly on the data and does not require assumptions about neither distributions nor the type of causal relations. To evaluate Origo in practice, we provide extensive experiments on synthetic, benchmark, and real-world data, including three case studies. Altogether, the experiments show that Origo reliably infers the correct causal direction on a wide range of settings.

7 December 2018 in Knowledge and Information Systems
Verified
Journal Article
Open access
PDF file
AMAlexander Marx
Alexander Marx
JVJilles Vreeken
Jilles Vreeken
We consider the problem of inferring the causal direction between two univariate numeric random variables X and Y from observational data. This case is especially challenging as the graph X causes Y is Markov equivalent to the graph Y causes X, and hence it is impossible to determine the correct direction using conditional independence tests. To tackle this problem, we follow an information theoretic approach based on the algorithmic Markov condition. This postulate states that in terms of Kolmogorov complexity the factorization given by the true causal model is the most succinct description of the joint distribution. This means that we can infer that X is a likely cause of Y when we need fewer bits to first transmit the data over X, and then the data of Y as a function of X, than for the inverse direction. That is, in this paper we perform causal inference by compression. To put this notion to practice, we employ the Minimum Description Length principle, and propose a score to determine how many bits we need to transmit the data using a class of regression functions that can model both local and global functional relations. To determine whether an inference, i.e. the difference in compressed sizes, is significant, we propose two analytical significance tests based on the no-hypercompression inequality. Last, but not least, we introduce the linear-time Slope and Sloper algorithms that through thorough empirical evaluation we show outperform the state of the art by a wide margin.