A vast quantity of data in the form of correlations is available for use in design and analysis. Even using hitherto-available databases there are significant difficulties in obtaining the best correlation for a particular purpose. The limitations of current databases in this respect are discussed a
A study of relevance for learning in deductive databases
✍ Scribed by Nada Lavrač; Dragan Gamberger; Viktor Jovanoski
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 288 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0743-1066
No coin nor oath required. For personal study only.
✦ Synopsis
This paper is a study of the problem of relevance in inductive concept learning. It gives definitions of irrelevant literals and irrelevant examples and presents ecient algorithms that enable their elimination. The proposed approach is directly applicable in propositional learning and in relation learning tasks that can be solved using a LINUS transformation approach. A simple inductive logic programming (ILP) problem is used to illustrate the approach to irrelevant literal and example elimination. Results of utility studies show the usefulness of literal reduction applied in LINUS and in the search of re®nement graphs.
📜 SIMILAR VOLUMES
Generalized queries are de®ned as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized querie
This paper describes the architecture, algebraic query processing framework and query execution approach that comprise the implementation of the deductive object query language (DOQL) query processing system. To the best of our knowledge, it is the ®rst deductive object query language to be designed
This paper presents a comparative user study that investigates the relevance judgments made by assessors with a law background and assessors without. Four law students and four library and information studies (LIS) students were recruited to judge independently the relevance of 100 documents for eac
## Abstract Database Selection is the problem of choosing, from a finite number of databases, the one that contains the most relevant information pertaining to a query. Previous approaches to this problem consisted of deterministic search techniques in conjunction with efficient pruning of search s