Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Rajapakse, R.
Right arrow Articles by Denham, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Rajapakse, R.
Right arrow Articles by Denham, M.
(Neural Computation. 2005;17:2291-2300.)
© 2005 The MIT Press


Letter

Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories

Rohana Rajapakse

rrajapakse{at}plymouth.ac.uk, School of Computing, Communications and Electronics, University of Plymouth, Plymouth, PL4 8AA, U.K.

Michael Denham

mdenham{at}plymouth.ac.uk., Centre for Theoretical and Computational Neuroscience, University of Plymouth, Plymouth, PL4 8AA, U.K.

Bidirectional associative memories (BAMs) are shown to be capable of precisely learning concept lattice structures by Radim Belohlávek. 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 Belohlávek, 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.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2005 by The MIT Press.