-
1
-
-
0027621699
-
Mining association rules between sets of items in large databases
-
Washington, USA
-
Agrawal, R., Imielinski, T., and Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD '93), pages 207 - 216, Washington, USA.
-
(1993)
Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD '93)
, pp. 207-216
-
-
Agrawal, R.1
Imielinski, T.2
Swami, A.3
-
5
-
-
0001896313
-
The process of knowledge discovery in databases
-
Fayyad, U. M., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R., editors, chapter 2, AAAI/MIT Press.
-
Brachman, R. J. and Anand, T. (1996). The process of knowledge discovery in databases. In Fayyad, U. M., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R., editors, Advances in Knowledge Discovery and Data Mining, chapter 2, pages 37-57. AAAI/MIT Press.
-
(1996)
Advances in Knowledge Discovery and Data Mining
, pp. 37-57
-
-
Brachman, R.J.1
Anand, T.2
-
6
-
-
0031161999
-
Beyond market baskets: Generalizing association rules to correlations
-
Brin, S., Motwani, R., and Silverstein, C. (1997a). Beyond market baskets: Generalizing association rules to correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD '97), pages 265 - 276.
-
(1997)
Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD '97)
, pp. 265-276
-
-
Brin, S.1
Motwani, R.2
Silverstein, C.3
-
7
-
-
0031162961
-
Dynamic itemset counting and implication rules for market basket data
-
Brin, S., Motwani, R., Ullman, J. D., and Tsur, S. (1997b). Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD '97), pages 265 - 276.
-
(1997)
Proceedings of the ACM SIGMOD International Conference on Management of Data (ACM SIGMOD '97)
, pp. 265-276
-
-
Brin, S.1
Motwani, R.2
Ullman, J.D.3
Tsur, S.4
-
10
-
-
0030285403
-
The KDD process for extracting useful knowledge from volumes of data
-
Fayyad, U., Piatetsky-Shapiro, G., and Smyth, P. (1996). The KDD process for extracting useful knowledge from volumes of data. Communications of the ACM, 39(11):27-34.
-
(1996)
Communications of the ACM
, vol.39
, Issue.11
, pp. 27-34
-
-
Fayyad, U.1
Piatetsky-Shapiro, G.2
Smyth, P.3
-
12
-
-
0029694749
-
Mining optimized association rules for numeric attributes
-
Montreal, Quebec, Canada
-
Fukuda, T., Morimoto, Y., Morishita, S., and Tokuyama, T. (1996). Mining optimized association rules for numeric attributes. In Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '96), pages 182 - 191, Montreal, Quebec, Canada.
-
(1996)
Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '96)
, pp. 182-191
-
-
Fukuda, T.1
Morimoto, Y.2
Morishita, S.3
Tokuyama, T.4
-
13
-
-
0002502404
-
Dmql: A data mining query language for relational databases
-
Montreal, Canada
-
Han, J., Fu, Y., Wang, W., Koperski, K., and Zaiane, O. (1996). Dmql: A data mining query language for relational databases. In 1996 SIGMOD'96 Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'96), Montreal, Canada.
-
(1996)
1996 SIGMOD'96 Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'96)
-
-
Han, J.1
Fu, Y.2
Wang, W.3
Koperski, K.4
Zaiane, O.5
-
14
-
-
0039253846
-
Mining frequent patterns without candidate generation
-
Dallas, Texas, USA
-
Han, J., Pei, J., and Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM-SIGMOD Intl. Conf. on Management of Data, Dallas, Texas, USA.
-
(2000)
Proceedings of the 2000 ACM-SIGMOD Intl. Conf. on Management of Data
-
-
Han, J.1
Pei, J.2
Yin, Y.3
-
15
-
-
0002784345
-
Algorithms for association rule mining - A general survey and comparison
-
Hipp, J., Güntzer, U., and Nakhaeizadeh, G. (2000a). Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2(1):58-64.
-
(2000)
SIGKDD Explorations
, vol.2
, Issue.1
, pp. 58-64
-
-
Hipp, J.1
Güntzer, U.2
Nakhaeizadeh, G.3
-
16
-
-
84974685737
-
Mining association rules: Deriving a superior algorithm by analysing today's approaches
-
Lyon, France
-
Hipp, J., Güntzer, U., and Nakhaeizadeh, G. (2000b). Mining association rules: Deriving a superior algorithm by analysing today's approaches. In Proceedings of the 4th European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '00), pages 159-168, Lyon, France.
-
(2000)
Proceedings of the 4th European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '00)
, pp. 159-168
-
-
Hipp, J.1
Güntzer, U.2
Nakhaeizadeh, G.3
-
17
-
-
22844453441
-
Analysing warranty claims of automobiles. An application description following the CRISP-DM data mining process
-
Hong Kong, China
-
Hipp, J. and Lindner, G. (1999). Analysing warranty claims of automobiles. an application description following the CRISP-DM data mining process. In Proceedings of 5th International Computer Science Conference (ICSC '99), pages 31-40, Hong Kong, China.
-
(1999)
Proceedings of 5th International Computer Science Conference (ICSC '99)
, pp. 31-40
-
-
Hipp, J.1
Lindner, G.2
-
18
-
-
33749395907
-
A new algorithm for faster mining of generalized association rules
-
Nantes, France
-
Hipp, J., Myka, A., Wirth, R., and Güntzer, U. (1998). A new algorithm for faster mining of generalized association rules. In Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '98), pages 74-82, Nantes, France.
-
(1998)
Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '98)
, pp. 74-82
-
-
Hipp, J.1
Myka, A.2
Wirth, R.3
Güntzer, U.4
-
19
-
-
0003832201
-
Set-oriented mining for association rules in relational databases
-
IBM Almaden Research Center, San Jose, California
-
Houtsma, M. and Swami, A. (1993). Set-oriented mining for association rules in relational databases. Technical Report RJ 9567, IBM Almaden Research Center, San Jose, California.
-
(1993)
Technical Report RJ 9567
-
-
Houtsma, M.1
Swami, A.2
-
20
-
-
27144468394
-
Discovery of frequent episodes in event sequences
-
Mannila, H., Toivonen, H., and Verkamo, I. (1997). Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259-289.
-
(1997)
Data Mining and Knowledge Discovery
, vol.1
, Issue.3
, pp. 259-289
-
-
Mannila, H.1
Toivonen, H.2
Verkamo, I.3
-
21
-
-
0003024181
-
A new SQL-like operator for mining association rules
-
Mumbai (Bombay), India
-
Meo, R., Psaila, G., and Ceri, S. (1996). A new sql-like operator for mining association rules. In Proceedings of the 22nd International Conference on Very Large Databases (VLDB '96), Mumbai (Bombay), India.
-
(1996)
Proceedings of the 22nd International Conference on Very Large Databases (VLDB '96)
-
-
Meo, R.1
Psaila, G.2
Ceri, S.3
-
22
-
-
0032094477
-
Integrating association rule mining with relational database systems: Alternatives and implications
-
Sarawagi, S., Thomas, S., and Agrawal, R. (1998). Integrating association rule mining with relational database systems: Alternatives and implications. SIGMOD Record (ACM Special Interest Group on Management of Data), 27(2):343-355.
-
(1998)
SIGMOD Record (ACM Special Interest Group on Management of Data)
, vol.27
, Issue.2
, pp. 343-355
-
-
Sarawagi, S.1
Thomas, S.2
Agrawal, R.3
-
23
-
-
0002082857
-
An efficient algorithm for mining association rules in large databases
-
Zürich, Switzerland
-
Savasere, A., Omiecinski, E., and Navathe, S. (1995). An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st Conference on Very Large Databases (VLDB '95), pages 432-444, Zürich, Switzerland.
-
(1995)
Proceedings of the 21st Conference on Very Large Databases (VLDB '95)
, pp. 432-444
-
-
Savasere, A.1
Omiecinski, E.2
Navathe, S.3
-
28
-
-
85138646379
-
New algorithms for fast discovery of association rules
-
Newport Beach, California
-
Zaki, M. J., Parthasarathy, S., Ogihara, M., and Li, W. (1997). New algorithms for fast discovery of association rules. In Proceedings of the 3rd International Conference on KDD and Data Mining (KDD '97), Newport Beach, California.
-
(1997)
Proceedings of the 3rd International Conference on KDD and Data Mining (KDD '97)
-
-
Zaki, M.J.1
Parthasarathy, S.2
Ogihara, M.3
Li, W.4
|