-
1
-
-
0031162961
-
Dynamic itemset counting and implication rules for market basket data
-
S. Brin, R. Motwani, J. Ullman, and S. Tsur, "Dynamic Itemset Counting and Implication Rules for Market Basket Data," Proc. ACM Special Interest Group on Management of Data, pp. 255-264, 1997.
-
(1997)
Proc. ACM Special Interest Group on Management of Data
, pp. 255-264
-
-
Brin, S.1
Motwani, R.2
Ullman, J.3
Tsur, S.4
-
3
-
-
84869158135
-
Finding frequent items in data streams
-
M. Charikar, K. Chen, and M. Farach-Colton, "Finding Frequent Items in Data Streams," Proc. 29th Int'l Colloquium Automata, Language, and Programming, pp. 693-703, 2002.
-
(2002)
Proc. 29th Int'l Colloquium Automata
, pp. 693-703
-
-
Charikar, M.1
Chen, K.2
Farach-Colton, M.3
-
6
-
-
30344444271
-
EstWin: Online data stream mining of recent frequent itemsets by sliding window method
-
J.H. Chang and W.S. Lee, "estWin: Online Data Stream Mining of Recent Frequent Itemsets by Sliding Window Method," J. Information Science, vol.31, no.2, pp. 76-90, 2005.
-
(2005)
J. Information Science
, vol.31
, Issue.2
, pp. 76-90
-
-
Chang, J.H.1
Lee, W.S.2
-
7
-
-
33745458995
-
Mining compressed frequent-pattern sets
-
D. Xin, J. Han, X. Yan, and H. Cheng, "Mining Compressed Frequent-Pattern Sets," Proc. 31st Int'l Conf. Very Large Data Bases, pp. 709-720, 2005.
-
(2005)
Proc. 31st Int'l Conf. Very Large Data Bases
, pp. 709-720
-
-
Xin, D.1
Han, J.2
Yan, X.3
Cheng, H.4
-
8
-
-
19544377965
-
Moment: Maintaining closed frequent itemsets over a stream sliding window
-
Y. Chi, H. Wang, P.S. Yu, and R.R. Muntz, "Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window," Proc. Fourth IEEE Int'l Conf. Data Mining, pp. 59-66, 2004.
-
(2004)
Proc. Fourth IEEE Int'l Conf. Data Mining
, pp. 59-66
-
-
Chi, Y.1
Wang, H.2
Yu, P.S.3
Muntz, R.R.4
-
10
-
-
34248150950
-
Mining maximal frequent itemsets from data streams
-
G. Mao, X. Wu, X. Zhu, and G. Chen, "Mining Maximal Frequent Itemsets from Data Streams," J. Information Science, vol.33, no.3, pp. 251-262, 2007.
-
(2007)
J. Information Science
, vol.33
, Issue.3
, pp. 251-262
-
-
Mao, G.1
Wu, X.2
Zhu, X.3
Chen, G.4
-
11
-
-
49749089668
-
EstMax: Tracing maximal frequent itemsets over online data streams
-
H.J. Woo and W.S. Lee, "estMax: Tracing Maximal Frequent Itemsets over Online Data Streams," Proc. Seventh IEEE Int'l Conf. Data Mining, pp. 709-714, 2007.
-
(2007)
Proc. Seventh IEEE Int'l Conf. Data Mining
, pp. 709-714
-
-
Woo, H.J.1
Lee, W.S.2
-
13
-
-
0034592748
-
Depth first generation of long patterns
-
R.C. Agarwal, C.C. Aggarwal, and V.V.V. Prasad, "Depth First Generation of Long Patterns," Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 108-118, 2000.
-
(2000)
Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining
, pp. 108-118
-
-
Agarwal, R.C.1
Aggarwal, C.C.2
Prasad, V.V.V.3
-
14
-
-
8644256210
-
Dynamically maintaining frequent items over a data stream
-
C. Jin, W. Qian, C. Sha, J.X. Yu, and A. Zhou, "Dynamically Maintaining Frequent Items over a Data Stream," Proc. 12th ACM Int'l Conf. Information and Knowledge Management, pp. 287-294, 2003.
-
(2003)
Proc. 12th ACM Int'l Conf. Information and Knowledge Management
, pp. 287-294
-
-
Jin, C.1
Qian, W.2
Sha, C.3
Yu, J.X.4
Zhou, A.5
-
15
-
-
70349324470
-
False-negative frequent items mining from data streams with bursting
-
Z. Chong, J.X. Yu, H. Lu, Z. Zhang, and A. Zhou, "False-Negative Frequent Items Mining from Data Streams with Bursting," Proc. 10th Int'l Conf. Database Systems for Advanced Applications, pp. 422-434, 2003.
-
(2003)
Proc. 10th Int'l Conf. Database Systems for Advanced Applications
, pp. 422-434
-
-
Chong, Z.1
Yu, J.X.2
Lu, H.3
Zhang, Z.4
Zhou, A.5
-
16
-
-
77952363125
-
Closet+: Searching for the Best Strategies for Mining Frequent Closed Itemsets
-
J. Wang, J. Han, and J. Pei, "Closet+: Searching for the Best Strategies for Mining Frequent Closed Itemsets," Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, pp. 236-245, 2003.
-
(2003)
Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining
, pp. 236-245
-
-
Wang, J.1
Han, J.2
Pei, J.3
-
17
-
-
0347709684
-
Charm: An Efficient Algorithm for Closed Itemset Mining
-
M. Zaki and C. Hsiao, "Charm: An Efficient Algorithm for Closed Itemset Mining," Proc. SIAM Conf. Data Mining, pp. 457-473, 2002.
-
(2002)
Proc. SIAM Conf. Data Mining
, pp. 457-473
-
-
Zaki, M.1
Hsiao, C.2
-
18
-
-
0035007850
-
MAFIA: A maximal frequent itemset algorithm for transactional databases
-
D. Burdick, M. Calimlim, and J. Gehrke, "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases," Proc. 17th Int'l Conf. Data Eng., pp. 443-452, 2001.
-
(2001)
Proc. 17th Int'l Conf. Data Eng.
, pp. 443-452
-
-
Burdick, D.1
Calimlim, M.2
Gehrke, J.3
-
20
-
-
0036565197
-
Pincer-Search: An efficient algorithm for discovering the maximum frequent set
-
May/June
-
D. Lin and Z.M. Kedem, "Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set," IEEE Trans. Knowledge and Data Eng., vol.14, no.3, pp. 553-566, May/June 2002.
-
(2002)
IEEE Trans. Knowledge and Data Eng.
, vol.14
, Issue.3
, pp. 553-566
-
-
Lin, D.1
Kedem, Z.M.2
-
22
-
-
4544306385
-
Online mining of changes from data streams: Research problems and preliminary results
-
G. Dong, J. Han, L.V.S. Lakshmanan, J. Pei, H. Wang, and P.S. Yu, "Online Mining of Changes from Data Streams: Research Problems and Preliminary Results," Proc. Workshop Management and Processing of Data Streams, 2003.
-
(2003)
Proc. Workshop Management and Processing of Data Streams
-
-
Dong, G.1
Han, J.2
Lakshmanan, L.V.S.3
Pei, J.4
Wang, H.5
Yu, P.S.6
-
23
-
-
0004118981
-
The NIDES statistical component description and justification
-
H. Javitz and A. Valdes, "The NIDES Statistical Component Description and Justification," Ann. Report A010, SRI Int'l, 1994.
-
(1994)
Ann. Report A010 SRI Int'l
-
-
Javitz, H.1
Valdes, A.2
|