Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
Authors:
- Degang ChenDCDegang Chen
- Wanlu LiWLWanlu Li
- Xiao ZhangXZXiao Zhang
- Sam KwongSKSam Kwong
- 1 March 2014
- journal article
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 55 (3) , 908-923
Abstract
No abstract availableFunding Information
- NSFC (71171080, 61170107)
- Beijing Municipal Commission of Education
This publication has 28 references indexed in Scilit:
- Covering based rough set approximationsInformation Sciences, 2012
- On minimization of axiom sets characterizing covering-based approximation operatorsInformation Sciences, 2011
- Axiomatization and conditions for neighborhoods in a covering to form a partitionInformation Sciences, 2011
- The further investigation of covering-based rough sets: Uncertainty characterization, similarity measure and generalized modelsInformation Sciences, 2010
- Relationship among basic concepts in covering-based rough setsInformation Sciences, 2009
- Approaches to knowledge reduction of covering decision systems based on information theoryInformation Sciences, 2009
- Rough approximations on a complete completely distributive lattice with applications to generalized rough setsInformation Sciences, 2006
- Reconstruction of cooperative information systems under cost constraints: A rough set approachInformation Sciences, 1998
- Relational interpretations of neighborhood operators and rough set approximation operatorsInformation Sciences, 1998
- Interpretations of belief functions in the theory of rough setsInformation Sciences, 1998