Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Knowledge discovery in deductive databases with large deduction results: the first step

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chien-Le Goh ; Dept. of Inf. Syst. Eng., Osaka Univ., Japan ; Tsukamoto, M. ; Nishio, S.

Deductive databases have the ability to deduce new facts from a set of existing facts by using a set of rules. They are also useful in the integration of artificial intelligence and databases. However, when recursive rules are involved, the number of deduced facts can become too large to be practically stored, viewed or analyzed. This seriously hinders the usefulness of deductive databases. In order to overcome this problem, we propose four methods to discover characteristic rules from a large number of deduction results without actually having to store all the deduction results. This paper presents the first step in the application of knowledge discovery techniques to deductive databases with large numbers of deduction results

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:8 ,  Issue: 6 )