-
2
-
-
0012886120
-
Depth-first generation of large itemsets for association rules
-
R. Agrawal, C. Aggarwal, and V. Prasad, "Depth-First Generation of Large Itemsets for Association Rules," Proc. 2000 ACM Knowledge Discovery and Data Mining Conf., pp. 108-118, 2000.
-
(2000)
Proc. 2000 ACM Knowledge Discovery and Data Mining Conf.
, pp. 108-118
-
-
Agrawal, R.1
Aggarwal, C.2
Prasad, V.3
-
3
-
-
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. 1993 ACM SIGMOD Int'l Conf. Management of Data, pp. 207-216, May 1993.
-
(1993)
Proc. 1993 ACM SIGMOD Int'l Conf. Management of Data
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
4
-
-
0030403087
-
Parallel mining of association rules
-
Dec.
-
R. Agrawal and J. Shafer, "Parallel Mining of Association Rules," IEEE Trans. Knowledge and Data Eng., vol. 8, no. 6, pp. 962-969, Dec. 1996.
-
(1996)
IEEE Trans. Knowledge and Data Eng.
, vol.8
, Issue.6
, pp. 962-969
-
-
Agrawal, R.1
Shafer, J.2
-
7
-
-
0031161999
-
Beyond market baskets: Generalizing association rules to correlations
-
May
-
S. Brin, R. Motwani, and C. Silverstein, "Beyond Market Baskets: Generalizing Association Rules to Correlations," Proc. ACM SIGMOD Conf., pp. 265-276, May 1997.
-
(1997)
Proc. ACM SIGMOD Conf.
, pp. 265-276
-
-
Brin, S.1
Motwani, R.2
Silverstein, C.3
-
8
-
-
0031162961
-
Dynamic itemset counting and implication rules for market basket data
-
May
-
S. Brin, R. Motwani, J. Ullman, and S. Tsur, "Dynamic Itemset Counting and Implication Rules for Market Basket Data," Proc. ACM SIGMOD Conf., pp. 255-264, May 1997.
-
(1997)
Proc. ACM SIGMOD Conf.
, pp. 255-264
-
-
Brin, S.1
Motwani, R.2
Ullman, J.3
Tsur, S.4
-
10
-
-
0031165409
-
Scalable parallel data mining for association rules
-
May
-
E. Han, G. Karypis, and V. Kumar, "Scalable Parallel Data Mining for Association Rules," Proc. 1997 ACM SIGMOD Int'l Conf. Management of Data, pp. 277-288, May 1997.
-
(1997)
Proc. 1997 ACM SIGMOD Int'l Conf. Management of Data
, pp. 277-288
-
-
Han, E.1
Karypis, G.2
Kumar, V.3
-
11
-
-
0002401815
-
Discovery of multiple-level association rules from large databases
-
Sept.
-
J. Han and Y. Eu, "Discovery of Multiple-Level Association Rules from Large Databases," Proc. Very Large Databases Conf., pp. 420-431, Sept. 1995.
-
(1995)
Proc. Very Large Databases Conf.
, pp. 420-431
-
-
Han, J.1
Eu, Y.2
-
12
-
-
0039253846
-
Mining frequent patterns without candidate generation
-
May
-
J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," Proc. 2000 ACM SIGMOD Int'l Conf. Management of Data, pp. 1-12, May 2000.
-
(2000)
Proc. 2000 ACM SIGMOD Int'l Conf. Management of Data
, pp. 1-12
-
-
Han, J.1
Pei, J.2
Yin, Y.3
-
15
-
-
0347087668
-
Optimization of constrained frequent set queries with 2-variable constraints
-
June
-
L. Lakshmanan, R. Ng, J. Han, and A. Pang, "Optimization of Constrained Frequent Set Queries with 2-Variable Constraints," Proc. ACM-SIGMOD Conf. Management of Data, pp. 157-168, June 1999.
-
(1999)
Proc. ACM-SIGMOD Conf. Management of Data
, pp. 157-168
-
-
Lakshmanan, L.1
Ng, R.2
Han, J.3
Pang, A.4
-
16
-
-
0001267179
-
Mining association rules with multiple minimum supports
-
Aug.
-
B. Liu, W. Hsu, and Y. Ma, "Mining Association Rules with Multiple Minimum Supports," Proc. Knowledge Discovery and Data Mining Conf., pp. 337-341, Aug. 1999.
-
(1999)
Proc. Knowledge Discovery and Data Mining Conf.
, pp. 337-341
-
-
Liu, B.1
Hsu, W.2
Ma, Y.3
-
17
-
-
0001280495
-
Efficient algorithms for discovering association rules
-
July
-
H. Mannila, H. Toivonen, and A.I. Verkamo, "Efficient Algorithms for Discovering Association Rules," Proc. Knowledge Discovery and Data Mining '94: AAAI Workshop Knowledge Discovery in Databases, pp. 181-192, July 1994.
-
(1994)
Proc. Knowledge Discovery and Data Mining '94: AAAI Workshop Knowledge Discovery in Databases
, pp. 181-192
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, A.I.3
-
18
-
-
0012888467
-
Algorithms for mining associations rules for binary segmentation of huge categorical databases
-
Sept.
-
Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tkuyama, and K. Yoda, "Algorithms for Mining Associations Rules for Binary Segmentation of Huge Categorical Databases," Proc. Very Large Databases Conf., pp. 380-391, Sept. 1998.
-
(1998)
Proc. Very Large Databases Conf.
, pp. 380-391
-
-
Morimoto, Y.1
Fukuda, T.2
Matsuzawa, H.3
Tkuyama, T.4
Yoda, K.5
-
19
-
-
0032092760
-
Exploratory mining and pruning optimizations of constrained associations rules
-
June
-
R. Ng, L. Lakshmanan, J. Han, and A. Pang, "Exploratory Mining and Pruning Optimizations of Constrained Associations Rules," Proc. ACM-SIGMOD Conf. Management of Data, pp. 13-24, June 1998.
-
(1998)
Proc. ACM-SIGMOD Conf. Management of Data
, pp. 13-24
-
-
Ng, R.1
Lakshmanan, L.2
Han, J.3
Pang, A.4
-
20
-
-
84976830511
-
An effective hash based algorithm for mining association rules
-
May
-
J.S. Park, M-S. Chen, and P.S. Yu, "An Effective Hash Based Algorithm for Mining Association Rules," Proc. ACM-SIGMOD Conf. Management of Data, pp. 229-248, May 1995.
-
(1995)
Proc. ACM-SIGMOD Conf. Management of Data
, pp. 229-248
-
-
Park, J.S.1
Chen, M.-S.2
Yu, P.S.3
-
23
-
-
0002034520
-
On the discovery of interesting patterns in association rules
-
Sept.
-
S. Ramaswamy, S. Mahajan, and A. Silbershatz, "On the Discovery of Interesting Patterns in Association Rules," Proc. Very Large Databases Conf., pp. 368-379, Sept. 1998.
-
(1998)
Proc. Very Large Databases Conf.
, pp. 368-379
-
-
Ramaswamy, S.1
Mahajan, S.2
Silbershatz, A.3
-
25
-
-
0002082857
-
An efficient algorithm for mining association rules
-
Sept.
-
A. Savasere, E. Omiecinski, and S. Navathe, "An Efficient Algorithm for Mining Association Rules," Proc. Very Large Databases Conf., pp. 432-444, Sept. 1995.
-
(1995)
Proc. Very Large Databases Conf.
, pp. 432-444
-
-
Savasere, A.1
Omiecinski, E.2
Navathe, S.3
-
26
-
-
0031698969
-
Mining for strong negative associations in a large database of customer transactions
-
Feb.
-
A. Savasere, E. Omiecinski, and S. Navathe, "Mining for Strong Negative Associations in a Large Database of Customer Transactions," Proc. IEEE Data Eng. Conf., Feb. 1998.
-
(1998)
Proc. IEEE Data Eng. Conf.
-
-
Savasere, A.1
Omiecinski, E.2
Navathe, S.3
|