Papers
arxiv:1806.07691

Searching of interesting itemsets for negative association rules

Published on Jun 20, 2018
Authors:
,
,

Abstract

In this paper, we propose an algorithm of searching for both positive and negative itemsets of interest which should be given at the first stage for positive and negative association rules mining. Traditional association rule mining algorithms extract positive association rules based on frequent itemsets, for which the frequent itemsets, i.e. only positive itemsets of interest are searched. Further, there are useful itemsets among the frequent itemsets pruned from the traditional algorithms to reduce the search space, for mining of negative association rules. Therefore, the traditional algorithms have not come true to find negative itemsets needed in mining of negative association rules. Our new algorithm to search for both positive and negative itemsets of interest prepares preconditions for mining of all positive and negative association rules.

Community

Sign up or log in to comment

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/1806.07691 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/1806.07691 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/1806.07691 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.