64 search results - page 10 / 13 » Rough Sets and 3-Valued Logics |
BIRTHDAY
2000
Springer
13 years 11 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
RSCTC
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
TKDE
2010
13 years 2 months ago
2010
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
JANCL
2006
13 years 7 months ago
2006
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...