专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120066195A1 SEARCH ASSIST POWERED BY SESSION ANALYSIS 有权
标题翻译：搜索协助会议分析
公开(公告)号：US20120066195A1
公开(公告)日：2012-03-15
申请号：US12882974
申请日：2010-09-15
申请人： Chi-Hoon Lee , Eric Crestan , Jiefeng Shen , Richard Allan Kasperski , Su-Lin Wu , Omer Emre Velipasaoglu , Benoit Dumoulin
发明人： Chi-Hoon Lee , Eric Crestan , Jiefeng Shen , Richard Allan Kasperski , Su-Lin Wu , Omer Emre Velipasaoglu , Benoit Dumoulin
IPC分类号： G06F17/30
CPC分类号： G06F17/3064
摘要： One embodiment selects from a set of query-suggestion pairs a first query and a subset of query-suggestion pairs that each has the first query as its query; computes a Log Likelihood Ratio (LLR) value for each query-suggestion pair from the subset of query-suggestion pairs; ranks the subset of query-suggestion pairs according to their respective LLR values; removes from the subset of query-suggestion pairs all query-suggestion pairs whose LLR values are below a predetermined LLR threshold; computes a Pointwise Mutual Information (PMI) value for each remaining query suggestion pair from the subset of query-suggestion pairs; removes from the subset of query-suggestion pairs all query-suggestion pairs whose PMI values are below a predetermine PMI threshold; and constructs a ranked set of suggestions for the first query, wherein the ranked set of suggestions comprises one or more suggestions of the remaining query-suggestion pairs from the subset of query-suggestion pairs.
摘要翻译：一个实施例从一组查询建议对中选择第一查询和每个具有第一查询作为其查询的查询建议对的子集; 从查询建议对的子集计算每个查询建议对的对数似然比（LLR）值; 根据各自的LLR值对查询建议对的子集进行排序; 从查询建议对的子集中删除其LLR值低于预定LLR阈值的所有查询建议对; 从查询建议对的子集计算每个剩余查询建议对的点向相互信息（PMI）值; 从查询建议对的子集中删除其PMI值低于预定PMI阈值的所有查询建议对; 并且针对第一查询构建排序的建议集合，其中排名的建议集包括来自查询建议对的子集的剩余查询建议对的一个或多个建议。

2. 发明授权

US08255414B2 Search assist powered by session analysis 有权
标题翻译：搜索辅助由会话分析
公开(公告)号：US08255414B2
公开(公告)日：2012-08-28
申请号：US12882974
申请日：2010-09-15
申请人： Chi-Hoon Lee , Eric Crestan , Jiefeng Shen , Richard Allan Kasperski , Su-Lin Wu , Omer Emre Velipasaoglu , Benoit Dumoulin
发明人： Chi-Hoon Lee , Eric Crestan , Jiefeng Shen , Richard Allan Kasperski , Su-Lin Wu , Omer Emre Velipasaoglu , Benoit Dumoulin
IPC分类号： G06F17/30
CPC分类号： G06F17/3064
摘要： One embodiment selects from a set of query-suggestion pairs a first query and a subset of query-suggestion pairs that each has the first query as its query; computes a Log Likelihood Ratio (LLR) value for each query-suggestion pair from the subset of query-suggestion pairs; ranks the subset of query-suggestion pairs according to their respective LLR values; removes from the subset of query-suggestion pairs all query-suggestion pairs whose LLR values are below a predetermined LLR threshold; computes a Pointwise Mutual Information (PMI) value for each remaining query suggestion pair from the subset of query-suggestion pairs; removes from the subset of query-suggestion pairs all query-suggestion pairs whose PMI values are below a predetermine PMI threshold; and constructs a ranked set of suggestions for the first query, wherein the ranked set of suggestions comprises one or more suggestions of the remaining query-suggestion pairs from the subset of query-suggestion pairs.
摘要翻译：一个实施例从一组查询建议对中选择第一查询和每个具有第一查询作为其查询的查询建议对的子集; 从查询建议对的子集计算每个查询建议对的对数似然比（LLR）值; 根据各自的LLR值对查询建议对的子集进行排序; 从查询建议对的子集中删除其LLR值低于预定LLR阈值的所有查询建议对; 从查询建议对的子集计算每个剩余查询建议对的点向相互信息（PMI）值; 从查询建议对的子集中删除其PMI值低于预定PMI阈值的所有查询建议对; 并且针对第一查询构建排序的建议集合，其中排名的建议集包括来自查询建议对的子集的剩余查询建议对的一个或多个建议。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式