Matrix Approaches for Variable Precision Rough Approximations
Many generalizations of variable precision rough set models(VPRS) have been proposed since Ziarko introduced VPRS. This paper proposes the concept of general VPRS approximations which unifies earlier definitions of variant VPRS and gives an efficient matrix formulae for computing approximations of VPRS. This formulae can simplify the calculation of approximations of VPRS.
KeywordsApproximation Boolean matrix Precision degree Rough set Variable precision rough set
- 2.Gong, Z.T., Sun, B.Z., Shao, Y.B., Chen, D.G., He, Q.: Variable precision rough set model based on general relation. In: Proceeding of the Third International Conference On Machine Learning And Cybernetics, Shanghai, pp. 2490–2494 (2014)Google Scholar
- 9.Grassmann, W.K., Tremblay, J.P.: Logic and Discrete Mathematics. A computer Science Perspective. Prentice-Hall, Upper Saddle River (1996)Google Scholar
- 11.Mieszkowicz-Rolka, A., Rolka, L.: Variable precision rough rets in analysis of inconsistent decision tables. In: Rutkowski, L., Kacprzyk, J. (eds.) Adv. Soft Comput. Physica-Verlag, Heidelberg (2003)Google Scholar
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.