Sciweavers

61 search results - page 9 / 13
» Rough Set Approximation as Formal Concept
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Does intelligence imply contradiction?
Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could ...
Patrizio Frosini
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
GIS
1999
ACM
13 years 12 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
SWAP
2007
13 years 8 months ago
Reasoning with Instances of Heterogeneous Ontologies
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
Luciano Serafini, Andrei Tamilin
ECAI
2008
Springer
13 years 9 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...