Online generation of association rules under multi-dimensional consideration based on negative-border

檔案

本條目沒有附加檔案。

日期

2007-01-01

期刊名稱

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING

摘要

Recently, some researchers have developed incremental and online mining approaches to maintain association rules without having to re-process the entire database whenever the database is updated or user specified thresholds are changed. However, they usually can not flexibly obtain association rules or patterns from portions of data, consider problems with different aspects, or provide online decision support for users. We earlier developed an online mining approach for generation of association rules under multidimensional consideration. The multidimensional online mining approach may, however, get loose upper-bound support of candidate itemsets and thus cause excessive I/O and computation costs. In this paper, we attempt to apply the concept of a negative border to enlarge the mining information in the multidimensional pattern relation to help get tighter upper-bound, and thus reduce the number of candidate itemsets to consider. Based oh the extended multidimensional pattern relation, a corresponding online mining approach called Negative-Border Online Mining (NOM) is proposed to efficiently and effectively utilize the information of negative itemset in the negative border. Experiments for heterogeneous datasets are also performed to show the effectiveness of the proposed approach.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Wang, C.-Y., Tseng, S.-S., Hong, T.-P., & Chu, Y.-S. (2007). Online generation of association rules under multi-dimensional consideration based on negative-border. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 23(1), 233–242. https://ir.lib.nycu.edu.tw/handle/11536/5813

BibTeX RIS

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

分享

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