Parallel Induction Systems based on Branch and Bound
Ken K. Jung, Evangelos Simoudis, Ramesh Subramonian · 1993
Symbolic inductive learning systems explore a space of hypotheses to derive the definition of concepts. Due to the size and complexity of this space, sequential algo-rithms use various heuristics that limit the classification accuracy of the generated definitions. Parallel search al-gorithm can rectify such limitations. In this paper we present the PARIS parallel symbolic inductive system. PARIS uses the branch and bound search algorithm. It has been implemented on the Thinking Machines CM-5 and the MasPar MP-1 computers, and has been tested on the domain of financial analysis. 1