English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52359/87459 (60%)
Visitors : 9139906      Online Users : 221
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/92001

    Title: A rough association rule is applicable for knowledge
    Authors: Liao, S. H.;Chen, Y.
    Contributors: 淡江大學管理科學學系
    Keywords: Association rule;Data mining;Electronic commerce;Rough set
    Date: 2009-11
    Issue Date: 2013-08-12 15:05:47 (UTC+8)
    Abstract: The traditional association rule which should be fixed in order to avoid both that only trivial rules are retained and also that interesting rules are not discarded. In fact, the situations which use the relative comparison to express are more complete than to use the absolute comparison. Through relative comparison we proposes a new approach for mining association rule, which has the ability to handle the uncertainty in the classing process, so that we can reduce information loss and enhance the result of data mining. In this paper, the new approach can be applied in find association rules, which has the ability to handle the uncertainty in the classing process and suitable for all data types.
    Relation: Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, pp.557-561
    DOI: 10.1109/ICICISYS.2009.5357782
    Appears in Collections:[管理科學學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    A rough association rule is applicable.pdf131KbAdobe PDF118View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback