[CSUSB]>> [CNS]>> [CSE]>> [R J Botting]>> biba.php

#### Bibliographic Item (1.0)

- Bernhard Ganter & Rudolf Wille R
- Formal concept analysis: Mathematical foundations
- Springer 1999 QA171.5 G3513 1999
- =THEORY MATHEMATICAL FORMAL LOGIC LATTICE CONCEPT
- Given a set of objects X, a set of attributes Y, and a relation R:@(X><Y),
then (X,Y,R) is called a formal context. If A is a subset of X then define
A'={y:Y. for all x:A(x R y)}. Similarly B'={x:X.for all y:B( x R y)}. A
formal concept is a pair (A, B) where A'=B and B'=A, and A is the extent and
B the intent of concept (A,B). The subconcept_superconcept relation:(A1,B1)
<= (A2,B2) iff A1 is a subset of A2. This defines a lattice of formal
concepts.
- Leads to a diagram showing the underlying structure of the relation R.
- Given a table X><Y<>-> Z and by defining a scaling Z into (true, false) then a context can be defined.
- See
[ logic_42_Properties_of_Relation.html ]
for some rough notes on Concept analysis.
- Note. Theory has been used to aid the maintenance of software:
[BojicVelasevic00]

[DeursenKuipers99]

[LindigSnelting97]

[SiffReps99]

[Snelting96]

[SneltingTip98]

Search for bibliographic items containing a matching string. Search for a specific bibliographic item by name.

To see the complete bibliography (1Mb+) select:[Bibliography]