Time complexity of this decomposition algorithm is far less than the classical reduction method in RST, speed of calculation is raised and information are not loss.
该分解算法的计算时间复杂度远小于经典粗糙集约简算法的计算时间复杂度，在提高计算速度的同时不会损失信息量。
Time complexity of this decomposition algorithm is far less than the classical reduction method in RST, speed of calculation is raised and information are not loss.
该分解算法的计算时间复杂度远小于经典粗糙集约简算法的计算时间复杂度，在提高计算速度的同时不会损失信息量。
应用推荐