Sciweavers

111 search results - page 3 / 23
» Definability in Logic and Rough Set Theory
Sort
View
IJAR
2008
82views more  IJAR 2008»
13 years 4 months ago
Probabilistic rough set approximations
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
Yiyu Yao
CIE
2009
Springer
13 years 8 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
13 years 7 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
TSMC
2010
12 years 11 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
FBIT
2007
IEEE
13 years 10 months ago
Rough Set Based Information Retrieval from Argumentative Data Points in Weblogs
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
Sea Woo Kim, Chin-Wan Chung