• Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.

    基础上提出了优化知识约简算法算法的时间复杂度多项式的。

    youdao

  • After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.

    再次,有序决策进行研究提出了基于优势矩阵的启发式属性约简算法

    youdao

  • After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.

    再次,有序决策进行研究提出了基于优势矩阵的启发式属性约简算法

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定