A theory of inductive query answering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 123-130

  De Raedt, Luc ^a   Jaeger, Manfred ^a,b,c   Lee, Sau Dan ^a   Mannila, Heikki ^c  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF HELSINKI   (Finland)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149286455     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB, 1994.
2. R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. In Proc. SIGMOD, pp. 207-216, 1993.
3. R. Bayardo. Efficiently mining long patterns from databases. In Proc. SIGMOD, 1998.
4. L. De Raedt, S. Kramer. The level wise version space algorithm and its application to molecular fragment finding. In Proc. IJCAI, 2001.
5. L. De Raedt. Query evaluation and optimisation in inductive databases using version spaces. In Proc. EDBT Workshop on DTDM, 2002.
6. B. Goethals, J. Van den Bussche. On supporting interactive association rule mining. In Proc. DAWAK, LNCS Vol. 1874, Springer Verlag, 2000.
7. S. Greenberg. Using unix: Collected traces of 168 users. Research Report 88/333/45, Department of Computer Science, University of Calgary, Canada, 1988.
8. D. Gunopulos, H. Mannila, S. Saluja. Discovering All Most Specific Sentences by Randomized Algorithms. In Proc. ICDT, LNCS Vol. 1186, Springer Verlag, 1997.
9. J. Han, Y. Fu, K. Koperski, W. Wang, and O. Zaiane. DMQL: A Data Mining Query Language for Relational Databases. In Proc. SIGMOD'96 Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada, June 1996.
10. J. Han, L. V. S. Lakshmanan.andR. T. Ng. Constraint-Based, Multidimensional Data Mining, Computer, Vol. 32(8), pp. 46-50, 1999.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. SIGMOD, 2000.
12. H. Hirsh. Generalizing Version Spaces. Machine Learning.Vol. 17(1): 5-46 (1994).
13. H. Hirsh. Theoretical underpinnings of versionspaes. In Proc. IJCAI, 1991.
14. S. Kramer, L. De Raedt, C. Helma. Molecular Feature Mining in HIV Data. In Proc. SIGKDD, 2001.
15. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, Vol. 1, 1997.
16. T. Mitchell. Generalization as Search, Artificial Intelligence, Vol. 18 (2), pp. 203-226, 1980.
17. R. T. Ng, L. V.S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. SIGMOD, 1998.
18. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
19. P. Weiner. Linear pattern matching algorithm. In Proc. 14th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.