A perspective on inductive databases
- 1 December 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGKDD Explorations Newsletter
- Vol. 4 (2) , 69-77
- https://doi.org/10.1145/772862.772871
Abstract
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.Keywords
This publication has 23 references indexed in Scilit:
- Constrained frequent pattern miningACM SIGKDD Explorations Newsletter, 2002
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- Modeling KDD Processes within the Inductive Database FrameworkPublished by Springer Nature ,1999
- Incremental Refinement of Mining QueriesPublished by Springer Nature ,1999
- Constraint-based, multidimensional data miningComputer, 1999
- Querying inductive databases: A case study on the MINE RULE operatorPublished by Springer Nature ,1998
- A database perspective on knowledge discoveryCommunications of the ACM, 1996
- The description identification problemArtificial Intelligence, 1991
- Generalization as searchArtificial Intelligence, 1982