|
基于HOLAP的關(guān)聯(lián)規(guī)則挖掘
（作者未知） 2010/6/11
摘要：本文提出了一種基于關(guān)系數(shù)據(jù)庫和一維內(nèi)存數(shù)組相結(jié)合的HOLAP的實(shí)現(xiàn)方式，以及基于這種數(shù)據(jù)立方體的改進(jìn)的關(guān)聯(lián)規(guī)則挖掘算法。在預(yù)處理的基礎(chǔ)上，減少掃描空間和掃描次數(shù)，利用聚合數(shù)據(jù)減少計(jì)算時(shí)間，以達(dá)到一種OLAP和數(shù)據(jù)挖掘相結(jié)合的高效模式。
Abstract: In this article, we introduced a realization of HOLAP based on the RDBMS and one dimensional cache array. An improved association rule mining algorithm on this kind of data cube was presented at the same time. Pre-processing of data helps to reduce the room and times for scan. Information of multidimensional aggregation reduce the time on computation. The goal of this article is to generalize a combined efficient paten of OLAP and data mining.
關(guān)鍵詞：OLAP，HOLAP，數(shù)據(jù)立方體，聚合計(jì)算，關(guān)聯(lián)規(guī)則，數(shù)據(jù)挖掘
......
附件下載：點(diǎn)擊此處可以下載并閱讀全文
|