Condensed representations for sets of mining queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2682, Issue , 2004, Pages 250-269

  Giacometti, Arnaud ^a   Laurent, Dominique ^a   Diop, Cheikh Talibouya ^a,b  

^a UNIVERSITÉ DE TOURS   (France)

^b UNIVERSITÉ GASTON BERGER   (Senegal)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONDENSED REPRESENTATIONS; KEY PATTERNS;

QUERY PROCESSING;

EID: 33745175954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44497-8_13     Document Type: Article

References (16)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo (1996). Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, pp 309-328, AAAI-MIT Press.
2. E. Baralis and G. Psaila (1999). Incremental Refinement of Mining Queries. In Proc. of DAWAK'99, pp. 173-182, Florence.
3. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal (2000). Mining Frequent Patterns with Counting Inference. SIGKDD Explorations, 2(2), p. 66-75.
4. J.-F. Boulicaut, A. Bykowski and C. Rigotti (2000). Approximation of Frequency Queries by Means of Free-Sets. In Proc. of PKDD'00, LNCS vol. 1910, pp. 75-85, Springer-Verlag.
5. J.-F. Boulicaut (2001). Habilitation thesis (French). INSA-Lyon, France.
6. L. De Raedt and S. Kramer (2001). The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding. In Proc. of IJCAI'01, pp. 853-862.
7. L. De Raedt (2002). Query execution and optimization for inductive databases. In Proc. of International Workshop DTDM'02, In conjunction with EDBT 2002, pp. 19-28 (Extended Abstract), Praha, CZ.
8. C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2002). Composition of Mining Contexts for Efficient Extraction of Association Rules. In Proc. of the EDBT'02, LNCS vol. 2287, pp. 106-123, Springer-Verlag.
9. H. Hirsh (1994). Generalizing Version Spaces. Machine Learning, Vol. 17(1), pp. 5-46, Kluwer Academic Publishers.
10. B. Jeudy, J-F. Boulicaut (2002). Using condensed representations for interactive association rule mining. In Proc. of ECML/PKDD 2002, Helsinki, LNAI vol. 2431, pp. 225-236, Springer-Verlag.
11. M. Laporte, N. Novelli, R. Cicchetti, L. Lakhal (2002). Computing Full and Iceberg Datacubes Using Partitions. In Proc. of ISMIS'2002, LNAI vol. 2366, pp. 244-254, Springer-Verlag.
12. H. Mannila, H. Toivonen (1997). Levelwise Search and Borders of Theories in Knowledge Discovery. Techn. Rep. C-1997-8, University of Helsinki.
13. T. Morzy, M. Wojciechowski and M. Zakrzewicz (2000). Materialized Data Mining Views. In Proc. of PKDD'2000, LNCS vol. 1910, pp. 65-74, Springer-Verlag.
14. B. Nag, P. Deshpande and D.J. DeWitt (1999). Using a Knowledge Cache for Interactive Discovery of Association Rules. In Proc. of KDD'99, pp. 244-253, San Diego, USA.
15. B. Nag, P. Deshpande and D.J. DeWitt (2001). Caching for Multi-dimensional Data Mining Queries. In Proc. of SCI'2001, Orlando, Florida.
16. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal (1999). Efficient Mining of Association Rules using Closed Itemsets Lattices. Information Systems, Vol. 24(1), pp. 25-46, Elsevier Publishers.