Learning algorithms using a Galois lattice structure

An incremental algorithm for updating the Galois lattice is proposed where new objects may be dynamically added by modifying the existing lattice. A large experimental application reveals that adding a new object may be done in time proportional to the number of objects on the average. When there is a fixed upper bound on the number of properties related to an object, which is the case in practical applications, the worst case analysis of the algorithm confirms the experimental observations of linear growth with respect to the number of objects. Algorithms for generating rules from the lattice are also given.<<ETX>>