Deakin University

File(s) not publicly available

Schematic recognition and the CLARET consolidated learning algorithm

conference contribution
posted on 1997-01-01, 00:00 authored by A Pearce, Terry CaelliTerry Caelli
A new learning algorithm, the Consolidated Learning Algorithm based on Relational Evidence Theory (CLARET) is presented, which relies on inductive logic programming and graph matching techniques. In Relational Evidence Theory, two different approaches to evidential learning are consolidated in how they apply to generalizing within relational data structures. Attribute-based discrimination (decision trees) is integrated with part-based interpretation (graph matching) for evaluating and updating representations in spatial domains. This allows an interpretation stage to be incorporated into the generalization process. A systematic approach to finding interpretations is demonstrated for an online, hand drawn, schematic diagram and symbols recognition system. The approach uses an adaptive representational bias and search strategy during learning by efficiently grounding the learning procedures in the relational spatial constraints of their application.





64 - 71

Publication classification

E1.1 Full written paper - refereed

Title of proceedings

International Conference on Knowledge-Based Intelligent Electronic Systems, Proceedings, KES

Usage metrics

    Research Publications


    No categories selected