Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
„Formal“ Construction of Concept Lattice
- This algorithm works on a finite context (G,M,I) with a lexographic ordering
- The lexographically smallest extent is ∅ ;
- for i=1 we have {1,...,i-1} = ∅
- For an arbitrary X⊆G, one can find the lexographically next concept extent by checking all elements y ∈ G – X (beginning with the lexographically largest) until X ≺ i X ⊕ i for the first time.
- ⊕ denotes the operation of extending the object set
- X ⊕ i = ((X ∩ {1,...,i-1}) ⋃ {i})‘‘
- X ⊕ i is the lexographically next extent
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.