Filter Results:
- Full text PDF available (52)
Publication Year
2003
2019
- This year (19)
- Last 5 years (77)
- Last 10 years (119)
Publication Type
Co-author
Journals and Conferences
Learn More
- Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
- Data Mining and Knowledge Discovery
- 2010
One of the major problems in pattern mining is the explosion of the number of results. Tight constraints reveal only common knowledge, while loose constraints lead to an explosion in the number of… (More)
One of the major problems in frequent item set mining is the explosion of the number of results: it is difficult to find the most interesting frequent item sets. The cause of this explosion is that… (More)
- Koen Smets, Jilles Vreeken
- SDM
- 2012
Mining small, useful, and high-quality sets of patterns has recently become an important topic in data mining. The standard approach is to first mine many candidates, and then to select a good… (More)
- Nikolaj Tatti, Jilles Vreeken
- KDD
- 2012
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard frequent pattern miners… (More)
- Koen Smets, Jilles Vreeken
- SDM
- 2011
In many situations there exists an abundance of positive examples, but only a handful of negatives. In this paper we show how in binary or transaction data such rare cases can be identified and… (More)
- Michael Mampaey, Nikolaj Tatti, Jilles Vreeken
- KDD
- 2011
Data analysis is an inherently iterative process. That is, what we know about the data greatly determines our expectations, and hence, what result we would find the most interesting. With this in… (More)
In many real world applications data is collected in multi-dimensional spaces, with the knowledge hidden in subspaces (i.e., subsets of the dimensions). It is an open research issue to select… (More)
- Danai Koutra, U. Kang, Jilles Vreeken, Christos Faloutsos
- SDM
- 2014
How can we succinctly describe a million-node graph with a few simple sentences? How can we measure the ‘importance’ of a set of discovered subgraphs in a large graph? These are exactly the problems… (More)
- B. Aditya Prakash, Jilles Vreeken, Christos Faloutsos
- IEEE 12th International Conference on Data Mining
- 2012
Given a snapshot of a large graph, in which an infection has been spreading for some time, can we identify those nodes from which the infection started to spread? In other words, can we reliably tell… (More)
Spotting anomalies in large multi-dimensional databases is a crucial task with many applications in finance, health care, security, etc. We introduce COMPREX, a new approach for identifying anomalies… (More)