会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • SMOOTHING CLICKTHROUGH DATA FOR WEB SEARCH RANKING
    • 用于网络搜索排名的平滑点击数据
    • US20100318531A1
    • 2010-12-16
    • US12481593
    • 2009-06-10
    • Jianfeng GaoXiao LiKefeng DengWei YuanJian-Yun Nie
    • Jianfeng GaoXiao LiKefeng DengWei YuanJian-Yun Nie
    • G06F17/30G06F15/18
    • G06F16/337G06F16/335G06F16/355
    • Described is a technology for using clickthrough data (e.g., based on data of a query log) in learning a ranking model that may be used in online ranking of search results. Clickthrough data, which is typically sparse (because many documents are often not clicked or rarely clicked), is processed/smoothed into smoothed clickthrough streams. The processing includes determining similar queries for a document with incomplete (insufficient) clickthrough data to provide expanded clickthrough data for that document, and/or by estimating at least one clickthrough feature for a document when that document has missing (e.g., no) clickthrough data. Similar queries may be determined by random walk clustering and/or session-based query analysis. Features extracted from the clickthrough streams may be used to provide a ranking model which may then be used in online ranking of documents that are located with respect to a query.
    • 描述了一种用于在学习可用于搜索结果的在线排名中的排名模型的点击数据(例如,基于查询日志的数据)的技术。 点击数据通常是稀疏的(因为许多文档经常没有点击或很少点击)被处理/平滑到平滑的点击流中。 该处理包括确定具有不完整(不足够的)点击数据的文档的类似查询,以便为该文档提供扩展的点击数据,和/或通过在该文档缺少(例如,否))点击数据时估计文档的至少一个点击特征 。 可以通过随机游走聚类和/或基于会话的查询分析来确定类似的查询。 从点击流中提取的特征可以用于提供排序模型,然后可以在相对于查询定位的文档的在线排名中使用排名模型。
    • 4. 发明授权
    • Structured cross-lingual relevance feedback for enhancing search results
    • 结构化的跨语言相关性反馈,以增强搜索结果
    • US08645289B2
    • 2014-02-04
    • US12970879
    • 2010-12-16
    • Paul Nathan BennettJianfeng GaoJagadeesh JagarlamudiKristen Patricia Parton
    • Paul Nathan BennettJianfeng GaoJagadeesh JagarlamudiKristen Patricia Parton
    • G06F15/18
    • G06F17/30669G06F17/30675
    • A “Cross-Lingual Unified Relevance Model” provides a feedback model that improves a machine-learned ranker for a language with few training resources, using feedback from a more complete ranker for a language that has more training resources. The model focuses on linguistically non-local queries, such as “world cup” (English language/U.S. market) and “copa mundial” (Spanish language/Mexican market), that have similar user intent in different languages and markets or regions, thus allowing the low-resource ranker to receive direct relevance feedback from the high-resource ranker. Among other things, the Cross-Lingual Unified Relevance Model differs from conventional relevancy-based techniques by incorporating both query- and document-level features. More specifically, the Cross-Lingual Unified Relevance Model generalizes existing cross-lingual feedback models, incorporating both query expansion and document re-ranking to further amplify the signal from the high-resource ranker to enable a learning to rank approach based on appropriately labeled training data.
    • “跨语言统一相关性模型”提供了一种反馈模型,可以为少数培训资源的语言改进机器学习游戏者,使用更完整的游戏者的反馈来获得具有更多培训资源的语言。 该模式侧重于语言上的非本地查询,例如“世界杯”(英语/美国市场)和“复合世界”(西班牙语/墨西哥市场),在不同语言和市场或区域具有类似的用户意图,因此 允许低资源游击队员接收来自高资源队员的直接相关反馈。 其中,跨语言统一相关性模型与传统的相关性技术不同,包括查询和文档级功能。 更具体地说,跨语言统一相关性模型概括了现有的跨语言反馈模型,其中包括查询扩展和文档重新排序,以进一步放大来自高资源游戏者的信号,以使学习能够基于适当标记的训练进行排名 数据。
    • 5. 发明申请
    • Enhanced Query Rewriting Through Statistical Machine Translation
    • 通过统计机器翻译增强查询重写
    • US20120254218A1
    • 2012-10-04
    • US13078648
    • 2011-04-01
    • Alnur AliJianfeng GaoXiaodong HeBodo von BillerbeckSanaz Ahari
    • Alnur AliJianfeng GaoXiaodong HeBodo von BillerbeckSanaz Ahari
    • G06F17/30
    • G06F17/30672
    • Systems, methods, and computer media for identifying query rewriting replacement terms are provided. A list of related string pairs each comprising a first string and second string is received. The first string of each related string pair is a user search query extracted from user click log data. For one or more of the related string pairs, the string pair is provided as inputs to a statistical machine translation model. The model identifies one or more pairs of corresponding terms, each pair of corresponding terms including a first term from the first string and a second term from the second string. The model also calculates a probability of relatedness for each of the one or more pairs of corresponding terms. Term pairs whose calculated probability of relatedness exceeds a threshold are characterized as query term replacements and incorporated, along with the probability of relatedness, into a query rewriting candidate database.
    • 提供了用于识别查询重写替换术语的系统,方法和计算机媒体。 接收包括第一串和第二串的相关字符串对的列表。 每个相关字符串对的第一个字符串是从用户点击日志数据中提取的用户搜索查询。 对于一个或多个相关字符串对,字符串对作为统计机器翻译模型的输入提供。 该模型识别一对或多对对应的术语,每对对应的术语包括来自第一个字符串的第一项和来自第二个字符串的第二个项。 该模型还计算一对或多对相应项中的每一对的相关概率。 其相关性概率超过阈值的术语对被表征为查询词替换,并将其与相关性的概率一起并入查询重写候选数据库中。
    • 6. 发明申请
    • DEPENDENCY-BASED QUERY EXPANSION ALTERATION CANDIDATE SCORING
    • 基于依赖性的查询扩展替换候选评分
    • US20120131031A1
    • 2012-05-24
    • US12951068
    • 2010-11-22
    • Shasha XieXiaodong HeJianfeng Gao
    • Shasha XieXiaodong HeJianfeng Gao
    • G06F17/30
    • G06F17/30967G06F17/30672
    • An alteration candidate for a query can be scored. The scoring may include computing one or more query-dependent feature scores and/or one or more intra-candidate dependent feature scores. The computation of the query-dependent feature score(s) can be based on dependencies to multiple query terms from each of one or more alteration terms (i.e., for each of the one or more alteration terms, there can be dependencies to multiple query terms that form at least a portion of the basis for the query-dependent feature score(s)). The computation of the intra-candidate dependent feature score(s) can be based on dependencies between different terms in the alteration candidate. A candidate score can be computed using the query dependent feature score(s) and/or the intra-candidate dependent feature score(s). Additionally, the candidate score can be used in determining whether to select the candidate to expand the query. If selected, the candidate can be used to expand the query.
    • 可以对查询的变更候选进行评分。 评分可以包括计算一个或多个依赖于查询的特征得分和/或一个或多个候选内相关特征得分。 依赖于查询的特征得分的计算可以基于来自一个或多个改变项中的每一个的多个查询词的依赖性(即,对于一个或多个改变术语中的每一个,可以依赖于多个查询术语 其形成用于查询相关特征得分的基础的至少一部分)。 候选者相关特征得分的计算可以基于变更候选者中不同术语之间的依赖关系。 可以使用查询相关特征得分和/或候选内相关特征得分来计算候选分数。 此外,可以使用候选分数来确定是否选择候选来扩展查询。 如果选择,候选人可以用来扩展查询。
    • 8. 发明授权
    • Method and system for retrieving confirming sentences
    • 检索确认句子的方法和系统
    • US07974963B2
    • 2011-07-05
    • US11187567
    • 2005-07-22
    • Ming ZhouHua WuYue ZhangJianfeng GaoChang-Ning Huang
    • Ming ZhouHua WuYue ZhangJianfeng GaoChang-Ning Huang
    • G06F17/00
    • G06F17/3069Y10S707/99933
    • A method, computer readable medium and system are provided which retrieve confirming sentences from a sentence database in response to a query. A search engine retrieves confirming sentences from the sentence database in response to the query. IN retrieving the confirming sentences, the search engine defines indexing units based upon the query, with the indexing units including both lemma from the query and extended indexing units associated with the query. The search engine then retrieves a plurality of sentences from the sentence database using the defined indexing units as search parameters. A similarity between each of the plurality of retrieved sentences and the query is determined by the search engine, wherein each similarity is determined as a function of a linguistic weight of a term in the query. The search engine then ranks the plurality of retrieved sentences based upon the determined similarities.
    • 提供了一种方法,计算机可读介质和系统,其响应于查询从句子数据库中检索确认句子。 搜索引擎响应于查询从句子数据库中检索确认句子。 在检索确认语句中,搜索引擎基于查询来定义索引单元,索引单元包括来自查询的引理和与查询相关联的扩展索引单元。 然后,搜索引擎使用定义的索引单元作为搜索参数从句子数据库中检索多个句子。 由搜索引擎确定多个检索到的句子和查询中的每一个之间的相似度,其中每个相似度被确定为查询中的术语的语言权重的函数。 然后,搜索引擎基于所确定的相似度对多个检索到的句子进行排序。