MINING TEMPORAL RARE UTILITY ITEMSETS IN LARGE DATABASES USING RELATIVE UTILITY THRESHOLDS

檔案

本條目沒有附加檔案。

日期

2008-11-01

類型

期刊名稱

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL

卷期與頁次

第 4 卷第 11 期,頁 2775–2792

ISSN

1349-4198

語言

英文

摘要

Utility itemsets are considered to be the different values of individual items such as utilities, and utility mining and aims at identifying the itemsets with highest utilities. The temporal significant rare utility itemsets are those itemsets which appear infrequently in the current time window of large databases but are highly associated with specific data. In this paper, we propose two novel algorithms, namely TP-RUI (Two-Phase Rare Utility Itemsets) -Mine and TRUI (Temporal Rare Utility Itemsets) -Mine, for mining temporal rare utility itemsets from temporal databases. To the best of our knowledge, this is the first work on mining temporal rare utility itemsets from temporal databases. The novel contribution of TRUI-Mine is particularly that it can effectively identify the temporal rare utility itemsets by generating fewer temporal high transaction-weighted utilization 2-itemsets in temporal databases. In this way, the process under all time windows of temporal databases can be achieved effectively with limited memory space, less candidate itemsets and CPU I/O time. The experimental results show that TRUI-Mine can discover the temporal rare utility itemsets with higher performance and less candidate itemsets compared to the other algorithm TP-RUI-Mine that is also proposed in this paper by us under various experimental conditions.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chu, C.-J., Tseng, V. S., & Liang, T. (2008). MINING TEMPORAL RARE UTILITY ITEMSETS IN LARGE DATABASES USING RELATIVE UTILITY THRESHOLDS. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 4(11), 2775–2792. https://ir.lib.nycu.edu.tw/handle/11536/8189

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8189