63 search results - page 5 / 13 » Computing iceberg concept lattices with T |
TAPOS
1998
13 years 5 months ago
1998
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices a...
ICFCA
2007
Springer
13 years 12 months ago
2007
Springer
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
STACS
1991
Springer
13 years 9 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
DAC
2010
ACM
13 years 9 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
ICCS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...