-
1
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
Washington, D.C., May
-
Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 207-216, Washington, D.C., May 1993.
-
(1993)
Proc. of the ACM SIGMOD Conference on Management of Data
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
3
-
-
0025447750
-
The R*-tree: An efficient and robust access method for points and rectangles
-
Atlantic City, NJ, May
-
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. of ACM SIGMOD, pages 322-331, Atlantic City, NJ, May 1990.
-
(1990)
Proc. of ACM SIGMOD
, pp. 322-331
-
-
Beckmann, N.1
Kriegel, H.-P.2
Schneider, R.3
Seeger, B.4
-
4
-
-
0002401815
-
Discovery of multiple-level association rules from large databases
-
Zurich, Switzerland, September
-
J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proc. of the 21st Int'l Conference on Very Large Databases, Zurich, Switzerland, September 1995.
-
(1995)
Proc. of the 21st Int'l Conference on Very Large Databases
-
-
Han, J.1
Fu, Y.2
-
7
-
-
0001280495
-
Efficient algorithms for discovering association rules
-
Seattle, Washington, July
-
Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In KDD-94: AAAI Workshop on Knowledge Discovery in Databases, pages 181-192, Seattle, Washington, July 1994.
-
(1994)
KDD-94: AAAI Workshop on Knowledge Discovery in Databases
, pp. 181-192
-
-
Mannila, H.1
Toivonen, H.2
Inkeri Verkamo, A.3
-
8
-
-
84976830511
-
An effective hash based algorithm for mining association rules
-
San Jose, California, May
-
Jong Soo Park, Ming-Syan Chen, and Philip S. Yu. An effective hash based algorithm for mining association rules. In Proc. of the ACM-SIGMOD Conference on Management of Data, San Jose, California, May 1995.
-
(1995)
Proc. of the ACM-SIGMOD Conference on Management of Data
-
-
Park, J.S.1
Chen, M.-S.2
Yu, P.S.3
-
9
-
-
0002877253
-
Discovery, analysis, and presentation of strong rules
-
G. Piatetsky-Shapiro and W. J. Frawley, editors, AAAI/MIT Press, Menlo Park, CA
-
G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, pages 229-248. AAAI/MIT Press, Menlo Park, CA, 1991.
-
(1991)
Knowledge Discovery in Databases
, pp. 229-248
-
-
Piatetsky-Shapiro, G.1
-
11
-
-
0002082857
-
An efficient algorithm for mining association rules in large databases
-
Zurich, Switzerland, September
-
A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the VLDB Conference, Zurich, Switzerland, September 1995.
-
(1995)
Proc. of the VLDB Conference
-
-
Savasere, A.1
Omiecinski, E.2
Navathe, S.3
|