English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49378/84106 (59%)
Visitors : 7368471      Online Users : 58
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/91971


    Title: The Rough Set-Based Algorithm for Two Steps
    Authors: Liao, Shu-hsien;Chen, Yin-ju;Ho, Shiu-Hwei
    Contributors: 淡江大學管理科學學系
    Keywords: Rough sets;Association rules;Data mining;Knowledge management
    Date: 2011-06
    Issue Date: 2013-08-12 13:07:30 (UTC+8)
    Publisher: Heidelberg: Springer
    Abstract: The previous research in mining association rules pays no attention to finding rules from imprecise data, and the traditional data mining cannot
    solve the multi-policy-making problem. urthermore, in this research, we incorporate association rules with rough sets and promote a new point of view
    in applications. The new approach can be applied for finding association rules, which has the ability to handle uncertainty combined with rough set theory. In the research, first, we provide new algorithms modified from Apriori algorithm
    and then give an illustrative example. Finally, give some suggestion based on knowledge management as a reference for future research.
    Relation: Lecture notes in Computer Science 7063, pp.63-70
    DOI: 10.1007/978-3-642-24958-7_8
    Appears in Collections:[管理科學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML171View/Open
    The rough set-based algorithm for two steps.pdf199KbAdobe PDF245View/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