Sciweavers

1096 search results - page 2 / 220
» Evaluating Algorithms for Concept Description
Sort
View
DLOG
2001
13 years 6 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
AICOM
2006
105views more  AICOM 2006»
13 years 5 months ago
Evolutionary concept learning in First Order Logic: An overview
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a short description of the two popular ILP systems FOIL and Progol, we focus on meth...
Federico Divina
IJCAI
1993
13 years 6 months ago
HYDRA: A Noise-tolerant Relational Concept Learning Algorithm
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...
Kamal M. Ali, Michael J. Pazzani
MMM
2009
Springer
151views Multimedia» more  MMM 2009»
14 years 2 months ago
Large Scale Concept Detection in Video Using a Region Thesaurus
This paper presents an approach on high-level feature detection within video documents, using a Region Thesaurus. A video shot is represented by a single keyframe and MPEG-7 featur...
Evaggelos Spyrou, Giorgos Tolias, Yannis S. Avrith...
JWSR
2007
89views more  JWSR 2007»
13 years 5 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...