The general algorithms for maximum distribution reduction, assignment reduction and ordered assignment reduction are examined and their time complexities are analyzed.
给出了最大分布约简、分配约简、分配序约简的一般算法。
From this view a partition of the boundary of a rough set is obtained and the concepts of band rough set and band distribution reduction and maximum distribution reduction are presented.
基于这一思想提出了分级粗糙集模型和分级最大分布约简、分级分布约简的概念。
应用推荐