查詢結果分析
來源資料
相關文獻
- 針對重要稀少性資料之一種有效率關聯式探勘方法設計
- 臺灣南島語的語言關係
- 臺灣地區商業化香菇品系之類緣探討與分群研究
- 彈性網應用於分群問題之初探
- Improved Clustering Algorithm Using GLA with Grey Relational Analysis
- A Graph-Based Approach to Discovering Multiple-Level Association Rules from Large Databases
- 「創新」之間--從博山方言論「入聲演變」、「方言分群」以及「變調即原調」
- 線上教材瀏覽模式之分析工具--資料探勘模式在網路學習課程之發展與應用實例
- 探勘中文新聞文件
- 使用語者分群模型的語音辨識方法
頁籤選單縮合
題 名 | 針對重要稀少性資料之一種有效率關聯式探勘方法設計=An Efficient Method for Mining Association Rules on Significant Rare Data |
---|---|
作 者 | 龔旭陽; 林美賢; 林靖祐; 賴威光; | 書刊名 | 資訊管理學報 |
卷 期 | 17:1 2010.01[民99.01] |
頁 次 | 頁133-155 |
分類號 | 312.13 |
關鍵詞 | 關聯法則; 重要稀少性資料; 最大半高頻項目集; 分群; 相對支持度; Association rule; Significant rare data; Semi-frequent itemsets; Cluster; Decomposition; |
語 文 | 中文(Chinese) |
中文摘要 | 關聯法則(Association Rules)廣泛應用於資料探勘研究方法,於過往研究中,大都針對支持度(Support)較高之高頻項目集(Frequent ItemSets)進行探勘,然而卻無法迅速且有效探勘出支持度小但卻擁有重要關聯性之重要稀少性資料(Significant Rare Data),亦即所謂之半高頻項目集(Semi-frequent ItemSets)。現今有部份研究針對具備重要關連法則之稀少性資料,進行相關探勘方法設計,其方法大都採用由下而上(Bottom-Up)搜尋方式,但往往無法有效率探勘出最大半高頻項目集(Maximal Semi-frequent ItemSets)。針對上述問題,本研究提出與設計專門針對重要稀少性資料之最大半高頻項目集探勘演算法(Maximum Semi-frequent Itemsets Algorithm, MSIA),MSIA可有效整合分群(Cluster)與分解(Decomposition)探勘概念,並結合篩選法(Filter)與相對支持度(Relative Support)分析方法,採由上而下(Top-Down)之搜尋機制進行高效率最大半高頻項目集探勘。由效能實驗結果可知,MSIA於探勘過程中可以有效降低原始來源資料庫(Source Database)讀取掃描次數,提升探勘效能以節省探勘時所花費之時間成本,進而有效且快速取得重要稀少性資料中之最大半高頻項目集。 |
英文摘要 | Mining out the association rules is the popular research issue in data mining research. In recent years, many studies have focused on discovering the important association rules based on the criteria of maximum support and confidence for frequent itemsets. The significant rare data, i.e., the semi-frequently itemsets, are not easily to mine out the important association rules using traditional mining methods. Some mining methods based on the bottom-up policy can not efficiently mine out association rules from longer length of semi-frequent itemsets. The time complexity of mining process is very high due to the generation of large candidates by repeatedly scanning source database. This research proposed the maximum semi-frequent itemsets algorithm (MSIA), which quickly and efficiently mining out the association rules on the significant rare data. MSIA is a top-down approach by combining the techniques of clustering, decomposition, filtering, and relative supports to efficiently search the source database. From the performance of experiment results, the MSIA can decrease the time complexity of scanning database and thus significantly reduce the number of candidate itemsets. MSIA efficiently mines out the useful association rules from the maximum semi-frequent itemsets. |
本系統中英文摘要資訊取自各篇刊載內容。