Closed-Itemset Incremental-Mining Problem

Closed-Itemset Incremental-Mining Problem

Luminita Dumitriu (“Dunarea de Jos” University, Romania)
Copyright: © 2005 |Pages: 4
DOI: 10.4018/978-1-59140-557-3.ch029
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Association rules, introduced by Agrawal, Imielinski and Swami (1993), provide useful means to discover associations in data. The problem of mining association rules in a database is defined as finding all the association rules that hold with more than a user-given minimum support threshold and a user-given minimum confidence threshold. According to Agrawal, Imielinski and Swami, this problem is solved in two steps: 1. Find all frequent itemsets in the database. 2. For each frequent itemset I, generate all the association rules I’ÞI\I’, where I’ÌI.

Complete Chapter List

Search this Book:
Reset