Fast access to concepts in concept lattices via bidirectional associative memories

摘要

Bidirectional associative memories (BAMs) are shown to be capable of precisely learning concept lattice structures by Radim Belohlavek. The focus of this letter is to show that the BAM, when set up with a concept lattice by setting up connection weights according to the rule proposed by Belohlavek, always returns the most specific or most generic concept containing the given set of objects or attributes when a set of objects or attributes is presented as input to the object or attribute layer. A proof of this property is given here, together with an example, and a brief application of the property is provided.