Using data cube for mining of hybrid-dimensional association rules

被引:0
作者
Li, ZJ [1 ]
Huang, FX
Zhou, DQ
Zhang, P
机构
[1] Dalian Univ Technol, Dept Comp, Liaoning 116024, Peoples R China
[2] Dalian Univ Technol, Software Sch, Liaoning 116024, Peoples R China
[3] Dalian Univ Technol, Inst Informat & Decis Technol, Liaoning 116024, Peoples R China
来源
GRID AND COOPERATIVE COMPUTING, PT 2 | 2004年 / 3033卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, the mining of single-dimensional association rule and non-repetitive predicate multi-dimensional association rule were integrated. We proposed an algorithm for mining of hybrid-dimensional association rule using a data cube structure. Preliminary result shows that when the number of tuples is large, the algorithm is efficient.
引用
收藏
页码:899 / 902
页数:4
相关论文
共 4 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
Agrawal R, 1994, P 20 INT C VER LARG, V1215, P487
[3]   Data mining: An overview from a database perspective [J].
Chen, MS ;
Han, JW ;
Yu, PS .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (06) :866-883
[4]  
Piatetsky-Shapiro G., 1991, Knowledge discovery in databases, P229