| 一种改进的主题网络蜘蛛搜索算法 |
| |
| 引用本文： | 林海霞,原福永,陈金森,刘俊峰.一种改进的主题网络蜘蛛搜索算法[J].计算机工程与应用,2007,43(10):174-176. |
| |
| 作者姓名： | 林海霞 原福永 陈金森 刘俊峰 |
| |
| 作者单位： | 燕山大学,信息科学与工程学院,河北,秦皇岛,066004 |
| |
| 摘 要： | 主题网络蜘蛛搜索策略是专业搜索引擎的核心技术。但是目前的主题搜索算法往往存在很大贪婪性,难以在全局范围内找到最优解。通过比较分析发现Best-First算法虽然有它的不足,但是它在几种算法中表现的性能最优。故以Best-First算法为基础,提出了BS-BS算法。对BS-BS算法进行性能评价,发现应用此算法搜索不但“召回率”有所提高,还能在一定程度上找到全局范围内的最优解。
|
| 关 键 词： | 主题网络蜘蛛 Best-First算法 召回率 |
| 文章编号： | 1002-8331（2007）10-0174-03 |
| 修稿时间： | 2006-08 |
Improved algorithm about topic web crawler's search strategy |
| |
| LIN Hai-xai,YUAN Fu-yong,CHEN Jin-sen,LIU Jun-feng.Improved algorithm about topic web crawler''''s search strategy[J].Computer Engineering and Applications,2007,43(10):174-176. |
| |
| Authors: | LIN Hai-xai YUAN Fu-yong CHEN Jin-sen LIU Jun-feng |
| |
| Abstract: | Topic web crawler search strategy is the core of professional search engine technology.However,the current topic search algorithms always exist large greedy.It is difficult to find optimal solutions in the overall situation.Through comparative analysis find that despite Best-First algorithm having shortcomings,but its performance is optimal in several algorithms.So based on Best-First algorithms it raises BS-BS algorithms.Then it evaluates BS-BS algorithm.And find that not only "recall rate" has improved,but can get the optimal solutions in the overall situation. |
| |
| Keywords: | topic web crawler Best-First algorithm recall ratio |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
