Reductions for Frequency-Based Data Mining Problems

by   Stefan Neumann, et al.

Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowing constraints in the pattern space, the complexities of many maximal frequent pattern mining problems collapse. These problems include maximal frequent subgraphs in labelled graphs, maximal frequent itemsets, and maximal frequent subsequences with no repetitions. In addition to theoretical interest, our results might yield more efficient algorithms for the studied problems.


page 1

page 2

page 3

page 4


ALLSAT compressed with wildcards: Frequent Set Mining

Once the maximal frequent sets are known, the family of all frequent set...

Approximate Network Motif Mining Via Graph Learning

Frequent and structurally related subgraphs, also known as network motif...

Mining Rank Data

The problem of frequent pattern mining has been studied quite extensivel...

BigCarl: Mining frequent subnets from a single large Petri net

While there have been lots of work studying frequent subgraph mining, ve...

Visual Graph Mining

In this study, we formulate the concept of "mining maximal-size frequent...

Most Frequent Itemset Optimization

In this paper we are dealing with the frequent itemset mining. We concen...

Please sign up or login with your details

Forgot password? Click here to reset