English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 57299/90901 (63%)
造訪人次 : 12978127      線上人數 : 255
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/92001

    題名: A rough association rule is applicable for knowledge
    作者: Liao, S. H.;Chen, Y.
    貢獻者: 淡江大學管理科學學系
    關鍵詞: Association rule;Data mining;Electronic commerce;Rough set
    日期: 2009-11
    上傳時間: 2013-08-12 15:05:47 (UTC+8)
    摘要: 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.
    關聯: Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, pp.557-561
    DOI: 10.1109/ICICISYS.2009.5357782
    顯示於類別:[管理科學學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    A rough association rule is applicable.pdf131KbAdobe PDF147檢視/開啟



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