A Rough Set Approach to Building Association Rules and Its Applications

Junzo Watada, Takayuki Kawaura, Hao Li

    研究成果: Chapter

    1 被引用数 (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.

    本文言語English
    ホスト出版物のタイトルIntelligent Systems Reference Library
    ページ203-218
    ページ数16
    13
    DOI
    出版ステータスPublished - 2011

    出版物シリーズ

    名前Intelligent Systems Reference Library
    13
    ISSN(印刷版)18684394
    ISSN(電子版)18684408

    ASJC Scopus subject areas

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

    フィンガープリント 「A Rough Set Approach to Building Association Rules and Its Applications」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル