184 search results - page 18 / 37 » Horn-Representation of a Concept Lattice |
103
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
STACS
1991
Springer
15 years 1 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....
104
click to vote
DAWAK
2010
Springer
14 years 10 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...
AI
2006
Springer
15 years 1 months ago
2006
Springer
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a ...
102
click to vote
IWPC
2007
IEEE
15 years 3 months ago
2007
IEEE
The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In th...