%0 Journal Article
%T Mining Constrained Cube Gradient for the Condensed Data Cube<br>浓缩数据立方中约束立方梯度的挖掘
%A FENG Yu-Cai
%A LIU Yu-Bao
%A FENG Jian-Lin
%A <br>冯玉才
%A 刘玉葆
%A 冯剑琳
%J 软件学报
%D 2003
%I 
%X Constrained cube gradient mining is an important mining task and its goal is to extract the pairs of gradient-probe cell satisfy the gradient constraint from a data cube. However, previous work are explored for a general data cube. In this paper, the problem of the mining constrained cube gradient for a condensed cube is studied. An algorithm named as eLiveSet for the problem is developed through the extension of the existing efficient mining algorithm LiveSet-driven. The experimental results show that the algorithm is more effective than the existing algorithm on the performance of mining constrained cube gradient.
%K data cube
%K cube gradient
%K condensed cube
%K cube computation
%K association rule<br>数据立方
%K 立方梯度
%K 浓缩数据立方
%K 数据立方计算
%K 关联规则
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=5F88B7943E0CA711&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=F3090AE9B60B7ED1&sid=0CCE46DAE11318DE&eid=ADAF655E679AEBA1&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=10