
Decomposable Families of Itemsets
The problem of selecting a small, yet high quality subset of patterns fr...
read it

Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Mining
There is a wide variety of data mining methods available, and it is gene...
read it

Summarizing Data Succinctly with the Most Informative Itemsets
Knowledge discovery from data is an inherently iterative process. That i...
read it

Tell Me What I Need to Know: Succinctly Summarizing Data with Itemsets
Data analysis is an inherently iterative process. That is, what we know ...
read it

Maximum Entropy Based Significance of Itemsets
We consider the problem of defining the significance of an itemset. We s...
read it

Mining Closed Episodes with Simultaneous Events
Sequential pattern discovery is a wellstudied field in data mining. Epi...
read it

Discovering Episodes with Compact Minimal Windows
Discovering the most interesting patterns is the key problem in the fiel...
read it

Mining Closed Strict Episodes
Discovering patterns in a sequence is an important aspect of data mining...
read it

Discovering Bands from Graphs
Discovering the underlying structure of a given graph is one of the fund...
read it

Densityfriendly Graph Decomposition
Decomposing a graph into a hierarchical structure via kcore analysis is...
read it

Comparing Apples and Oranges: Measuring Differences between Exploratory Data Mining Results
Deciding whether the results of two different mining algorithms provide ...
read it

Comparing Apples and Oranges: Measuring Differences between Data Mining Results
Deciding whether the results of two different mining algorithms provide ...
read it

Finding Robust Itemsets Under Subsampling
Mining frequent patterns is plagued by the problem of pattern explosion ...
read it

Fast Sequence Segmentation using LogLinear Models
Sequence segmentation is a wellstudied problem, where given a sequence ...
read it

Using Background Knowledge to Rank Itemsets
Assessing the quality of discovered results is an important open problem...
read it

Are your Items in Order?
Items in many datasets can be arranged to a natural order. Such orders a...
read it

Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles
When analysing binary data, the ease at which one can interpret results ...
read it

The Long and the Short of It: Summarising Event Sequences with Serial Episodes
An ideal outcome of pattern mining is a small set of informative pattern...
read it

Probably the Best Itemsets
One of the main current challenges in itemset mining is to discover a sm...
read it

Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been a...
read it

Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the dat...
read it

Dynamic hierarchies in temporal directed networks
The outcome of interactions in many realworld systems can be often expl...
read it

Inferring the strength of social ties: a communitydriven approach
Online social networks are growing and becoming denser. The social conne...
read it

Hierarchies in directed networks
Interactions in many realworld phenomena can be explained by a strong h...
read it

Discovering bursts revisited: guaranteed optimization of the model parameters
One of the classic data mining tasks is to discover bursts, time interva...
read it

Discovering Nested Communities
Finding communities in graphs is one of the most wellstudied problems i...
read it

What is the dimension of your binary data?
Many 0/1 datasets have a very large number of variables; on the other ha...
read it

Faster way to agony: Discovering hierarchies in directed graphs
Many realworld phenomena exhibit strong hierarchical structure. Consequ...
read it

Distances between Data Sets Based on Summary Statistics
The concepts of similarity and distance are crucial in data mining. We c...
read it

Safe projections of binary data sets
Selectivity estimation of a boolean query based on frequent itemsets can...
read it

Ranking Episodes using a Partition Model
One of the biggest setbacks in traditional frequent pattern mining is th...
read it

Itemsets for Realvalued Datasets
Pattern mining is one of the most wellstudied subfields in exploratory ...
read it

Computational Complexity of Queries Based on Itemsets
We investigate determining the exact bounds of the frequencies of conjun...
read it

Efficient estimation of AUC in a sliding window
In many applications, monitoring area under the ROC curve (AUC) in a sli...
read it

Boolean matrix factorization meets consecutive ones property
Boolean matrix factorization is a natural and a popular technique for su...
read it

Finding events in temporal networks: Segmentation meets densestsubgraph discovery
In this paper we study the problem of discovering a timeline of events i...
read it

Mining Periodic Patterns with a MDL Criterion
The quantity of event logs available is increasing rapidly, be they prod...
read it

Strongly polynomial efficient approximation scheme for segmentation
Partitioning a sequence of length n into k coherent segments is one of t...
read it

A note on adjusting R^2 for using with crossvalidation
We show how to adjust the coefficient of determination (R^2) when used f...
read it

Skopus: Exact discovery of the most interesting sequential patterns under Leverage
This paper presents a framework for exact discovery of the most interest...
read it
Nikolaj Tatti
is this you? claim profile