Design An Efficient Incremental Data Mining Algorithm Based on Pre_large Technique

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Journal Articles > Item 987654321/31605

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/31605

Title:	Design An Efficient Incremental Data Mining Algorithm Based on Pre_large Technique
Authors:	游坤明 Yu, K.M.
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	資料探勘;關聯式法則;樹狀結構;漸進式;準高頻
Date:	2006
Issue Date:	2014-06-27 01:32:43 (UTC+8)
Abstract:	本研究主要針對關聯式法則的漸進式探勘演算法進行研究，關聯式法則的漸進式探勘演算法即是希望能夠藉由保留某些上一次探勘後的相關資訊，能夠不需要再度處理舊有資料便能夠維持關聯式法則的正確性與有效性。本研究運用尋訪速度快的二元樹結構，以及用以降低項目在高頻與非高頻之間變動機率的準高頻(Pre_large)觀念，在盡量減少掃描資料庫的次數情況下，提出一個有效率的、可靠的漸進式探勘演算法-Pre_large Descending frequent pattern Binary-tree Algorithm(PDBA)
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Articles

Files in This Item:

File	Description	Size	Format
p_e331_0144.pdf		50Kb	Adobe PDF	46	View/Open