Abstract
An inductive query specifies a set of constraints that patterns should satisfy. We study a novel type of inductive query that consists of arbitrary boolean expressions over monotonic and anti-monotonic primitives. One such query asks for all patterns that have a frequency of at least 50 on the positive examples and of at most 3 on the negative examples.
We investigate the properties of the solution spaces of boolean inductive queries. More specifically, we show that the solution space w.r.t. a conjunctive query is a version space, which can be represented by its border sets, and that the solution space w.r.t. an arbitrary boolean inductive query corresponds to a union of version spaces. We then discuss the role of operations on version spaces (and their border sets) in computing the solution space w.r.t. a given query. We conclude by formulating some thoughts on query optimization.
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., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD Conference on Management of Data, pp. 207–216 (1993)
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)
Bayardo, R.: Efficiently mining long patterns from databases. In: Proceedings of ACM SIGMOD Conference on Management of Data (1998)
Bucila, C., Gehrke, J., Kifer, D., White, W.: DualMiner: A dual pruning algorithm for item sets with constraints. In: Proc. of SIGKDD (2002)
Boulicaut, J.F.: Habilitation thesis, INSA-Lyon, France (2001)
Boulicaut, J.-F., Klemettinen, M., Mannila, H.: Querying Inductive Databases: A Case Study on the MINE RULE Operator. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 194–202. Springer, Heidelberg (1998)
De Raedt, L.: A Logical Database Mining Query Language. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 78–92. Springer, Heidelberg (2000)
De Raedt, L., Kramer, S.: 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, San Francisco (in press, 2001)
De Raedt, L., Jaeger, M., Lee, S.D., Mannila, H.: A theory of inductive query answering. In: Proceedings of the 2nd IEEE Conference on Data Mining, Maebashi, Japan (2002)
De Raedt, L.: A perspective on inductive databases. SIGKDD Explorations 4(2), 69–77 (2002)
Giacometti, A., Laurent, D., Diop, C.: Condensed Representations for Sets of Mining Queries. In: Proceedings of the ECML-PKDD Workshop on Knowledge Discovery in Inductive Databases, Helsinki (2002)
Goethals, B., Van den Bussche, J.: On supporting interactive association rule mining. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol. 1874, Springer, Heidelberg (2000)
Gunter, C., Ngair, T., Subramanian, D.: The common order-theoretic properties of version spaces and ATMSs. Artificial Intelligence 95, 357–407 (1997)
Han, J., Fu, Y., Koperski, K., Wang, W., Zaiane, O.: DMQL: A Data Mining Query Language for Relational Databases. In: SIGMOD 1996 Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada (June 1996)
Han, J., Lakshmanan, L.V.S., Ng, R.T.: Constraint-Based, Multidimensional Data Mining. Computer 32(8), 46–50 (1999)
Gunopulos, D., Mannila, H., Saluja, S.: Discovering All Most Specific Sentences by Randomized Algorithms. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 41–55. Springer, Heidelberg (1996)
Kramer, S., De Raedt, L.: Feature construction with version spaces for biochemical applications. In: Proceedings of the 18th International Conference on Machine Learning, Morgan Kaufmann, San Francisco (2001)
Kramer, S., De Raedt, L., Helma, C.: Molecular Feature Mining in HIV Data. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York (in press, 2001)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1 (1997)
Meo, R., Psaila, G., Ceri, S.: An extension to SQL for mining association rules. Data Mining and Knowledge Discovery 2(2), 195–224 (1998)
Mellish, C.: The description identification algorithm. Artificial Intelligence 52(2), 151–168 (1990)
Mitchell, T.: Generalization as Search. Artificial Intelligence 18(2), 203–226 (1980)
Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM 39(11), 58–64 (1996)
Hirsh, H.: Generalizing Version Spaces. Machine Learning 17(1), 5–46 (1994)
Hirsh, H.: Theoretical underpinnings of version spaces. In: Proc. IJCAI 1991 (1991)
Lau, T., Wolfman, S., Domingos, P., Weld, D.S.: Programming by demonstration using version space algebra. Machine Learning (to appear)
Giannotti, F., Manco, G.: Querying Inductive Databases via Logic-Based User-Defined Aggregates. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, Springer, Heidelberg (1999)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1 (1997)
Sablon, G., De Raedt, L., Bruynooghe, M.: Iterative Versionspaces. Artificial Intelligence 69(1–2), 393–409 (1994)
Sablon, G.: Iterative and Disjunctive Versionspaces. Ph.D. Thesis. Katholieke Universiteit Leuven (1995)
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
De Raedt, L. (2004). Towards Query Evaluation in Inductive Databases Using Version Spaces. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-44497-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22479-2
Online ISBN: 978-3-540-44497-8
eBook Packages: Springer Book Archive