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

Ferdous Sohel, C.M. Rahman

    Research output: Contribution to journalArticle

    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 (Agarwal et al., 1996a; Agarwal et al., 1994; Mannila et al., 1994; Savasere et al., 1995). Most of the algorithms assume a static database. There are a few algorithms, which find association rules for dynamic database. Border algorithms (Feldman et al., 1997 and Das and Bhattacharyya, 2003) 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.
    Original languageEnglish
    Pages (from-to)508-515
    JournalAsian Journal of Information Technology
    Volume3
    Issue number7
    Publication statusPublished - 2004

    Fingerprint Dive into the research topics of 'Association rule mining in dynamic database using the concept of border sets'. Together they form a unique fingerprint.

    Cite this