184 search results - page 20 / 37 » Horn-Representation of a Concept Lattice |
66
Voted
SARA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attrib...
FLAIRS
2001
14 years 11 months ago
2001
We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, a...
115
click to vote
KDD
2012
ACM
13 years 2 days ago
2012
ACM
Intelligence analysts grapple with many challenges, chief among them is the need for software support in storytelling, i.e., automatically ‘connecting the dots’ between dispar...
104
click to vote
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
MLQ
2002
14 years 9 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...