A Rough Set Approach to Building Association Rules and Its Applications

Junzo Watada*, Takayuki Kawaura, Hao Li

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingChapter

    1 Citation (Scopus)


    Data mining is a process or method of finding information, evidence, insight, knowledge and hypotheses in a huge database, such as marketing data. Recently, the association rule presented by R. Agrawal in 1983 has been used to rapidly expand a data mining method. This method is general and flexible and can be applied to both general data analysis and very wide surveys. In addition, the rules for this method are complicated. On the other hand, when the support value is minimal and the confidence value is high, the obtained value is already known and trivial. A breakthrough method is needed. The objective of this paper is to present a rough set model to overcome such issues. Employing the rough set model, we analyzed three different scales of databases and compared the results of simulation experiments using proposed and conventional models. The rough set model obtained an efficient number of association rules and usually took less computation time.

    Original languageEnglish
    Title of host publicationIntelligent Systems Reference Library
    Number of pages16
    Publication statusPublished - 2011

    Publication series

    NameIntelligent Systems Reference Library
    ISSN (Print)18684394
    ISSN (Electronic)18684408


    • association rule
    • data mining
    • Rough set

    ASJC Scopus subject areas

    • Computer Science(all)
    • Information Systems and Management
    • Library and Information Sciences


    Dive into the research topics of 'A Rough Set Approach to Building Association Rules and Its Applications'. Together they form a unique fingerprint.

    Cite this