English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 60938/93635 (65%)
造訪人次 : 1243272      線上人數 : 52
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/77271

    題名: Mining Disjunctive Consequent Association Rules
    作者: Chiang, Ding-An;Wang, Yi-Fan;Wang, Yi-Hsin;Chen, Zhi-Yang;Hsu, Mei-Hua
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: Data mining;Associationrule;Disjunctive composite items
    日期: 2011-03
    上傳時間: 2012-06-14 10:15:57 (UTC+8)
    出版者: Amsterdam: Elsevier BV
    摘要: When associationrules A → B and A → C cannot be discovered from the database, it does not mean that A → B ∨ C will not be an associationrule from the same database. In fact, when A, B or C is the newly marketed product, A → B ∨ C shall be a very useful rule in some cases. Since the consequent item of this kind of rule is formed by a disjunctive composite item, we call this type of rules as the disjunctiveconsequentassociationrules. Therefore, we propose a simple but efficient algorithm to discover this type of rules. Moreover, when we apply our algorithm to insurance policy for cross selling, the useful results have been proven by the insurance company.
    關聯: Applied Soft Computing 11(2), pp.2129-2133
    DOI: 10.1016/j.asoc.2010.07.011
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    1568-4946_11(2)p2129-2133.pdf420KbAdobe PDF313檢視/開啟



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