摘要
针对传统方法不能很好地处理网页中简短域和用户查询之间的相关性排序问题,提出一种改进的编辑距离(MED)排序算法,在编码和计算过程中引入查询词分布的位置、顺序和距离等信息,将查询和简短域之间的相关性问题转化为编码字符串的相似性问题。仿真实验结果表明,与传统的相关性排序算法相比,该算法可以提高网页搜索中简短网页域的相关性排序性能。
Aiming at the problems that the traditional methods can not perform well on the short Web page fields,a Modified Edit Distance（MED） algorithm is proposed. In the process of encoding and calculating,the algorithm uses the position,order,and distance information,so the problem on the relevance between the corresponding query and short field can be converted to the problem on the similarity between the encoding strings. Simulation experimental results show this algorithm can significantly outperform the traditional algorithms for relevance ranking on short Web fields,especially for very short fields.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第2期36-38,共3页
Computer Engineering
基金
浙江省科技计划基金资助项目(2007C23050)
