| Novel Web Query Automatic Expansion Based on Rough Set |
| |
| 作者姓名： | YI Gaoxiang HU Heping LU Zhengding LI Ruixuan |
| |
| 作者单位： | [1]College of Computer Science and Technology,Huazhong University of Science and Technology, Wuhan430074, Hubei, China [2]China Academy of Safety Science and Technology,Beijing 100029, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China（60403027） |
| |
| 摘 要： |
|
| 关 键 词： | Web查询 自动扩展 信息检索 粗糙集 |
| 文章编号： | 1007-1202（2006）05-1167-05 |
| 收稿时间： | 2006-02-23 |
Novel Web Query Automatic Expansion Based on Rough Set |
| |
| YI Gaoxiang HU Heping LU Zhengding LI Ruixuan.Novel Web Query Automatic Expansion Based on Rough Set[J].Wuhan University Journal of Natural Sciences,2006,11(5):1167-1171. |
| |
| Abstract: | One of important reasons caused low precision was presented, which was due to inaccurate express of the query. So a new method of automatic query expansion based on tolerance rough was put forward. In the algorithm, the uncertain connection between query terms and retrial documents was described as term tolerance class. The upper approximation set of query sentence was considered as query expansion. The new additional terms were also given weight numbers. The results of experiment on collection of Google 5 000 Web pages showed that the approach was effective on query expansion and high search precision was gained. |
| |
| Keywords: | Web query query expansion rough set |
| 本文献已被 维普 等数据库收录！ |
