English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62796/95837 (66%)
造访人次 : 3639740      在线人数 : 373
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/91971


    题名: The Rough Set-Based Algorithm for Two Steps
    作者: Liao, Shu-hsien;Chen, Yin-ju;Ho, Shiu-Hwei
    贡献者: 淡江大學管理科學學系
    关键词: Rough sets;Association rules;Data mining;Knowledge management
    日期: 2011-06-01
    上传时间: 2013-08-12 13:07:30 (UTC+8)
    出版者: Heidelberg: Springer
    摘要: 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.
    關聯: Lecture notes in Computer Science 7063, pp.63-70
    DOI: 10.1007/978-3-642-24958-7_8
    显示于类别:[管理科學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML18检视/开启
    The rough set-based algorithm for two steps.pdf199KbAdobe PDF357检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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