-
1
-
-
84911977993
-
Discovering frequent closed itemsets for association rules
-
Beeri C.(ed.), Jerusalem: Springer-Verlag
-
Pasquier N, Bastide Y, Taouil R, Lakhal L. Discovering frequent closed itemsets for association rules. In: Beeri C, et al, eds. Proc. of the 7th Int'l. Conf. on Database Theory. Jerusalem: Springer-Verlag, 1999. 398-416.
-
(1999)
Proc. of the 7th Int'l. Conf. on Database Theory
, pp. 398-416
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
2
-
-
0001882616
-
Fast algorithms for mining association rules
-
Beeri C.(ed.), Santiago: Morgan Kaufmann Publishers
-
Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Beeri C, et al, eds. Proc. of the 20th Int'l. Conf. on Very Large Databases. Santiago: Morgan Kaufmann Publishers, 1994. 487-499.
-
(1994)
Proc. of the 20th Int'l. Conf. on Very Large Databases
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
-
3
-
-
0002625450
-
CLOSET: An efficient algorithm for mining frequent closed itemsets
-
Gunopulos D.(ed.), Dallas: ACM Press
-
Pei J, Han J, Mao R. CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Gunopulos D, et al, eds. Proc. of the 2000 ACM SIGMOD Int'l. Workshop on Data Mining and Knowledge Discovery. Dallas: ACM Press, 2000. 21-30.
-
(2000)
Proc. of the 2000 ACM SIGMOD Int'l. Workshop on Data Mining and Knowledge Discovery
, pp. 21-30
-
-
Pei, J.1
Han, J.2
Mao, R.3
-
4
-
-
0035007850
-
MAFIA: A maximal frequent itemset algorithm for transactional databases
-
Georgakopoulos D.(ed.), Heidelberg: IEEE Press
-
Burdick D, Calimlim M, Gehrke J. MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Georgakopoulos D, et al, eds. Proc. of the 17th Int'l. Conf. on Data Engineering. Heidelberg: IEEE Press, 2001. 443-452.
-
(2001)
Proc. of the 17th Int'l. Conf. on Data Engineering
, pp. 443-452
-
-
Burdick, D.1
Calimlim, M.2
Gehrke, J.3
-
5
-
-
0347709684
-
CHARM: An efficient algorithm for closed itemset mining
-
Grossman R.(ed.), Arlington: SIAM
-
Zaki MJ, Hsiao CJ. CHARM: An efficient algorithm for closed itemset mining. In: Grossman R, et al, eds. Proc. of the 2nd SIAM Int'l. Conf. on Data Mining. Arlington: SIAM, 2002. 12-28.
-
(2002)
Proc. of the 2nd SIAM Int'l. Conf. on Data Mining
, pp. 12-28
-
-
Zaki, M.J.1
Hsiao, C.J.2
-
6
-
-
0242709391
-
Mining frequent item sets by opportunistic projection
-
Hand D.(ed.), Alberta: ACM Press
-
Liu JQ, Pan YH, Wang K, Han J. Mining frequent item sets by opportunistic projection. In: Hand D, et al, eds. Proc. of the 8th ACM SIGKDD Int'l. Conf. on Knowledge Discovery and Data Mining. Alberta: ACM Press, 2002. 229-238.
-
(2002)
Proc. of the 8th ACM SIGKDD Int'l. Conf. on Knowledge Discovery and Data Mining
, pp. 229-238
-
-
Liu, J.Q.1
Pan, Y.H.2
Wang, K.3
Han, J.4
-
7
-
-
2442586054
-
Quest synthetic data generation code
-
San Jose: IBM Almaden Research Center
-
Srikant R. Quest synthetic data generation code. San Jose: IBM Almaden Research Center, 1994. http://www.almaden.ibm.com/software/quest/Resources/index.shtml
-
(1994)
-
-
Srikant, R.1
-
8
-
-
0003408496
-
UCI repository of machine learning
-
Irvine University of California, Department of Information and Computer Science
-
Blake C, Merz C. UCI Repository of machine learning. Irvine University of California, Department of Information and Computer Science, 1998. http://www.ics.uci.edu/-mlearn/MLRepository.html
-
(1998)
-
-
Blake, C.1
Merz, C.2
|