English  |  正體中文  |  简体中文  |  Items with full text/Total items : 25395/25990 (98%)
Visitors : 6185593      Online Users : 44
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ksu.edu.tw/handle/987654321/5698

    Title: Mining Ensemble Association Rules by Karnaugh Map
    Authors: Yi-Chun Lin
    Chun-Min Hung (洪俊銘)
    Yueh-Min Huang
    Date: 2009-03
    Issue Date: 2009-11-19 23:56:42 (UTC+8)
    Abstract: Generally, the study of association mining is majority concentrate on how to find out the frequent item set and attempt to infer the relationship between them. But very few studies deliberate about the two notable issues. The one is the huge number of association rules, which easily caused the decision maker to get lost in it. The other is the general association rules, which just imply the relationship with “AND” logic between items, but not imply the relation with “OR” and “XOR” logic between items. In this paper, we apply Karnaugh Map (K-Map) principle to find out ensemble association rules by experiment transaction data, it names „ARKM‟. The experiment result shows that the ARKM approach which not only provides computational efficiency to obtain simplified and usable rules but also manifest adaptive to the decision maker.
    Relation: Yi-Chun Lin, Chun-Min Hung, and Yueh-Min Huang*, “Mining Ensemble Association Rules by Karnaugh Map,” 2009 World Congress on Computer Science and Information Engineering (CSIE 2009), Los Angeles/Anaheim, USA, 2009. Accepted. (NSC 96-2221-E-168-030)
    Appears in Collections:[資訊管理系所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Mining Ensemble Association Rules by Karnaugh Map.pdf264KbAdobe PDF73View/Open

    All items in KSUIR are protected by copyright, with all rights reserved.

    ©Kun Shan University Library and Information Center
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback