English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8716281      Online Users : 80
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/35157

    Title: 有效率的複合式後項關聯式法則探勘演算法 : 以壽險業為例
    Other Titles: An efficient algorithm for association rule with disjunctive consequent : the case of the insurance industry
    Authors: 陳智揚;Chen, Zhi-yang
    Contributors: 淡江大學資訊工程學系碩士班
    陳伯榮;Chen, Po-zung
    Keywords: 關聯式法則;複合式物品項目;資料探勘;壽險;Association Rule;Disjunctive Consequent;Data Mining;Insurance
    Date: 2006
    Issue Date: 2010-01-11 06:05:26 (UTC+8)
    Abstract: 在資料採礦中,關聯式法則是經常被使用的技術之一,然而對於新上市的產品而言,關聯式法則的運用卻受到支持度及信賴區間最小門檻值的限制。


    The association rule is one of the frequently adopted techniques in data mining. However, it practically limited to the minimum support and confidence for newly marketed products.

    When association rules A→B and A→C can not be discovered from the database, it does not mean that A→B∨C will not be an association rule from the same database. In fact, when A is the newly marketed product, A→B∨C shall be a very useful rule in some cases.

    Therefore, we propose a new and very simple algorithm to discover this type of rules. Since the consequent item of this kind of rule is formed by a disjunctive composite item, we call this type of rules as the disjunctive consequent association rules. Moreover, when we apply our algorithm to insurance policy for cross selling, the useful results have been proven by the insurance company.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    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