基于扩展的带路径约束随机游走模型的扩展词排序方法  

Sorting Expansion Terms by Extended Path-constrained Random Walks Model

作　　者：张博[1,2] 张斌[1] 郭鹏伟[1] 孙达明[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110819 [2]沈阳大学信息工程学院,沈阳110044

出　　处：《小型微型计算机系统》2017年第2期254-258,共5页Journal of Chinese Computer Systems

基　　金：国家科技支撑计划项目(2014BAI17B00)资助;宁夏回族自治区自然科学基金项目(NZ13265)资助;中央高校东北大学基本科研专项基金项目(N120804001;N120204003)资助

摘　　要：在同时从点击文档与历史查询条件等多个扩展词来源选取扩展词的过程中,扩展词来源对应的约束值可以影响该来源的扩展词被优先选择的程度.由于现有模型为不同查询条件的相同扩展词来源设置相同的约束值,因此导致所有查询条件优先选择的扩展词来源相同.然而观察日志可以发现,不同查询条件适合从不同扩展词来源选取扩展词.由此,提出一种扩展的带路径约束的随机游走模型.该模型首先对每个查询条件与不同来源扩展词的相关性进行统一尺度的估计,并根据估计结果对不同扩展词来源对应的约束值进行估计,从而使不同的查询条件能够优先选择不同来源的扩展词.一系列实验表明,本文方法构造的扩展查询条件具有更好的性能,更符合用户的查询目标.When selecting expansion terms from both clicked documents and queries in log, path consistent has the influence to the prior choice of expansion terms in each resource. Because current model assigns the same expansion term resource of different queries by the same path consistent value, all queries may prior select the same expansion term resource. However, it can be observed from log that different queries are suitable for selecting expansion terms from different expansion term resources. Therefore, this paper proposed an expanded Path-Constrained Random Walks model. The model firstly evaluates relevance between the query and expansion terms from different resources by a unified judgment,and assigns different expansion term resources of one query with different path consistent values. That allows different queries can prior select different resources of expansion term by their own condition. Experiment results show that performance of expansion query generated by this paper is better and more related to current user intent.

关 键 词：查询扩展 日志挖掘 扩展词排序 随机游走 

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