Sciweavers

697 search results - page 11 / 140
» Approximation of Information Granule Sets
Sort
View
TEC
2010
77views more  TEC 2010»
14 years 4 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader
RSKT
2007
Springer
15 years 3 months ago
Decision-Theoretic Rough Set Models
Abstract. Decision-theoretic rough set models are a probabilistic extension of the algebraic rough set model. The required parameters for defining probabilistic lower and upper ap...
Yiyu Yao
MOC
1998
111views more  MOC 1998»
14 years 9 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin
RSCTC
2004
Springer
116views Fuzzy Logic» more  RSCTC 2004»
15 years 2 months ago
Constrained Sums of Information Systems
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
Andrzej Skowron, Jaroslaw Stepaniuk
RSKT
2010
Springer
14 years 8 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou