检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国航空计算技术研究所,西安710068 [2]西北工业大学计算机学院,西安710072 [3]中国电子科技集团公司第二十八研究所,南京210007
出 处:《计算机科学》2010年第4期132-135,162,共5页Computer Science
基 金:国家自然科学基金(No.60803043);国家高技术研究发展计划(863)(No.2009AA1Z134)资助
摘 要:语义查询扩展中,关键一步是扩展词的选择方法和扩展词权重的计算。提出一种改进的LCA(局部上下文分析法):OLCA(Optimize Local Context Analysis)。OLCA应用于分权重的多关键字查询中,结合WordNet概念树,从语义和实际查询语料两方面对初始查询词进行扩展,并根据初始查询词中多个关键词的位置,结合扩展候选集中词间关系计算修正各扩展词的权重。实验证明,与单独基于统计或基于语义的查询扩展方法相比,其查准率和查全率均有较大提高。In semantic-based query expansion, computing expansion words and its weight is a key step to describe the needed query. We proposed a method called OLCA (keyword to concept method), the idea comes from LCA(Local context analysis). We made some improvement and applied it to multi-keywords query with different weight according to their attribute to the query. Combined with concept tree based on WordNet, we made the query expansion performed from both semantic and the real query documents aspects, and calculated the weight of expansion term based on this technique. Compared with the one based on semantic or the traditional expansion which merely is based on statistic, the experiments reveal that this method can achieve a better query quality.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.48.103