Abstract
Data mining slowly evolves from simple discovery of frequent patterns and regularities in large data sets toward interactive, user-oriented, on-demand decision supporting. Since data to be mined is usually located in a database, there is a promising idea of integrating data mining methods into database management systems (DBMS). In this paper we present the results of developing our research prototype for DBMS-integrated data mining. We focus on two main contributions: query language for data mining and constraints-driven algorithm for association rules discovery.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A. Mining association rules between sets of items in large databases. Proc. ACM SIGMOD, Washington DC, USA, May 1993, pp. 207–216.
Agrawal, R., Mehta, M., Shafer, J., Srikant, R., Arning, A., Bollinger, T. The Quest Data Mining System. Proc. of the 2nd International Conference on Knowledge Discovery in Databases and Data Mining, Portland, Oregon, 1996.
Agrawal, R., Srikant, R. Fast algorithms for mining association rules. Proc. 2dß Int. Conf. Very Large Data Bases, Santiago, Chile, 1994, pp. 478–499.
Cheung, D. W., Han, J., Ng, V., Wong, C. Y. Maintenance of discovered association rules in large databases: an incremental updating technique. Proc. Int. Conf. Dana Eng., New Orleans, USA, February 1996.
Han, J., Fu, Y. Discovery of multiple-level association rules from large databases. Proc. 21th Int. Conf. Very Large Data Bases, pp. 420–431, Zurich, Switzerland, Sept. 1995.
Houtsma, M., Swami, A. Set-Oriented Mining of Association Rules. Research Report RJ 9567, IBM Almaden Research Center, San Jose, California, USA, October 1993.
Manilla, H., Toivonen, H., Inkeri Verkamo, A. Efficient algorithms for discovering association rules. Proc. AAAI Workshop Knowledge Discovery in Databases, 1994.
Morzy, T., Zakrzewicz, M. Constraints-Driven Algorithm for Mining Association Rules on Demand. Technical Report RA-004/97, Poznan University of Technology, 1997.
Morzy, T., Zakrzewicz, M. SQL-like language for database mining. 1st Int. Conference on Advances in Databases and Information Systems, St. Petersburg, 1997, pp. 311–317.
Savasere, A., Omiecinski, E., Navathe, S. An efficient algorithm for mining association rules in large databases. Proc. 21 th Int. Conf. Very Large Data Bases, Zurich, Switzerland, 1995.
Srikant, R., Agrawal, R. Mining generalized association rules. Proc. 21th Int. Conf. Very Large Data BasesZurich, Switzerland, Sept. 1995. pp. 407–419.
Srikant, R., Agrawal, R. Mining quantitative association rules in large relational tables. Proc. 1996 ACM SIGMOD Int. Conf. Management Data, Montreal, Canada, 1996, pp. 1–12.
Toivonen, H. Sampling large databases for association rules. Proc. 22“ Int. Conf, Bombay, India, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zakrzewicz, M. (2001). Data Mining within DBMS Functionality. In: Barzdins, J., Caplinskas, A. (eds) Databases and Information Systems. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9636-7_7
Download citation
DOI: https://doi.org/10.1007/978-94-015-9636-7_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5657-3
Online ISBN: 978-94-015-9636-7
eBook Packages: Springer Book Archive