Association rule mining in dynamic database using the concept of border sets

Sohel, F.A. and Rahman, C.M. (2003) Association rule mining in dynamic database using the concept of border sets. In: International Conference on Electrical, Electronics and Computer Engineering (ICEECE-03), 22 - 24 December 2003, Dhaka, Bangladesh

Abstract

Mining of association rules is one of the important tasks in Data Mining. Association Rules find the influence of one set of items on another set of items. There are many influential algorithms to determine association rules [1], [2], [3], [4]. Most of the algorithms assume a static database. There are a few algorithms, which find association rules for dynamic database. Border algorithms [5], [6] are such algorithms, which use the concept of Border set for incremental database. But there are such situations where data are to be upgraded or deleted from the database. This paper presents an algorithm, which uses the concept of border algorithm for diminishing database.

Item Type:	Conference Paper
URI:	http://researchrepository.murdoch.edu.au/id/eprint/28571

Item Control Page

Downloads