有效率的複合式後項關聯式法則探勘演算法 : 以壽險業為例

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Thesis > Item 987654321/35157

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/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:	在資料採礦中，關聯式法則是經常被使用的技術之一，然而對於新上市的產品而言，關聯式法則的運用卻受到支持度及信賴區間最小門檻值的限制。一般而言，只有當關聯法則A→B和A→C這兩條的支持度和信賴度皆高於最小門檻值時，才表示這兩條法則是有用的。但在現實生活中支持度低可能表示A為較晚推出的產品。另外，當A→B與A→C的信賴度未達門檻值時，並不表示說A→B∨C的信賴度也不會達到門檻值。因此，本論文針對此種狀況，提出複合式後項關聯式法則探勘演算法，發掘出這類有用的規則。並將此法則運用於保險業的產品組合及行銷。由實證結果顯示，主要險種搭配特定的附險銷售時，消費者除了主險外也會一併購買附險。 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:	[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

Files in This Item:

File	Size	Format
	0Kb	Unknown	285	View/Open

Loading...