SLIDE 8 Introduction Lattice Associative Memories Applications Concluding remarks Lattice Computing Lattice Computing Approaches
Formal Concept Analysis
Application of lattice theory to semantic analysis Ontology induction from data
intensional (attributes) and extensional (instances) representation of concepts building the lattice induced by the partial order of concepts
((A,L,P,Re,Ro),(Cap)) ((I,L,P,Ro),(Riv)) ((C,I,Re),(Ski)) ((A,C,I,P,Ro),(Eur)) ((A,P,Ro),(Cap,Eur)) ((L,P,Ro),(Cap,Riv)) ((Re),(Cap,Ski)) ((A,C,I,L,P,Re,Ro),( )) ((A,Ro),(Arc,Bea,Cap,Eur)) ((C,I),(Eur,Ski)) ((P,Ro),(Cap,Eur,Riv)) ((I),(Eur,Riv,Ski)) ((Ro),(Arc,Bea,Cap,Eur,Riv)) (( ),(Arc,Bea,Cap,Eur,Riv,Ski)) ((I,P,Ro),(Eur,Riv))
- Fig. 1. Concept Lattice of the European Cities context.
Manuel Graña Lattice Computing in Hybrid Intelligent Systems