Abstract
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not support iterative processing of data mining queries and do not allow to re-use the results of previous queries. Consequently, mining algorithms suffer from long processing times, which are unacceptable from the point of view of interactive data mining. On the other hand, the results of consecutive data mining queries are usually very similar. This observation leads to the idea of reusing materialized results of previous data mining queries. We present the notion of a materialized data mining view and we propose two novel algorithms which aim at efficient discovery of association rules in the presence of materialized results of previous data mining queries.
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.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proc. Of the 1993 ACM SIGMOD, Washington, D.C, May 26-28, pp. 207–216. ACM Press, New York (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. of VLDB 1994, Santiago de Chile, Chile, September 12-15, pp. 487–499. Morgan Kaufmann, San Francisco (1994)
Cheung, D.W.-L., Han, J., Ng, V., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: Su, S.Y.W. (ed.) Proc. of ICDE 1996, New Orleans, Louisiana, February 26 - March 1, pp. 106–114. IEEE Computer Society, Los Alamitos (1996)
Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, Cambridge (1996)
Gupta, A., Mummick, I.S.: Maintenance of materialized views: Problems, techniques, and applications. IEEE Data Engineering Bulletin, Special Issue on Materialized View and Data Warehousing 2(18) (June 1995)
Gupta, A., Mummick, I.S.: Materialized Views: Techniques, Implementations, and Applications. The MIT Press, Cambridge (1999)
Imielinski, T., Virmani, A.: Msql: A query language for database mining. Data Mining and Knowledge Discovery 3(4), 373–408 (1999)
Botta, M., Boulicaut, J.-F., Masson, C., Meo, R.: A Comparison between Query Languages for the Extraction of Association Rules. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2002. LNCS, vol. 2454, pp. 1–10. Springer, Heidelberg (2002)
Meo, R., Psaila, G., Ceri, S.: A new sql-like operator for mining association rules. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) Proc. of VLDB 1996, Mumbai (Bombay), India, September 3-6, pp. 122–133. Morgan Kaufmann, San Francisco (1996)
Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Materialized data mining views. In: Zighed, D.A., Komorowski, H.J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 65–74. Springer, Heidelberg (2000)
Morzy, T., Zakrzewicz, M.: Sql-like language for database mining. In: Proc. of ADBIS 1997. St.Petersburg, Russia (1997)
Roussopoulos, N.: Materialized views and data warehouses. SIGMOD Record 27(1) (1998)
Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An efficient algorithm for the incremental updation of association rules in large databases. In: Heckerman, D., Mannila, H., Pregibon, D. (eds.) Proc. of KDD 1997, Newport Beach, California, USA, August 14-17, pp. 263–266. AAAI Press, Menlo Park (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morzy, M., Morzy, T., Królikowski, Z. (2004). Incremental Association Rule Mining Using Materialized Data Mining Views. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2004. Lecture Notes in Computer Science, vol 3261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30198-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30198-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23478-4
Online ISBN: 978-3-540-30198-1
eBook Packages: Computer ScienceComputer Science (R0)