主题网络蜘蛛搜索策略贪婪性解决方法
发布时间：2019-01-27 07:54
【摘要】：主题网络蜘蛛搜索策略是专业搜索引擎的核心技术。但是目前的主题搜索算法往往存在很大贪婪性,难以在全局范围内找到最优解。通过比较分析发现Best-First算法虽然有它的不足,但是它在几种算法中表现的性能最优。故以Best-First算法为基础,提出了BS-BS算法。对BS-BS算法进行性能评价,发现应用此算法搜索不但“召回率”有所提高,还能在一定程度上找到全局范围内的最优解。
[Abstract]:Topic web spider search strategy is the core technology of professional search engine. However, the current topic search algorithms often have great greed, so it is difficult to find the optimal solution in the global scope. Through comparative analysis, it is found that Best-First algorithm has its shortcomings, but it performs best in several algorithms. Therefore, based on Best-First algorithm, BS-BS algorithm is proposed. By evaluating the performance of the BS-BS algorithm, it is found that the algorithm can not only improve the recall rate, but also find the global optimal solution to a certain extent.
【作者单位】： 燕山大学信息科学与工程学院 燕山大学信息科学与工程学院 燕山大学信息科学与工程学院
【分类号】：TP391.3
本文编号：2416066
[Abstract]:Topic web spider search strategy is the core technology of professional search engine. However, the current topic search algorithms often have great greed, so it is difficult to find the optimal solution in the global scope. Through comparative analysis, it is found that Best-First algorithm has its shortcomings, but it performs best in several algorithms. Therefore, based on Best-First algorithm, BS-BS algorithm is proposed. By evaluating the performance of the BS-BS algorithm, it is found that the algorithm can not only improve the recall rate, but also find the global optimal solution to a certain extent.
【作者单位】： 燕山大学信息科学与工程学院 燕山大学信息科学与工程学院 燕山大学信息科学与工程学院
【分类号】：TP391.3
【相似文献】
相关会议论文 前1条
1 林海霞;原福永;陈金森;;主题网络蜘蛛搜索策略贪婪性解决方法[A];2006年全国开放式分布与并行计算机学术会议论文集（三）[C];2006年
相关硕士学位论文 前1条
1 林海霞;中文专业搜索引擎优化策略研究[D];燕山大学;2006年
，本文编号：2416066
本文链接：https://www.wllwen.com/kejilunwen/sousuoyinqinglunwen/2416066.html
