Sciweavers

230 search results - page 7 / 46
» Learning Generalized Policies from Planning Examples Using C...
Sort
View
SAC
2010
ACM
15 years 8 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
IAT
2006
IEEE
15 years 7 months ago
Learning Non-Unanimous Ontology Concepts to Communicate with Groups of Agents
We present an extension to the definition of a concept in an ontology that allows an agent to simultaneously communicate with a group of agents that might have different understa...
Mohsen Afsharchi, Behrouz H. Far, Jörg Denzin...
ICGI
2010
Springer
15 years 2 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
ECAI
1992
Springer
15 years 5 months ago
Shift of Bias without Operators
Just as the order defined by generality over concepts allows concept induction to be performed without generalisation/specialisation operators, so too the order defined by set inc...
Claudio Carpineto
ICFCA
2007
Springer
15 years 7 months ago
A Parameterized Algorithm for Exploring Concept Lattices
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 (...
Peggy Cellier, Sébastien Ferré, Oliv...