Math 2.0

Order, lattices, ordered algebraic structures Definition

Formal concept analysis

Builds on Binary relationPower setGalois connectionComplete lattice

Definition

A formal context is a triple (G,M,I)(G, M, I) of a set GG of objects, a set MM of attributes and a binary relation I⊆G×MI \subseteq G \times M. One reads gImg \mathrel{I} m as "object gg has attribute mm". For A⊆GA \subseteq G and B⊆MB \subseteq M, put A′={m∈M:gIm for all g∈A},B′={g∈G:gIm for all m∈B}.A' = \set{m \in M : g \mathrel{I} m \text{ for all } g \in A}, \qquad B' = \set{g \in G : g \mathrel{I} m \text{ for all } m \in B}. A formal concept of (G,M,I)(G, M, I) is a pair (A,B)(A, B) with A⊆GA \subseteq G, B⊆MB \subseteq M, A′=BA' = B and B′=AB' = A. The set AA is its extent and BB is its intent. Formal concepts are ordered by (A1,B1)≤(A2,B2)(A_1, B_1) \le (A_2, B_2) if and only if A1⊆A2A_1 \subseteq A_2, which holds if and only if B2⊆B1B_2 \subseteq B_1. The ordered set of all formal concepts is the concept lattice 𝔅(G,M,I)\mathfrak{B}(G, M, I). Formal concept analysis is the study of formal contexts through their concept lattices.

Remarks

The two maps A↦A′A \mapsto A' and B↦B′B \mapsto B' between the power sets of GG and MM form an antitone Galois connection. The extents are the closed sets of the closure operator A↦A′′A \mapsto A''. The concept lattice is a complete lattice: the meet of concepts (Ai,Bi)(A_i, B_i) is (⋂iAi,(⋃iBi)′′)\left(\bigcap_i A_i, \left(\bigcup_i B_i\right)''\right). Conversely, every complete lattice LL is isomorphic to the concept lattice of the context (L,L,≤)(L, L, \le). Example: for G={1,2}G = \set{1, 2}, M={a,b}M = \set{a, b} and I={(1,a),(2,a),(2,b)}I = \set{(1, a), (2, a), (2, b)}, the concepts are ({1,2},{a})(\set{1, 2}, \set{a}) and ({2},{a,b})(\set{2}, \set{a, b}); for instance {1,2}′={a}\set{1, 2}' = \set{a} and {a}′={1,2}\set{a}' = \set{1, 2}. Non-example: in the same context, ({1},{a})(\set{1}, \set{a}) is not a concept, because {a}′={1,2}≠{1}\set{a}' = \set{1, 2} \ne \set{1}.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary relation concept
  2. Complete lattice concept
  3. Galois connection concept
  4. Power set concept
  5. Formal concept analysis definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Formal_concept_analysis
About this page
Tag3EG3HMEGWC
URIm2://3EG3HMEGWC
Kinddefinition
WritingW0 stub
MSC06B99, 68T30, 06A15
DefinesFormal concept analysis
UsesBinary relation, Power set, Galois connection, Complete lattice

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.