Full Text:
<2589>
CLC number: TP31
On-line Access:
Received: 2005-06-11
Revision Accepted: 2005-10-22
Crosschecked: 0000-00-00
Cited: 1
Clicked: 5667
A novel algorithm for frequent itemset mining in data warehouses
| |||||||||||||
Xu Li-jun, Xie Kang-lin. A novel algorithm for frequent itemset mining in data warehouses[J]. Journal of Zhejiang University Science A, 2006, 7(2): 216-224.
@article{title="A novel algorithm for frequent itemset mining in data warehouses",
author="Xu Li-jun, Xie Kang-lin",
journal="Journal of Zhejiang University Science A",
volume="7",
number="2",
pages="216-224",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.A0216"
}
%0 Journal Article
%T A novel algorithm for frequent itemset mining in data warehouses
%A Xu Li-jun
%A Xie Kang-lin
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 2
%P 216-224
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A0216
TY - JOUR
T1 - A novel algorithm for frequent itemset mining in data warehouses
A1 - Xu Li-jun
A1 - Xie Kang-lin
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 2
SP - 216
EP - 224
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A0216
Abstract: Current technology for frequent itemset mining mostly applies to the data stored in a single transaction database. This paper presents a novel algorithm MultiClose for frequent itemset mining in data warehouses. MultiClose respectively computes the results in single dimension tables and merges the results with a very efficient approach. close itemsets technique is used to improve the performance of the algorithm. The authors propose an efficient implementation for star schemas in which their algorithm outperforms state-of-the-art single-table algorithms.
[1] Agrawal, R., Srikant, R., 1994. Fast Algorithms for Mining Association Rules. Proceedings of the International Conference on Very Large Databases, p.487-499.
[2] Agrawal, R., Imilienski, T., Swami, A., 1993. Mining Association Rules Between Sets of Items in Large Databases. Proceedings of the ACM SIGMOD International Conference on the Management of Data, p.207-216.
[3] Cristofor, L., Simovici, D., 2001. Mining Association Rules in Entity-relationship Modeled Databases. Technical Report TR-01-01, Computer Science Department, University of Massachusetts.
[4] Han, J., Pei, J., Yin, Y., 2000. Mining Frequent Patterns without Candidate Generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, p.1-12.
[5] Han, J., Wang, J., Lu, Y., Tzvetkov, P., 2002. Mining Top-K Frequent Closed Patterns without Minimum Support. Proceedings of the IEEE International Conference on Data Mining, p.211-218.
[6] Inmon, W.H., 1996. Building the Data Warehouse, 2nd Edition. Wiley, Chichester.
[7] Jensen, V.C., Soparkar, N., 2000. Frequent Itemset Counting across Multiple Tables. Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, p.49-61.
[8] Ng, K., Fu, W., Wang, K., 2002. Mining Association Rules from Stars. Proceedings of the IEEE International Conference on Data Mining, p.322-329.
[9] Pasquier, N., Bastide, Y., Taouil, R., Lakha, L., 1999. DisCovering Frequent Closed Itemsets for Association Rules. Proceedings of the 7th International Conference on Database Theory, p.398-416.
[10] Pei, J., Han, J., Mao, R., 2000. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, p.21-30
[11] Shenoy, P., Haritsa, J.R., Sundarshan, S., Bhalotia, G., Bawa, M., Shah, D., 2000. Turbo-charging Vertical Mining of Large Databases. Proceedings of ACM SIGMOD International Conference on Management of Data, p.22-33.
[12] Zaki, M.J., Hsiao, C.J., 2002. CHARM: An Efficient Algorithm for Closed Itemset Mining. Proceedings of SIAMOD International Conference on Data Mining, p.457-473.
[13] Zaki, M.J., Gouda, K., 2003. Fast Vertical Mining Using Diffsets. Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p.326-335.
Open peer comments: Debate/Discuss/Question/Opinion
<1>