- Agrawal , R. , Imielinski , T. and Swami , A. Mining association rules between sets of items in large databases . Proceedings of the AGM SIGMOD Conference on Management of Data . May 26-28 1993 , Washington, DC. pp. 207 – 216 .
- Agrawal , R. and Srikant , R. Fast algorithms for mining association rules . Proceedings of the 20th VLDB Conference . September 12-15 1994 , Santiago de Chile, Chile. pp. 487 – 499 .
- Brin , S. , Motwani , R. and Silverstein , C. Beyond market baskets: Generalizing association rules to correlations . Proceedings of the ACM SIGMOD International Conference on Management of Data . May 13-15 1997 , Tucson, AZ. pp. 265 – 276 .
- Chen , M. , Han , J. and Yu , P. 1996 . Data Mining: An overview for a database perspective. IEEE Trans . Knowledge and Data Eng , 8 (6) : 866 – 881 .
- Chen , M. , Park , J. and Yu , P. 1998 . Efficient data mining for path traversal patterns . IEEE Trans. Knowledge and Data Eng. , 10 (2) : 209 – 221 .
- Cooper , G. 1997 . A simple constraint-based algorithm for efficiently mining observational databases for causal relationships . Data Mining and Knowledge Discovery , 1 (2) : 203 – 224 .
- Fayyad , U. and Stolorz , P. 1997 . Data mining and KDD: Promise and challenges . Future Generation Computer Systems , 13 : 99 – 115 .
- Frawley , W. , Piatetsky-Shapiro , G. and Matheus , C. 1992 . Knowledge discovery in databases: An overview . AI Magazine , 13 (3) : 57 – 70 .
- Han , J. , Cai , Y. and Gereone , N. 1993 . Data-driven discovery of quantitative rules in relational databases . IEEE Trans. Knowledge and Data Eng. , 5 (1) : 29 – 40 .
- Han , E. , Karypis , G. and Kumar , V. Scalable parallel data mining for association rules . Proceedings of the ACM SIGMOD International Conference on Management of Data . May 13-15 1997 , Tucson, AZ. pp. 277 – 288 .
- Heckerman , D. , Geiger , D. and Chickering , D. 1995 . Learning Bayesian networks: The combinations of knowledge and statistical data . Machine Learning , 20 : 197 – 243 .
- Miller , R. and Yang , Y. Association rules over interval data . Proceedings of the ACM SIGMOD International Conference on Management of Data . May 13-15 1997 , Tucson, AZ. pp. 452 – 461 .
- Park , J. , Chen , M. and Yu , P. 1997 . Using a hash-based method with transaction trimming for mining association rules . IEEE Trans. Knowledge and Data Eng. , 9 (5) : 813 – 824 .
- Pearl , J. 1988 . Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference , San Mateo, CA : Morgan Kaufmann Publishers .
- Piatetsky-Shapiro , G. 1991 . “ Discovery, analysis, and presentation of strong rules ” . In Knowledge Discovery in Databases , Edited by: Piatetsky-Shapiro , G. and Frawley , W. 229 – 248 . AAAI Press/MIT Press .
- Shintani , T. and Kitsuregawa , M. Parallel mining algorithms for generalized association rules with classification hierarchy . Proceedings of the ACM SIGMOD International Conference on Management of Data . June 2-4 1998 , Seattle, WA. pp. 25 – 36 .
- Srikant , R. and Agrawal , R. Mining quantitative association rules in large relational tables . Proceedings of the ACM SIGMOD Conference on Management of Data . June 4-6 1996 , Montreal, Quebec, Canada. pp. 1 – 12 .
- Srikant , R. and Agrawal , R. 1997 . Mining generalized association rules . Future Generation Computer Systems , 13 : 161 – 180 .
- Silverstein , C. , Brin , S. , Motwani , R. and Ullman , J. Scalable techniques for mining causal structures . Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery . June 2-4 1998 , Seattle, WA. pp. 51 – 57 .
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research