| 扩展AUC模型下最优k-部排序函数的计算 |
| |
| 引用本文： | 兰美辉.扩展AUC模型下最优k-部排序函数的计算[J].苏州科技学院学报(自然科学版),2013(4):60-63,80. |
| |
| 作者姓名： | 兰美辉 |
| |
| 作者单位： | 曲靖师范学院计算机科学与工程学院,云南曲靖655011 |
| |
| 基金项目： | 国家自然科学基金资助项目（60903131） |
| |
| 摘 要： | 本体作为一种结构化数据存储和表示模型已成为信息科学的核心研究内容之一.在扩展AUC模型的k-部排序本体算法的框架上,提出一种计算最优k-部排序函数的迭代算法.最后,将算法分别作用于GO本体和大学本体.实验表明：新算法对特定的应用领域具有较高的效率.
|
| 关 键 词： | 本体 相似度 本体映射 k-部排序 AUC量度 |
Calculation of optimal k-partite ranking functions under extended AUC Model |
| |
| LAN Meihui.Calculation of optimal k-partite ranking functions under extended AUC Model[J].Journal of University of Science and Technology of Suzhou,2013(4):60-63,80. |
| |
| Authors: | LAN Meihui |
| |
| Institution: | LAN Meihui (School of Computer Science and Engineering,Qujing Normal University ,Qujing 655011 ,China) |
| |
| Abstract: | As a structured model for data storage and representation, ontology has become an essential part of information science. This paper has proposed a tions under the ontology algorithm of k-partite new iteration algorithm for getting optimal k-partite ranking func- ranking of the extended AUC model. Then, the algorithm has been used in GO ontology and university ontology. The results show that this new algorithm is highly effective in some specific fields of application. |
| |
| Keywords: | ontology similarity ontology mapping k-partite ranking AUC metric |
| 本文献已被 维普 等数据库收录！ |
