Changes

[[Image:lighterstill.jpg]]

[[Image:lighterstill.jpg]]

A '''Concept lattice'''' or formal concept analysis is a principled way of automatically deriving an [[ontology]] from a collection of objects and their properties. The term was introduced by Rudolf Wille in 1984, and builds on applied [[lattice theory|lattice]] and order theory that was developed by [[Garrett Birkhoff|Birkhoff]] and others in the 1930's.

 

 

 

 

In [[mathematics]], a '''lattice''' is a partially ordered set (also called a ''poset'') in which subsets of any ''two elements'' have a unique supremum (the elements' least upper bound; called their '''|join''') and an infimum (greatest lower bound; called their '''meet'''). Lattices can also be characterized as algebraic [[structure]]s satisfying certain axiomatic |identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These "lattice-like" structures all admit order-theoretic as well as algebraic descriptions.

 

 

 

 

 

 

 

 

 

Concept lattice or formal concept analysis is a principled way of automatically deriving an [[ontology]] from a collection of objects and their properties. The term was introduced by Rudolf Wille in 1984, and builds on applied [[lattice theory|lattice]] and order theory that was developed by [[Garrett Birkhoff|Birkhoff]] and others in the 1930's.

==Intuitive description==

==Intuitive description==