Research on Granular Computing Based on Rough Set Theory and Its Application
Linlin Zhou
Abstract
Linlin Zhou
Abstract
Rough Set Theory propose that knowledge is granular,but it does not quantify this granular knowledge.In this paper,we pro-pose definitions of granular amount of knowledge,granular particle amount of knowledge,average granular particle amount of kowledge,approach 1 coefficient and granularity of knowledge;We introduce a method of reduction of knowledge to avoid blindness when choosing the reduction of attributes;Also,the time complexity is analyzed;Finally,the validity is shown through an example of maritime accidents.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Rough Set Theory propose that knowledge is granular,but it does not quantify this granular knowledge.In this paper,we pro-pose definitions of granular amount of knowledge,granular particle amount of knowledge,average granular particle amount of kowledge,approach 1 coefficient and granularity of knowledge;We introduce a method of reduction of knowledge to avoid blindness when choosing the reduction of attributes;Also,the time complexity is analyzed;Finally,the validity is shown through an example of maritime accidents.
Key concepts: Granular computing, Rough set, Granularity, Computer science, Reduction (mathematics), Blindness, Set (abstract data type), Particle (ecology)