淡江大學機構典藏:Item 987654321/77271
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62822/95882 (66%)
造访人次 : 4015931      在线人数 : 542
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/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 PDF338检视/开启

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

    TAIR相关文章

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