Abstract
Although knowledge discovery from large relational databases has gained popularity and its significance is well recognized, the prohibitive nature of the cost associated with extracting such knowledge, as well as the lack of suitable declarative query language support act as limiting factors. Surprisingly, little or no relational technology has yet been significantly exploited in data mining even though data often reside in relational tables. Consequently, no relational optimization has yet been possible for data mining. We exploit the transitive nature of large item sets and the so called anti-monotonicity property of support thresholds of large item sets to develop a natural least fixpoint operator for set oriented data mining from relational databases. The operator proposed has several advantages including optimization opportunities, and traditional candidate set free large item set generation. We present an SQL3 expression for association rule mining and discuss its mapping to the least fixpoint operator developed in this paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal, R., Imielinski, T., and Swami, A.N. (1993). Mining Association Rules Between Sets of Items in Large Databases. In P. Buneman and S. Jajodia (Eds.), Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207–216), Washington, D.C.
Agrawal, R. and Srikant, R. (1994). Fast Algorithms for Mining Association Rules in Large Databases. In J.B. Bocca, M. Jarke, and C. Zaniolo (Eds.), Proceedings of 20th International Conference on Very Large Data Bases (pp. 487–499), Santiago, Chile.
Han, J., Pei, J., and Yin, Y. (2000). Mining Frequent Patterns Without Candidate Generation. In Weidong Chen, J.F. Naughton, and P.A. Bernstein (Eds.), Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (pp. 1–12). Dallas, Texas.
Jamil, H.M. (2001a). Ad hoc Association Rule Mining as SQL3 Queries. In Proceedings of the IEEE International Conference on Data Mining (pp. 609–612). San Jose, California. IEEE Press.
Jamil, H.M. (2001b). Mining First-Order Knowledge Bases for Association Rules. In Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI). (pp. 218–227), Dallas, Texas. IEEE Press.
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., and Verkamo, A.I. (1994). Finding Interesting Rules from Large Sets of Discovered Association Rules. In Proceedings of the Third International Conference on Information and Knowledge Management. Gaithersburg, Maryland (pp. 401–407).
Lent, B., Swami, A.N., and Widom, J. (1997). Clustering Association Rules. In A. Gray and P.-Å. Larson (Eds.), Proceedings of the Thirteenth International Conference on Data Engineering (pp. 220–231). Birmingham, UK.
Meo, R., Psaila, G., and Ceri, S. (1996). A New SQL-Like Operator for Mining Association Rules. In T.M. Vijayaraman, A.P. Buchmann, C. Mohan, and N.L. Sarda (Eds.), Proceedings of 22nd International Conference on Very Large Data Bases (pp. 122–133). Mumbai, India.
Meo, R., Psaila, G., and Ceri, S. (1998). An Extension to SQL for Mining Association Rules. Data Mining and Knowledge Discovery, 2(2), 195–224.
Netz, A., Chaudhuri, S., Bernhardt, J., and Fayyad, U.M. (2000). Integration of Data Mining with Database Technology. In A. El Abbadi, M.L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, and Kyu-Young Whang (Eds.), Proceedings of 26th International Conference on Very Large Data Bases (pp. 719–722). Cairo, Egypt, Morgan Kaufmann.
Netz, A., Chaudhuri, S., Fayyad, U.M., and Bernhardt, J. (2001). Integrating Data Mining with SQL Databases. In Proceedings of the 17th IEEE International Conference on Data Engineering.
Ng, R.T., Lakshmanan, L.V.S., Han, J., and Pang, A. (1998). Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In L.M. Haas and A. Tiwary (Eds.), Proceedings ACM SIGMOD International Conference on Management of Data (pp. 13–24). Seattle, Washington.
Park, J.S., Chen, M.-S., and Yu, P.S. (1995). An Effective Hash Based Algorithm for Mining Association Rules. In M.J. Carey and D.A. Schneider (Eds.), Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (pp. 175–186). San Jose, California.
Rajamani, K., Cox, A., Iyer, B., and Chadha, A. (1999). Efficient Mining for Association Rules with Relational Database Systems. In Proceedings of the International Database Engineering and Applications Symposium (pp. 148–155).
Sarawagi, S., Thomas, S., and Agrawal, R. (1998). Integrating Mining with Relational Database Systems: Alternatives and Implications. In L.M. Haas and A. Tiwary (Eds.), Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 343–354). Seattle, Washington.
Savasere, A., Omiecinski, E., and Navathe, S.B. (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. In U. Dayal, P.M.D. Gray, and S. Nishio (Eds.), Proceedings of 21st International Conference on Very Large Data Bases (pp. 432–444). Zurich, Switzerland.
Shenoy, P., Haritsa, J.R., Sudarshan, S., Bhalotia, G., Bawa, M., and Shah, D. (2000). Turbo-Charging Vertical Mining of Large Databases. In W. Chen, J.F. Naughton, and P.A. Bernstein (Eds.), Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (pp. 22–33). Dallas, Texas.
Silberschatz, A., Korth, H.F., and Sudarshan, S. (1996). Database System Concepts. 3rd edn., McGraw-Hill.
Thomas, S. and Sarawagi, S. (1998). Mining Generalized Association Rules and Sequential Patterns using SQL Queries. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY (pp. 344–348).
Zaki, M. (2000). Generating Non-Redundant Association Rules. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA (pp. 34–43). ACM Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jamil, H.M. Bottom-Up Association Rule Mining in Relational Databases. Journal of Intelligent Information Systems 19, 191–206 (2002). https://doi.org/10.1023/A:1016559527944
Issue Date:
DOI: https://doi.org/10.1023/A:1016559527944