MATRIX STRUCTURE IN PAWLAK APPROXIMATION SPACE WITH SIMILARITY APPLICATION

In this study, we introduce characteristic matrices of a Pawlak approximation space and support by classical operations. We define special types of characteristic matrices: approximation, roughness, upper and lower approximation and boundary matrices and obtain many useful results such as rough set determination and solving problems involving many data entries in computer environment. We introduce effect sets that give the effective set in solving a problem and using this concept we define accuracy of the approximation. We present a new concept of equivalent matrices and give a novel characterizations of rough sets with similarity measures, using it. We give an application about ”how a company will calculate the estimated value of the timeline it will submit to complete the work” using new similarity methods.