Efficient mining of association rules by reducing the number of passes over the database |
| |
| Authors: | Qingzhong Li Haiyang Wang Zhongmin Yan Shaohan Ma |
| |
| Affiliation: | (1) Institute of Computing Technology, The Chinese Academy of Sciences, 100080 Beijing, P.R. China;(2) Department of Computer Science, Shandong University, 250100 Jinan, P.R. China |
| |
| Abstract: | This paper introduces a new algorithm of mining association rules. The algorithm RP counts the itemsets with different sizes
in the same pass of scanning over the database by dividing the database intom partitions. The total number of passes over the database is only (k+2m-2)/m, wherek is the longest size in the itemsets. It is much less thank.
LI Qingzhong received his B.S. degree in computer software form Shandong University in 1989 and his Ph.D. degree in computer science and
technology from Institute of Computing Technology, The Chinese Academy of Sciences in 2000. He is now an associate professor
of Shandong University. His research interests include database systems, data mining.
WANG Haiyang received his B.S. degree in computer software from Shandong University in 1988 and his Ph.D. degree in computer science and
technology from Institute of Computing Technology, The Chinese Academy of Sciences in 1999. He is now a professor of Shandong
University. His research interests include database systems, data flow system.
YAN Zhongmin is now a B.S. candidate of Department of Computer Science of Shandong University. Her research interests include database
systems, data mining.
MA Shaohan is now a professor of Shandong University. He is also a Supervisor of Ph.D. candidates. His research interests include algorithm
analysis, artificial intelligence. |
| |
| Keywords: | data mining association rule itemset large itemset |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
