Finding dense subgraphs is a core problem in graph mining with many
appl...
One of the most fundamental tasks in data science is to assist a user wi...
Change point detection plays a fundamental role in many real-world
appli...
Maximizing submodular functions have been studied extensively for a wide...
Finding dense communities in networks is a widely-used tool for analysis...
A popular approach to model interactions is to represent them as a netwo...
Submodular maximization has been the backbone of many important
machine-...
In recent years we have witnessed an increase on the development of meth...
Confidence intervals are a standard technique for analyzing data. When
a...
Measuring the performance of a classifier is a vital task in machine
lea...
Core decomposition is a classic technique for discovering densely connec...
The problem of selecting a small, yet high quality subset of patterns fr...
There is a wide variety of data mining methods available, and it is gene...
Knowledge discovery from data is an inherently iterative process. That i...
Data analysis is an inherently iterative process. That is, what we know ...
We consider the problem of defining the significance of an itemset. We s...
Sequential pattern discovery is a well-studied field in data mining. Epi...
Discovering the most interesting patterns is the key problem in the fiel...
Discovering patterns in a sequence is an important aspect of data mining...
Discovering the underlying structure of a given graph is one of the
fund...
Decomposing a graph into a hierarchical structure via k-core analysis is...
Deciding whether the results of two different mining algorithms provide
...
Deciding whether the results of two different mining algorithms provide
...
Mining frequent patterns is plagued by the problem of pattern explosion
...
Sequence segmentation is a well-studied problem, where given a sequence ...
Assessing the quality of discovered results is an important open problem...
Items in many datasets can be arranged to a natural order. Such orders a...
When analysing binary data, the ease at which one can interpret results ...
An ideal outcome of pattern mining is a small set of informative pattern...
One of the main current challenges in itemset mining is to discover a sm...
Discovering episodes, frequent sets of events from a sequence has been a...
The problem of selecting small groups of itemsets that represent the dat...
The outcome of interactions in many real-world systems can be often expl...
Online social networks are growing and becoming denser. The social
conne...
Interactions in many real-world phenomena can be explained by a strong
h...
One of the classic data mining tasks is to discover bursts, time interva...
Finding communities in graphs is one of the most well-studied problems i...
Many 0/1 datasets have a very large number of variables; on the other ha...
Many real-world phenomena exhibit strong hierarchical structure.
Consequ...
The concepts of similarity and distance are crucial in data mining. We
c...
Selectivity estimation of a boolean query based on frequent itemsets can...
One of the biggest setbacks in traditional frequent pattern mining is th...
Pattern mining is one of the most well-studied subfields in exploratory ...
We investigate determining the exact bounds of the frequencies of
conjun...
In many applications, monitoring area under the ROC curve (AUC) in a sli...
Boolean matrix factorization is a natural and a popular technique for
su...
In this paper we study the problem of discovering a timeline of events i...
The quantity of event logs available is increasing rapidly, be they prod...
Partitioning a sequence of length n into k coherent segments is one of
t...
We show how to adjust the coefficient of determination (R^2) when used f...