-
1
-
-
84861259385
-
-
http://www.almaden.ibm.com/cs/quest/syndata.html, 2003.
-
(2003)
-
-
-
2
-
-
84861269418
-
-
http://www.almaden.ibm.com/cs/people/bayardo/resources.html, 2003.
-
(2003)
-
-
-
3
-
-
84861259389
-
-
http://fimi.cs.helsinki.fi, 2003.
-
(2003)
-
-
-
4
-
-
84861266475
-
-
http://www-sal.cs.uiuc.edu/~hanj/pubs/software.htm, 2004.
-
(2004)
-
-
-
5
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
May
-
R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
-
(1993)
Proc. ACM-SIGMOD Int'l Conf. Management of Data
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
10
-
-
0035007850
-
MAFIA: A maximal frequent itemset algorithm for transactional databases
-
Apr.
-
D. Burdick, M. Calimlim, and J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," Proc. Int'l Conf. Data Eng., pp. 443-452, Apr. 2001.
-
(2001)
Proc. Int'l Conf. Data Eng.
, pp. 443-452
-
-
Burdick, D.1
Calimlim, M.2
Gehrke, J.3
-
13
-
-
19544379860
-
Mining frequent itemsets from secondary memory
-
Nov.
-
G. Grahne and J. Zhu, "Mining Frequent Itemsets from Secondary Memory," Proc. IEEE Int'l Conf. Data Mining, pp. 91-98, Nov. 2004.
-
(2004)
Proc. IEEE Int'l Conf. Data Mining
, pp. 91-98
-
-
Grahne, G.1
Zhu, J.2
-
14
-
-
0039253846
-
Mining frequent patterns without candidate generation
-
May
-
J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 1-12, May 2000.
-
(2000)
Proc. ACM-SIGMOD Int'l Conf. Management of Data
, pp. 1-12
-
-
Han, J.1
Pei, J.2
Yin, Y.3
-
15
-
-
2442449952
-
Mining frequent patterns without candidate generation: A frequent-pattern tree approach
-
J. Han, J. Pei, Y. Yin, and R. Mao, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach," Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 53-87, 2004.
-
(2004)
Data Mining and Knowledge Discovery
, vol.8
, Issue.1
, pp. 53-87
-
-
Han, J.1
Pei, J.2
Yin, Y.3
Mao, R.4
-
16
-
-
78149328321
-
Mining top-K frequent closed patterns without minimum support
-
Dec.
-
J. Han, J. Wang, Y. Lu, and P. Tzvetkov, "Mining Top-K Frequent Closed Patterns without Minimum Support," Proc. Int'l Conf. Data Mining, pp. 211-218, Dec. 2002.
-
(2002)
Proc. Int'l Conf. Data Mining
, pp. 211-218
-
-
Han, J.1
Wang, J.2
Lu, Y.3
Tzvetkov, P.4
-
17
-
-
0005187580
-
Metarule-guided mining of multi-dimensional association rules using data cubes
-
Aug.
-
M. Kamber, J. Han, and J. Chiang, "Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes," Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 207-210, Aug. 1997.
-
(1997)
Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining
, pp. 207-210
-
-
Kamber, M.1
Han, J.2
Chiang, J.3
-
19
-
-
22944460628
-
AFOPT: An efficient implementation of pattern growth approach
-
CEUR Workshop Proc., Nov.
-
G. Liu, H. Lu, J.X. Yu, W. Wei, and X. Xiao, "AFOPT: An Efficient Implementation of Pattern Growth Approach," Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations, CEUR Workshop Proc., vol. 80, Nov. 2003.
-
(2003)
Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations
, vol.80
-
-
Liu, G.1
Lu, H.2
Yu, J.X.3
Wei, W.4
Xiao, X.5
-
20
-
-
21944442464
-
Levelwise search and borders of theories in knowledge discovery
-
H. Mannila and H. Toivonen, "Levelwise Search and Borders of Theories in Knowledge Discovery," Data Mining and Knowledge Discovery, vol. 1, no. 3, pp. 241-258, 1997.
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, Issue.3
, pp. 241-258
-
-
Mannila, H.1
Toivonen, H.2
-
21
-
-
0001280495
-
Efficient algorithms for discovering association rules
-
July
-
H. Mannila, H. Toivonen, and I. Verkamo, "Efficient Algorithms for Discovering Association Rules," Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 181-192, July 1994.
-
(1994)
Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining
, pp. 181-192
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, I.3
-
22
-
-
27144468394
-
Discovery of frequent episodes in event sequences
-
H. Mannila, H. Toivonen, and I. Verkamo, "Discovery of Frequent Episodes in Event Sequences," Data Mining and Knowledge Discovery, vol. 1, no. 3, pp. 259-289, 1997.
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, Issue.3
, pp. 259-289
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, I.3
-
23
-
-
27644589420
-
KDCI: A multi-strategy algorithm for mining frequent sets
-
CEUR Workshop Proc., Nov.
-
S. Orlando, C. Lucchese, P. Palmerini, R. Perego, and F. Silvestri, "kDCI: A Multi-Strategy Algorithm for Mining Frequent Sets," Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations, CEUR Workshop Proc., vol. 80, Nov. 2003.
-
(2003)
Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations
, vol.80
-
-
Orlando, S.1
Lucchese, C.2
Palmerini, P.3
Perego, R.4
Silvestri, F.5
-
24
-
-
84911977993
-
Discovering frequent closed itemsets for association rules
-
Jan.
-
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering Frequent Closed Itemsets for Association Rules," Proc. Int'l Conf. Database Theory, pp. 398-416, Jan. 1999.
-
(1999)
Proc. Int'l Conf. Database Theory
, pp. 398-416
-
-
Pasquier, N.1
Bastide, Y.2
Taouil, R.3
Lakhal, L.4
-
25
-
-
0031220368
-
Using a hash-based method with transaction trimming for mining association rules
-
J. Park, M. Chen, and P. Yu, "Using a Hash-Based Method with Transaction Trimming for Mining Association Rules," IEEE Trans. Knowledge and Data Eng. vol. 9, no. 5, pp. 813-825, 1997.
-
(1997)
IEEE Trans. Knowledge and Data Eng.
, vol.9
, Issue.5
, pp. 813-825
-
-
Park, J.1
Chen, M.2
Yu, P.3
-
26
-
-
0002625450
-
CLOSET: An efficient algorithm for mining frequent closed itemsets
-
May
-
J. Pei, J. Han, and R. Mao, "CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets," Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, pp. 21-30, May 2000.
-
(2000)
Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery
, pp. 21-30
-
-
Pei, J.1
Han, J.2
Mao, R.3
-
28
-
-
0002082857
-
An efficient algorithm for mining association rules in large databases
-
Sept.
-
A. Savasere, E. Omiecinski, and S. Navathe, "An Efficient Algorithm for Mining Association Rules in Large Databases," Proc. Int'l Conf. Very Large Data Bases, pp. 432-443, Sept. 1995.
-
(1995)
Proc. Int'l Conf. Very Large Data Bases
, pp. 432-443
-
-
Savasere, A.1
Omiecinski, E.2
Navathe, S.3
-
29
-
-
0002663969
-
Sampling large databases for association rules
-
Sept.
-
H. Toivonen, "Sampling Large Databases for Association Rules," Proc. Int'l Conf. Very Large Data Bases, pp. 134-145, Sept. 1996.
-
(1996)
Proc. Int'l Conf. Very Large Data Bases
, pp. 134-145
-
-
Toivonen, H.1
-
30
-
-
77952363125
-
CLOSET+: Searching for the best strategies for mining frequent closed itemsets
-
Aug.
-
J. Wang, J. Han, and J. Pei, "CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets," Proc. Int'l Conf. Knowledge Discovery and Data Mining, pp. 236-245, Aug. 2003.
-
(2003)
Proc. Int'l Conf. Knowledge Discovery and Data Mining
, pp. 236-245
-
-
Wang, J.1
Han, J.2
Pei, J.3
-
31
-
-
85012157812
-
Star-cubing: Computing iceberg cubes by top-down and bottom-up integration
-
Sept.
-
D. Xin, J. Han, X. Li, and B.W. Wah, "Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration," Proc. Int'l Conf. Very Large Data Bases, pp. 476-487, Sept. 2003.
-
(2003)
Proc. Int'l Conf. Very Large Data Bases
, pp. 476-487
-
-
Xin, D.1
Han, J.2
Li, X.3
Wah, B.W.4
-
32
-
-
84861269417
-
-
B. Goethals and M.J. Zaki, eds., CEUR Workshop Proc., Nov.
-
Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations, B. Goethals and M.J. Zaki, eds., CEUR Workshop Proc., vol. 80, Nov. 2003, http://CEUR-WS.org/Vol-90.
-
(2003)
Proc. IEEE ICDM Workshop Frequent Itemset Mining Implementations
, vol.80
-
-
-
33
-
-
0033718951
-
Scalable algorithms for association mining
-
M.J. Zaki, "Scalable Algorithms for Association Mining," IEEE Trans. Knowledge and Data Mining, vol. 12, no. 3, pp. 372-390, 2000.
-
(2000)
IEEE Trans. Knowledge and Data Mining
, vol.12
, Issue.3
, pp. 372-390
-
-
Zaki, M.J.1
-
34
-
-
0347709684
-
CHARM: An efficient algorithm for closed itemset mining
-
Apr.
-
M.J. Zaki and C. Hsiao, "CHARM: An Efficient Algorithm for Closed Itemset Mining," Proc. SIAM Int'l Conf. Data Mining, pp. 457-473, Apr. 2002.
-
(2002)
Proc. SIAM Int'l Conf. Data Mining
, pp. 457-473
-
-
Zaki, M.J.1
Hsiao, C.2
-
36
-
-
15744380682
-
Smartminer: A depth first algorithm guided by tail information for mining maximal frequent itemsets
-
Dec.
-
Q. Zou, W.W. Chu, and B. Lu, "SmartMiner: A Depth First Algorithm Guided by Tail Information for Mining Maximal Frequent Itemsets," Proc. IEEE Int'l Conf. Data Mining, Dec. 2002.
-
(2002)
Proc. IEEE Int'l Conf. Data Mining
-
-
Zou, Q.1
Chu, W.W.2
Lu, B.3
|