Sciweavers

1096 search results - page 22 / 220
» Evaluating Algorithms for Concept Description
Sort
View
IAT
2009
IEEE
14 years 3 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
ICDM
2006
IEEE
86views Data Mining» more  ICDM 2006»
14 years 3 months ago
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
The ultimate goal of data mining is to extract knowledge from massive data. Knowledge is ideally represented as human-comprehensible patterns from which end-users can gain intuiti...
Byron J. Gao, Martin Ester
ESWS
2009
Springer
14 years 3 months ago
Decidability of SHI with Transitive Closure of Roles
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to oc...
Chan Le Duc
ECAI
2008
Springer
13 years 10 months ago
Semantic Modularity and Module Extraction in Description Logics
Abstract. The aim of this paper is to study semantic notions of modularity in description logic (DL) terminologies and reasoning problems that are relevant for modularity. We defin...
Boris Konev, Carsten Lutz, Dirk Walther, Frank Wol...
DKE
2002
218views more  DKE 2002»
13 years 8 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...