主题网络蜘蛛搜索策略贪婪性解决方法  

One Solution About Topic Web Crawler’s Greedy Search Strategy

作　　者：林海霞[1] 原福永[1] 陈金森[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《微电子学与计算机》2006年第z1期278-280,共3页Microelectronics & Computer

摘　　要：主题网络蜘蛛搜索策略是专业搜索引擎的核心技术。但是目前的主题搜索算法往往存在很大贪婪性,难以在全局范围内找到最优解。通过比较分析发现Best-First算法虽然有它的不足,但是它在几种算法中表现的性能最优。故以Best-First算法为基础,提出了BS-BS算法。对BS-BS算法进行性能评价,发现应用此算法搜索不但“召回率”有所提高,还能在一定程度上找到全局范围内的最优解。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 found that despite Best-First algorithm having shortcomings, but its performance is optimal in several algorithms So based on Best-First algorithms it raised BS-BS algorithms. Then it evaluated BS-BS algorithm .And found that not only 'recall rate' had improved, but could get the optimal solutions in the overall situation.

关 键 词：主题网络蜘蛛 Best-First算法 召回率 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]