| 基于函数S-粗集的Bellman原理优化算法在知识测度的应用 |
| |
| 引用本文： | 田民格.基于函数S-粗集的Bellman原理优化算法在知识测度的应用[J].三明学院学报,2008,25(4). |
| |
| 作者姓名： | 田民格 |
| |
| 作者单位： | 三明学院,数学与计算机科学系,福建,三明,365004 |
| |
| 摘 要： | 应用函数双向S-粗集理论实现参考模式和测试模式的动态模式匹配．用Bellman原理的动态规划算法实现全局约束定义下的Levenstein距离的计算，以此确定出参考模式和测试模式的距离测度，有明显降低计算复杂度的效果，并以无纸考试系统非标准化试题的智能评分为例进行说明。
|
| 关 键 词： | S-粗集 Bellman原理 Levenstein距离 计算复杂度 |
The Application of Optimization Algorithm Based on Function S-Rough Sets Bellman Principle |
| |
| TIAN Min-ge.The Application of Optimization Algorithm Based on Function S-Rough Sets Bellman Principle[J].Journal of Sanming University,2008,25(4). |
| |
| Authors: | TIAN Min-ge |
| |
| Abstract: | This paper used the theory of Function S-Rough Sets to realize the matching of dynamic mode between reference mode and test mode,and then calculate the Levenstein distance with dynamic programming algorithm of Bellman principle.Taking the intelligence estimate of nonstandardization test questions of no paper examination system as an example,It is found that the Knowledge distance measure which can reduce the effect of computation complexity greatly. |
| |
| Keywords: | S-Rough Sets Bellman principle Levenstein distance computation complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
