Abstract
This paper describes a rule discovery system that has been developed as part of an ongoing research project. The system allows discovery of multi-relational rules using data from relational databases. The basic assumption of the system is that objects to be analyzed are stored in a set of tables. Multi-relational rules discovered would either be used in predicting an unknown object attribute value, or they can be used to see the hidden relationship between the objects' attribute values. The rule discovery system, developed, was designed to use data available from any possible 'connected' schema where tables concerned are connected by foreign keys. In order to have a reasonable performance, the 'hypotheses search' algorithm was implemented to allow construction of new hypotheses by refining previously constructed hypotheses, thereby avoiding the work of re-computing.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 252-259 |
| Number of pages | 8 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2869 |
| State | Published - 2003 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science