Sciweavers

464 search results - page 3 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
KBS
2008
98views more  KBS 2008»
14 years 7 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
15 years 29 days ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
15 years 2 months ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...
ISMIS
2000
Springer
15 years 29 days ago
Design of Rough Neurons: Rough Set Foundation and Petri Net Model
This paper introduces the design of rough neurons based on rough sets. Rough neurons instantiate approximate reasoning in assessing knowledge gleaned from input data. Each neuron c...
James F. Peters, Andrzej Skowron, Zbigniew Suraj, ...
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
15 years 4 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
Dan A. Simovici, Selim Mimaroglu