使用關聯式法則解決決策樹不相關值問題

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 學位論文 > Item 987654321/34995

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/34995

题名:	使用關聯式法則解決決策樹不相關值問題
其它题名:	Remove the irrelevant values problem in the decision tree by using association rule
作者:	林靜宜;Lin, Ching-yi
贡献者:	淡江大學資訊工程學系碩士在職專班蔣定安;Chiang, Ding-an
关键词:	決策樹;不相關值問題;離散化;關聯式法則;Decision tree;Irrelevant Value;Discretization;association rule
日期:	2009
上传时间:	2010-01-11 05:52:42 (UTC+8)
摘要:	決策樹的特點是以遞迴的計算方式，透過由上而下和各別擊破的策略，但是在建構決策樹中有可能產生「不相關值問題」，同時因決策樹樹狀的結構，在移除不相關值後，切點的選擇也會因而改變，另一方面，決策樹在處理連續型數值屬性離散化是利用區域離散化的方式處理，而區域離散化必須考慮到屬性之間的相依性關係，若屬性之間不存在相依性關係，則全域離散化比區域離散化較好。因此，在本文裡提出了移除不相關值問題的方法，並且利用關聯法則，整合分類法則樣版與全域離散化後的屬性切點，同時提出一個分類器建構方法以整合所有的分類法則。由本論文所提出方法的實驗結果，不僅移除了不相關值，且透過關聯法則整合全域切點後更精準。 The characteristics of the decision tree is based recursive formula, through top-down and divide-and-conquer. However, decision tree construction may have the irrelevant values problem, at the same time, the tree structure of decision tree, remove irrelevant values, the choice of cut-off point will also be changed. On the other hand, discretization techniques of the decision tree is local method , and local method must have between attributes and attribute dependency relationship, if there is no dependency, then the global of discretization methods are better than the local of discretization methods. As a result, in this paper has been proposed to remove the irrelevant values problem, and the use of association rules, classification rules like the integration with the global discrete of the attributes after the cut-off point, at the same time to propose a method to build classifiers to integrate all of the classification rules. By the thesis of the proposed method of experimental results, not only to remove the relevant values, and using association rules integrate into the global cut-off point are more accurate .
显示于类别:	[資訊工程學系暨研究所] 學位論文

文件中的档案:

档案	大小	格式	浏览次数
	0Kb	Unknown	297	检视/开启

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

TAIR相关文章

数据加载中.....