English  |  正體中文  |  简体中文  |  Items with full text/Total items : 59131/92571 (64%)
Visitors : 735857      Online Users : 47
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/77271

    Title: Mining Disjunctive Consequent Association Rules
    Authors: Chiang, Ding-An;Wang, Yi-Fan;Wang, Yi-Hsin;Chen, Zhi-Yang;Hsu, Mei-Hua
    Contributors: 淡江大學資訊工程學系
    Keywords: Data mining;Associationrule;Disjunctive composite items
    Date: 2011-03
    Issue Date: 2012-06-14 10:15:57 (UTC+8)
    Publisher: Amsterdam: Elsevier BV
    Abstract: 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.
    Relation: Applied Soft Computing 11(2), pp.2129-2133
    DOI: 10.1016/j.asoc.2010.07.011
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    1568-4946_11(2)p2129-2133.pdf420KbAdobe PDF307View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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