國立高雄大學圖資館 |

有效權重資料探勘方法之研究 = A Study on Efficient Approaches for Weighted Data Mining

紀錄類型:	書目-語言資料,印刷品 : 單行本
並列題名:	A Study on Efficient Approaches for Weighted Data Mining
作者:	李弘裕,
其他團體作者:	國立高雄大學
出版地:	[高雄市]
出版者:	撰者;
出版年:	2012[民101]
面頁冊數:	115面圖，表格 : 30公分;
標題:	資料探勘
標題:	Data mining association-rule mining
附註:	104年10月31日公開
附註:	參考書目：面96-102
摘要註:	於資料探勘的領域內，權重資料探勘因其實用性，在最近幾年被廣泛的討論。與過去的關聯規則探勘方法不同，權重探勘給予項目適當的權重以表示此項目在資料集合的重要性，這樣出現次數低但重要性高的項目集合可以被找出。只是，關聯規則探勘裡的向下封閉性在權重資料探勘裡不會成立。雖然過去使用的高估模型可以產生向下封閉性，可是在探勘過程，很多不需要產生的候選項目仍然會被產生。為了解決這個問題，我們設計了幾個有效率權重項目探勘方法與權重序列探勘方法。在權重項目探勘的議題中，我們提出採用一筆交易資料裡面最高權重當做高估值的新高估模型以得到比之前更準確的高估值。另外，兩個有效率的機制，修剪與過濾，被設計出去更進一步改善高估模型。為了有效率的使用新的高估模型與機制，我們先提出了投影基底演算法結合改進的高估模型，然後，另外一個投影基底演算法結合改進高估模型與有效的改進機制被提出並應用在找出權重項目。另一方面，在權重項目集探勘所提的概念可以被進一步的擴展到權重序列探勘。最後，實驗結果顯示出我們所提演算法之效能於不同的資料參數設定下優於之前的權重探勘演算法。 Weighted data mining in the field of data mining has been widely discussed in recent years due to its various practical applications. Different from traditional association-rule mining, an item on weighted data mining is flexibly given a suitable weight value to represent its importance in a database, and then weighted frequent itemsets can be found from a database. But, the downward-closure property in association-rule mining can be not kept in the weighted data mining. Although traditional upper-bound model can be applied to achieve the goal, lots of unpromising candidate itemsets still have to be generated by using the traditional model. To address this, we thus develop several efficient methods for mining weighted frequent itemsets and weighted sequential patterns.For the issue of weighted itemset mining, a new upper-bound model, which adopts the maximum weight in a transaction as upper-bound of the transaction, is first proposed to obtain more accurate upper-bound for itemsets. In addition, two effective strategies, pruning and filtering, are designed to further improve the model. To effectively utilize the model and strategies, the two efficient algorithms, projection-based weighted mining algorithms based on the improved upper-bound approach with the pruning strategy and projection-based weighted mining algorithms based on the improved upper-bound approach with effective strategies, are proposed for finding weighted frequent itemsets in databases. On the other hand, the proposed concepts on weighted itemset mining can be further extended to the problem of weighted sequential pattern mining. Finally, the experimental results on the synthetic and real datasets also show the performance of the proposed algorithms outperforms the traditional weighted mining algorithms under various parameter settings.

有效權重資料探勘方法之研究 = A Study on Efficient Approaches for Weighted Data Mining
李, 弘裕

有效權重資料探勘方法之研究 = A Study on Efficient Approaches for Weighted Data Mining / 李弘裕撰 - [高雄市] : 撰者, 2012[民101]. - 115面 ; 圖，表格 ; 30公分.
104年10月31日公開參考書目：面96-102.
資料探勘Data mining association-rule mining

有效權重資料探勘方法之研究 = A Study on Efficient Approaches for Weighted Data Mining
LDR:04506nam0a2200289 450 001 346196
005 20170214092740.0
009 346196
010 0 $b 精裝
010 0 $b 平裝
100 $a 20170214d2012 k y0chiy50 e
101 1 $a eng $d chi $d eng
102 $a tw
105 $a ak am 000yy
200 1 $a 有效權重資料探勘方法之研究 $d A Study on Efficient Approaches for Weighted Data Mining $z eng $f 李弘裕撰
210 $a [高雄市] $c 撰者 $d 2012[民101]
215 0 $a 115面 $c 圖，表格 $d 30公分
300 $a 104年10月31日公開
300 $a 參考書目：面96-102
314 $a 指導教授：洪宗貝博士，藍國誠博士
328 $a 碩士論文--國立高雄大學資訊工程學系碩士班
330 $a 於資料探勘的領域內，權重資料探勘因其實用性，在最近幾年被廣泛的討論。與過去的關聯規則探勘方法不同，權重探勘給予項目適當的權重以表示此項目在資料集合的重要性，這樣出現次數低但重要性高的項目集合可以被找出。只是，關聯規則探勘裡的向下封閉性在權重資料探勘裡不會成立。雖然過去使用的高估模型可以產生向下封閉性，可是在探勘過程，很多不需要產生的候選項目仍然會被產生。為了解決這個問題，我們設計了幾個有效率權重項目探勘方法與權重序列探勘方法。在權重項目探勘的議題中，我們提出採用一筆交易資料裡面最高權重當做高估值的新高估模型以得到比之前更準確的高估值。另外，兩個有效率的機制，修剪與過濾，被設計出去更進一步改善高估模型。為了有效率的使用新的高估模型與機制，我們先提出了投影基底演算法結合改進的高估模型，然後，另外一個投影基底演算法結合改進高估模型與有效的改進機制被提出並應用在找出權重項目。另一方面，在權重項目集探勘所提的概念可以被進一步的擴展到權重序列探勘。最後，實驗結果顯示出我們所提演算法之效能於不同的資料參數設定下優於之前的權重探勘演算法。 Weighted data mining in the field of data mining has been widely discussed in recent years due to its various practical applications. Different from traditional association-rule mining, an item on weighted data mining is flexibly given a suitable weight value to represent its importance in a database, and then weighted frequent itemsets can be found from a database. But, the downward-closure property in association-rule mining can be not kept in the weighted data mining. Although traditional upper-bound model can be applied to achieve the goal, lots of unpromising candidate itemsets still have to be generated by using the traditional model. To address this, we thus develop several efficient methods for mining weighted frequent itemsets and weighted sequential patterns.For the issue of weighted itemset mining, a new upper-bound model, which adopts the maximum weight in a transaction as upper-bound of the transaction, is first proposed to obtain more accurate upper-bound for itemsets. In addition, two effective strategies, pruning and filtering, are designed to further improve the model. To effectively utilize the model and strategies, the two efficient algorithms, projection-based weighted mining algorithms based on the improved upper-bound approach with the pruning strategy and projection-based weighted mining algorithms based on the improved upper-bound approach with effective strategies, are proposed for finding weighted frequent itemsets in databases. On the other hand, the proposed concepts on weighted itemset mining can be further extended to the problem of weighted sequential pattern mining. Finally, the experimental results on the synthetic and real datasets also show the performance of the proposed algorithms outperforms the traditional weighted mining algorithms under various parameter settings.
510 1 $a A Study on Efficient Approaches for Weighted Data Mining $z eng
610 0 $a 資料探勘 $a 關聯規則探勘 $a 序列樣式探勘 $a 權重項目集探勘 $a 權重序列樣式探勘 $a 高估值 $a 修剪機制
610 1 $a Data mining association-rule mining $a sequential pattern mining $a weighted itemset mining $a weighted sequential pattern mining $a upper bound $a pruning strategy
681 $a 008M/0019 $b 464103 4013 $v 2007年版
700 1 $a 李 $b 弘裕 $4 撰 $3 576410
712 0 2 $a 國立高雄大學 $b 資訊工程學系碩士班 $3 353878
801 0 $a tw $b NUK $c 20121107 $g CCR
856 7 $h ttp://handle.ncl.edu.tw/11296/ndltd/08143356469873281876