Research on the N-Reduction of Fuzzy Covering Rough Sets

Qiao Yan Li; Yan Yan Chen; Shao Yang Li

doi:10.4028/www.scientific.net/AMM.556-562.3682

Paper Titles

Binary Particle Swarm Optimization (BPSO) Algorithm for Distributed Node Localization
p.3666

A New Approach of Routing Algorithms in Nanonetwork for Molecular Communication
p.3670

Large Ship Fluidsolid Coupling Dynamic Mathematic Model with Explicitly Form
p.3674

A Basic Computation Model of Added Mass on Ship Section with Green Function
p.3678

Research on the N-Reduction of Fuzzy Covering Rough Sets
p.3682

Optimal Design of Non-Uniform Linear Array Using Genetic Algorithm
p.3686

The Extension Method in Flow Allocation Problems
p.3692

Improved Window Function in the Application of MFCC Feature Parameter Extraction
p.3703

An Parallel Anti-Collision Algorithm Based on Adaptive Multi-Tree Search
p.3707

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562Research on the N-Reduction of Fuzzy Covering...

Research on the N-Reduction of Fuzzy Covering Rough Sets

Abstract:

The granular reduction plays an important role in covering rough sets, and the aim of this paper is to explore the granular reduction of covering rough sets and fuzzy covering rough set Firstly, the covering rough sets based on neighborhood element and the N-reduction are introduced, and their properties are discussed; secondly, The definitions and properties of upper and lower approximation of fuzzy covering rough based on the neighborhood are given; Lastly, the N- reduction of fuzzy covering rough based on the neighborhood element is proposed, and we can get that covering rough sets remain the same upper and lower approximations for N-reduction.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

3682-3685

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.3682

Citation:

Cite this paper

Online since:

May 2014

Authors:

Qiao Yan Li*, Yan Yan Chen, Shao Yang Li

Keywords:

Covering Rough Sets, Fuzzy Covering Rough Set, Granular Reduction, N-Reduction

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Z. Pawlak: Rough sets. The International Journal of Computer and Information Science, Vol. 11 (1982), p.341–356.

Google Scholar

[2] W. Zakowski: Approximation in the space (m, p) . In The individual Mathematica. Vol. 16 (1983), p.761–769.

Google Scholar

[3] J A. Pomykala: Approximations Operations in Approximations Space. Bulletin of the Polish Academy of Sciences, Mathematics, Vol. 35 (1987), p.653–662.

Google Scholar

[4] W. Zhu: Relationship between generalized rough sets based on binary and relation covering. Information Sciences, Vol. 119 (2009), p.210–225.

DOI: 10.1016/j.ins.2008.09.015

Google Scholar

[5] W. H. Xu and W. X. Zhang: Measuring Roughness of Generalized Rough sets Induced by a Covering. Fuzzy Sets and Systems, Vol. 158 (2007), p.2443–2445.

DOI: 10.1016/j.fss.2007.03.018

Google Scholar

[6] W. Zhu and F .Y. Wang: Reduction and Axiomization of Covering Rough Sets, Information Sciences, Vol. 152 (2003), p.217–230.

DOI: 10.1016/s0020-0255(03)00056-2

Google Scholar

[7] T. Yang and Q. Li: Reduction about Approximation Spaces of Covering Generalized Rough Sets. In International Journal of Approximate Reasoning, Vol. 51 (2010), p.335–345.

DOI: 10.1016/j.ijar.2009.11.001

Google Scholar

[8] A. Zadeh: Fuzzy sets. Information and Control, Vol. 8 (1965), pp.358-363.

Google Scholar

[9] D. G. Chen, C. Z. Wang and Q. H. Hu: A new approaches to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Information Sciences, Vol. 177 (2007), pp.3500-3518.

DOI: 10.1016/j.ins.2007.02.041

Google Scholar