English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 58617/92280 (64%)
造訪人次 : 562195      線上人數 : 122
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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
    顯示於類別:[管理科學學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    The rough set-based algorithm for two steps.pdf199KbAdobe PDF306檢視/開啟



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