Abstract
A first attempt to extract association rules from a database frequently yields a significant number of rules, which may be rather difficult for the user to browse in searching interesting information. However, powerful languages allow the user to specify complex mining queries to reduce the amount of extracted information. Hence, a suitable rule set may be obtained by means of a progressive refinement of the initial query. To assist the user in the refinement process, we identify several types of containment relationships between mining queries that may lead the process. Since the repeated extraction of a large rule set is computationally expensive, we propose an algorithm to perform an incremental recomputation of the output rule set. This algorithm is based on the detection of containment relationships between 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.
Similar content being viewed by others
References
R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994.
E. Baralis and G. Psaila. Designing templates for mining association rules. JIIS Journal of Intelligent Information Systems, 9:7–32, 1997.
T. Imielinski, A. Virmani, and A. Abdoulghani. Datamine: Application programming interface and query language for database mining. KDD-96, 1996.
W. Klementtinen, H. Mannila, P. Romkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. Third International Conference on Information and Knowledge Management, 1994.
R. Meo, G. Psaila, and S. Ceri. A new SQL-like operator for mining association rules. In Proceedings of the 22st VLDB Conference, Bombay, India, 1996.
R. Ng, L. Lackshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the ACM-SIGMOD 98, Seattle, Washington, USA., June 1998.
G. Psaila. Integrating Data Mining Techniques and relational Databases. Ph.D. Thesis, Politecnico di Torino, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baralis, E., Psaila, G. (1999). Incremental Refinement of Mining Queries. In: Mohania, M., Tjoa, A.M. (eds) DataWarehousing and Knowledge Discovery. DaWaK 1999. Lecture Notes in Computer Science, vol 1676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48298-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-48298-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66458-1
Online ISBN: 978-3-540-48298-7
eBook Packages: Springer Book Archive