Positive approximation and converse approximation in interval-valued fuzzy rough sets

  • Authors:

  • Yi Cheng;Duoqian Miao;Qinrong Feng

  • Affiliations:

  • Department of Equipment and Engineering, Sichuan College of Architectural Technology, Deyang 618000, China and Department of Computer Science and Technology, Tongji University, Shanghai 201804, Ch ...;Department of Computer Science and Technology, Tongji University, Shanghai 201804, China;Department of Computer Science and Technology, Tongji University, Shanghai 201804, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

Methods of fuzzy rule extraction based on rough set theory are rarely reported in incomplete interval-valued fuzzy information systems. Thus, this paper deals with such systems. Instead of obtaining rules by attribute reduction, which may have a negative effect on inducting good rules, the objective of this paper is to extract rules without computing attribute reducts. The data completeness of missing attribute values is first presented. Positive and converse approximations in interval-valued fuzzy rough sets are then defined, and their important properties are discussed. Two algorithms based on positive and converse approximations, namely, mine rules based on the positive approximation (MRBPA) and mine rules based on the converse approximation (MRBCA), are proposed for rule extraction. The two algorithms are evaluated by several data sets from the UC Irvine Machine Learning Repository. The experimental results show that MRBPA and MRBCA achieve better classification performances than the method based on attribute reduction.