Parallel fp-tree for mining negative association rules

Kumar, Preetham and Saralaya, Vikram and Vishal, Vivek and Choudhary, Murari S (2011) Parallel fp-tree for mining negative association rules. In: International Conference on Computer Engineering and Technology, June 17-19, 2011, Kuala Lumpur , Malaysia.

[img] PDF
Parallel FP-Tree for Mining Negative Association Rules.pdf - Published Version
Restricted to Registered users only

Download (236kB) | Request a copy

Abstract

Mining Negative Association Rules is of great importance, and it helps in taking crucial management decisions. In this paper we basically focus on finding negative rules of the form X → ¬Y and ¬X → Y. To achieve this we build a one pass parallel FP-Tree, which has all the ingredients to efficiently mine negative rules. This parallelism comes from the fact that there exists taxonomy among items in the database. This assumption matches most real world situations, where mining is applied. Hence this work is practical and can be implemented efficiently as a useful mining technique. This work focuses on Market Basket data analysis and efficiently mines only the interesting rules

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Taxonomy, Support, Confidence.
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 11 Jan 2016 09:32
Last Modified: 11 Jan 2016 09:32
URI: http://eprints.manipal.edu/id/eprint/144993

Actions (login required)

View Item View Item