Towards query evaluation in inductive databases using version spaces

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

Volumn 2682, Issue , 2004, Pages 117-134

  De Raedt, Luc ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

constraint based mining; Convex spaces; Inductive databases; Inductive querying; Version spaces

Indexed keywords

EID: 33745178204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44497-8_6     Document Type: Review

References (30)

1. R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data, pp. 207-216, 1993.
2. E. Baralis, G. Psaila. Incremental Refinement of Mining Queries. In Mukesh K. Mohania, A. Min Tjoa (Eds.) Data Warehousing and Knowledge Discovery, First International Conference DaWaK '99 Proceedings. Lecture Notes in Computer Science, Vol.1676, Springer Verlag, pp. 173-182, 1999.
3. R. Bayardo. Efficiently mining long patterns from databases. In Proceedings of ACM SIGMOD Conference on Management of Data, 1998.
4. C. Bucila, J. Gehrke, D. Kifer, W. White. DualMiner: A dual pruning algorithm for item sets with constraints. In Proc. of SIGKDD, 2002.
5. Jean Francois Boulicaut, habilitation thesis, INSA-Lyon, France, 2001.
6. Jean-Francois Boulicaut, Mika Klemettinen, Heikki Mannila: Querying Inductive Databases: A Case Study on the MINE RULE Operator. In Proceedings of PKDD-98, Lecture Notes in Computer Science, Vol. 1510, Springer Verlag, pp. 194-202, 1998.
7. L. De Raedt, A Logical Database Mining Query Language. In Proceedings of the 10th Inductive Logic Programming Conference, Lecture Notes in Artificial Intelligence, Vol. 1866, Springer Verlag, pp. 78-92, 2000.
8. L. De Raedt, S. Kramer, The level wise version space algorithm and its application to molecular fragment finding, in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, in press, 2001.
9. L. De Raedt, M. Jaeger, S.D. Lee, H. Mannila. A theory of inductive query answering. In Proceedings of the 2nd IEEE Conference on Data Mining, Maebashi, Japan, 2002.
10. L. De Raedt. A perspective on inductive databases. SIGKDD Explorations, ACM, Vol. 4(2):69-77, 2002.
11. A. Giacometti, D. Laurent and C. Diop. Condensed Representations for Sets of Mining Queries. In Proceedings of the ECML-PKDD Workshop on Knowledge Discovery in Inductive Databases, Helsinki, 2002.
12. B. Goethals, J. Van den Bussche. On supporting interactive association rule mining. In Proc. DAWAK, LNCS Vol. 1874, Springer Verlag, 2000.
13. C. Gunter, T. Ngair, D. Subramanian. The common order-theoretic properties of version spaces and ATMSs, Artificial Intelligence, 95, 357-407, 1997.
14. J. Han, Y. Fu, K. Koperski, W. Wang, and O. Zaiane, DMQL: A Data Mining Query Language for Relational Databases, in SIGMOD'96 Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada, June 1996.
15. J. Han, L. V. S. Lakshmanan, and R. T. Ng, Constraint-Based, Multidimensional Data Mining, Computer, Vol. 32(8), pp. 46-50, 1999.
16. D. Gunopulos, H. Mannila, S. Saluja: Discovering All Most Specific Sentences by Randomized Algorithms. In Foto N. Afrati, Phokion Kolaitis (Eds.): Database Theory - ICDT '97, 6th International Conference, Lecture Notes in Computer Science, Vol. 1186, Springer Verlag, pp. 41-55, 1997.
17. S. Kramer and L. De Raedt. Feature construction with version spaces for biochemical applications. In Proceedings of the 18th International Conference on Machine Learning, Morgan Kaufmann, 2001.
18. S. Kramer, L. De Raedt, C. Helma. Molecular Feature Mining in HIV Data, in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, in press, 2001.
19. H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, Vol. 1, 1997.
20. R. Meo, G. Psaila and S. Ceri, An extension to SQL for mining association rules. Data Mining and Knowledge Discovery, Vol. 2 (2), pp. 195-224, 1998.
21. C. Mellish. The description identification algorithm. Artificial Intelligence, Vol. 52 (2), pp,. 151-168, 1990.
22. T. Mitchell. Generalization as Search, Artificial Intelligence, Vol. 18 (2), pp. 203-226, 1980.
23. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, 1996.
24. H. Hirsh. Generalizing Version Spaces. Machine Learning, Vol. 17(1): 5-46 (1994).
25. H. Hirsh. Theoretical underpinnings of version spaces. Proc. IJCAI 1991.
26. T. Lau, S. Wolfman, P. Domingos, D.S. Weld, Programming by demonstration using version space algebra, Machine Learning, to appear.
27. F. Giannotti, G. Manco: Querying Inductive Databases via Logic-Based User-Defined Aggregates. In Proceedings of PKDD 99, Lecture Notes in Artificial Intelligence, Springer, 1999.
28. H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, Vol. 1, 1997.
29. G. Sablon, L. De Raedt, and Maurice Bruynooghe. Iterative Versionspaces. Artificial Intelligence, Vol. 69(1-2), pp. 393-409, 1994.
30. G. Sablon. Iterative and Disjunctive Versionspaces. Ph.D. Thesis. Katholieke Universiteit Leuven, 1995.