| 基于Rough集的情报检索研究 |
| |
| 引用本文： | 李龙澍,张霞.基于Rough集的情报检索研究[J].情报学报,2002,21(1):7-11. |
| |
| 作者姓名： | 李龙澍 张霞 |
| |
| 作者单位： | 1. 安徽大学计算机科学与工程系,合肥,230039
2. 安徽大学化学化工学院,合肥,230039 |
| |
| 基金项目： | 教育部中青年骨干教师基金提供支持 (项目编号 :2 0 0 0 - 6 5 ) |
| |
| 摘 要： | 本文应用Rough集理论和模糊集知识研究一种新的情报检索系统 ,提出了新的情报检索方法。论文给出了这个系统的体系结构和系统的核心算法 ,进行了算法复杂性分析 ,检索算法的时间复杂性为 0 (log2 M)。它的主要特点是检索算法的时间复杂性不随着文献资料数量的增加而增加 ,只与主要标引词的多少有关。分析结果表明这是一种有效的算法
|
| 关 键 词： | Rough集 情报检索 模糊集 模糊检索 |
| 修稿时间： | 2000年11月24 |
Research on a New Type of Information Retrieval System Based on Rough Set |
| |
| Li Longshu.Research on a New Type of Information Retrieval System Based on Rough Set[J].Journal of the China Society for Scientific andTechnical Information,2002,21(1):7-11. |
| |
| Authors: | Li Longshu |
| |
| Abstract: | In this paper,a new type of information retrieval system was designed using rough set theory and fuzzy set knowledge.A new information retrieval method was advanced.The architecture of the system and its key algorithms were given.Time complexities of the algorithms were analyzed.The time complexity of the retrieval algorithm is 0(log 2M).Main characteristic of the researching achievement is that retrieval algorithm's time complexity is not increased with the increase of amount of document.The retrieval algorithm's time complexity relates to the only amount of index words.Analyzed results show that it is an effective method. |
| |
| Keywords: | rough set information retrieval fuzzy set fuzzy retrieval |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
