By Topic

INDED: a distributed knowledge-based learning system

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
$33 $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)
Seitzer, J. ; Dayton Univ., OH, USA ; Buckley, J.P. ; Pan, Y.

The INDED (induction-deduction, pronounced "indeed") system performs rule discovery using the techniques of inductive logic programming, and accumulates and handles knowledge using a deductive nonmonotonic reasoning engine. Using the language of logic programming, we use a hypergraph to represent the knowledge base from which rules are mined. Because the hypergraph gets inordinately large in INDED's serial version, we have devised a parallel implementation that creates smaller subhypergraphs. We investigate the integrity and meaning of decomposing data so that many processors can attempt to learn the same global pattern simultaneously (although locally, each discovered pattern is usually unique). Many data decompositions are fallacious and lead to nonsensical discovered rules. Some data, however, exhibits enough mutual exclusivity to render it partitionable among processors. This examination of partitionability of data has been the underlying driving force of this work. A great deal of work has been done in parallelizing unguided discovery of association rules. The novel aspects of our work include the parallelization of both a nonmonotonic reasoning system and an inductive logic programming learner. We describe the schemes we have explored and are exploring in this pursuit. We also present our data-partitioning algorithms that we based on data locality.

Published in:

Intelligent Systems and their Applications, IEEE  (Volume:15 ,  Issue: 5 )