The minimum attributes reduction set is expected to acquire the brief regulated set. This is taken as NP-hard Problem, which can be figured out through the heuristic algorithm.
为了获得简明的规则集，通常希望能找出最小的属性约简集，而求解最小约简是NP难问题，解决此类难题通常采用启发式算法以求得近似最优解。
The minimum attributes reduction set is expected to acquire the brief regulated set. This is taken as NP-hard Problem, which can be figured out through the heuristic algorithm.
为了获得简明的规则集，通常希望能找出最小的属性约简集，而求解最小约简是NP难问题，解决此类难题通常采用启发式算法以求得近似最优解。
应用推荐