5 search results - page 1 / 1 » A Parameterized Algorithm for Exploring Concept Lattices |
ICFCA
2007
Springer
13 years 10 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 (...
TAPOS
1998
13 years 4 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...
DAWAK
2010
Springer
13 years 5 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
CLA
2007
13 years 6 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
CAV
2007
Springer
13 years 10 months ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...