A perspective on inductive databases
Luc De Raedt · ACM SIGKDD Explorations Newsletter · 2002
Inductive databases tightly integrate databases with data mining. The key ideas are that data and patterns (or models) are handled in the same way and that an inductive query language allows the user to query and manipulate the patterns (or models) of interest.This paper proposes a simple and abstract model for inductive databases. We describe the basic formalism, a simple but fairly powerful inductive query language, some basics of reasoning for query optimization, and discuss some memory organization and implementation issues.
Cited by 127 works. doi:10.1145/772862.772871
Authors
References
- Lecture Notes in Computer Science 1205
- Mining association rules between sets of items in large databases
- Lecture Notes in Artificial Intelligence
- Mining frequent patterns without candidate generation
- Generalization as search
- Proceedings of the 19th International Joint Conference on Artificial Intelligence
- Mining frequent patterns without candidate generation
- Efficiently mining long patterns from databases
- Principles of Data Mining
- Exploratory mining and pruning optimizations of constrained associations rules