New attribute reduction algorithm employed discernible sets
Shi Yi Yue
Abstract
Shi Yi Yue
Abstract
In attribute reduction algorithms based on discernible matrix,discernible matrix must be acquired firstly. But the space of storing the discernible matrix in computer is very difficulty when the scale of the problem is very large. Moreover,the computing cost of the algorithm is higher. In order to solve above-mentioned problems,the definition of discernible sets is firstly provided,and then a new attribute reduction algorithm based on the discernible sets is designed. so it can cut down the computing and storing capacity greatly.
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.
In attribute reduction algorithms based on discernible matrix,discernible matrix must be acquired firstly. But the space of storing the discernible matrix in computer is very difficulty when the scale of the problem is very large. Moreover,the computing cost of the algorithm is higher. In order to solve above-mentioned problems,the definition of discernible sets is firstly provided,and then a new attribute reduction algorithm based on the discernible sets is designed. so it can cut down the computing and storing capacity greatly.
Key concepts: Computer science, Reduction (mathematics), Algorithm, Matrix (chemical analysis), Scale (ratio), Mathematics, Quantum mechanics, Composite material