Hybrid approaches to attribute reduction based on indiscernibility and discernib
Attribute reduction is one of the key issues in rough set theory. Many heuristic attribute reduction algorithms such as positive-region reduction, information entropy reduction and discernibility matrix reduction have been proposed. However, these methods are usually computationally time-consuming f
下载地址
用户评论