Abstract
In this paper, we propose a general framework for condensed representations of sets of mining queries. To this end, we adapt the standard notions of maximal, closed and key patterns introduced in previous works, including those dealing with condensed representations. Whereas these previous works concentrate on condensed representations of the answer to a single mining query, we consider the more general case of sets of mining queries defined by monotonic and anti-monotonic selection predicates.
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., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in Knowledge Discovery and Data Mining, pp. 309–328. AAAI-MIT Press (1996)
Baralis, E., Psaila, G.: Incremental Refinement of Mining Queries. In: Mohania, M., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol. 1676, pp. 173–182. Springer, Heidelberg (1999)
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations 2(2), 66–75 (2000)
Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of Frequency Queries by Means of Free-Sets. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 75–85. Springer, Heidelberg (2000)
Boulicaut, J.-F.: Habilitation thesis (French). INSA-Lyon, France (2001)
De Raedt, L., Kramer, S.: The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding. In: Proc. of IJCAI 2001, pp. 853–862 (2001)
De Raedt, L.: Query execution and optimization for inductive databases. In: Proc. of International Workshop DTDM 2002, In conjunction with EDBT 2002, Praha, CZ, pp. 19–28 (2002) (Extended Abstract)
Diop, C.T., Giacometti, A., Laurent, D., Spyratos, N.: Composition of Mining Contexts for Efficient Extraction of Association Rules. In: Jensen, C.S., Jeffery, K.G., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 106–123. Springer, Heidelberg (2002)
Hirsh, H.: Generalizing Version Spaces. Machine Learning 17(1), 5–46 (1994)
Jeudy, B., Boulicaut, J.-F.: Using condensed representations for interactive association rule mining. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 225–236. Springer, Heidelberg (2002)
Laporte, M., Novelli, N., Cicchetti, R., Lakhal, L.: Computing Full and Iceberg Datacubes Using Partitions. In: Hacid, M.-S., Raś, Z.W., Zighed, A.D.A., Kodratoff, Y. (eds.) ISMIS 2002. LNCS (LNAI), vol. 2366, pp. 244–254. Springer, Heidelberg (2002)
Mannila, H., Toivonen, H.: Levelwise Search and Borders of Theories in Knowledge Discovery. Techn. Rep. C-1997-8, University of Helsinki (1997)
Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Materialized Data Mining Views. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 65–74. Springer, Heidelberg (2000)
Nag, B., Deshpande, P., DeWitt, D.J.: Using a Knowledge Cache for Interactive Discovery of Association Rules. In: Proc. of KDD 1999, San Diego, USA, pp. 244–253 (1999)
Nag, B., Deshpande, P., DeWitt, D.J.: Caching for Multi-dimensional Data Mining Queries. In: Proc. of SCI 2001, Orlando, Florida (2001)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules using Closed Itemsets Lattices. Information Systems 24(1), 25–46 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Giacometti, A., Laurent, D., Diop, C.T. (2004). Condensed Representations for Sets of Mining Queries. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds) Database Support for Data Mining Applications. Lecture Notes in Computer Science(), vol 2682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44497-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-44497-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22479-2
Online ISBN: 978-3-540-44497-8
eBook Packages: Springer Book Archive