ALLSAT compressed with wildcards: Frequent Set Mining

10/31/2019
by   Marcel Wild, et al.
0

Once the maximal frequent sets are known, the family of all frequent sets can be efficiently compressed (without loss of information) by the use of suitable wildcards.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2012

Abstract Representations and Frequent Pattern Discovery

We discuss the frequent pattern mining problem in a general setting. Fro...
research
09/04/2017

Reductions for Frequency-Based Data Mining Problems

Studying the computational complexity of problems is one of the - if not...
research
06/03/2002

Mining All Non-Derivable Frequent Itemsets

Recent studies on frequent itemset mining algorithms resulted in signifi...
research
04/16/2019

Most Frequent Itemset Optimization

In this paper we are dealing with the frequent itemset mining. We concen...
research
11/07/2017

Grafting for Combinatorial Boolean Model using Frequent Itemset Mining

This paper introduces the combinatorial Boolean model (CBM), which is de...
research
08/06/2018

Know Abnormal, Find Evil: Frequent Pattern Mining for Ransomware Threat Hunting and Intelligence

Emergence of crypto-ransomware has significantly changed the cyber threa...
research
02/04/2019

Safe projections of binary data sets

Selectivity estimation of a boolean query based on frequent itemsets can...

Please sign up or login with your details

Forgot password? Click here to reset