-
公开(公告)号：US20110153528A1
公开(公告)日：2011-06-23
申请号：US12641531
申请日：2009-12-18
申请人： PETER BAILEY , LIWEI CHEN , SANAZ AHARI , NIPOON MALHOTRA
发明人： PETER BAILEY , LIWEI CHEN , SANAZ AHARI , NIPOON MALHOTRA
CPC分类号： G06Q30/02
摘要： Computer-readable media, computer systems, and computing devices facilitate providing a comparison experience to a user in response to a search query. Upon receiving a search query from the user, entities are extracted from the query. The entities are associated with entity classes. The entities, entity classes, previous user behavior, and other information are used to infer whether the user likely is engaging in a comparison task. If the inference indicates that the user likely is engaging in a comparison task, a comparison experience is generated and access to the comparison experience is provided to the user.
摘要翻译： 计算机可读介质，计算机系统和计算设备有助于响应于搜索查询向用户提供比较体验。 在从用户接收到搜索查询时，从查询中提取实体。 实体与实体类相关联。 实体，实体类，先前的用户行为和其他信息用于推断用户是否可能参与比较任务。 如果推理指示用户可能正在参与比较任务，则生成比较体验，并且向用户提供对比较体验的访问。
-
公开(公告)号：US20100114908A1
公开(公告)日：2010-05-06
申请号：US12264786
申请日：2008-11-04
申请人： RAJEEV CHAND , PETER BAILEY , TOAN HUYNH , DEANA FULLER , ZACHARY GUTT
发明人： RAJEEV CHAND , PETER BAILEY , TOAN HUYNH , DEANA FULLER , ZACHARY GUTT
CPC分类号： G06F17/30864 , G06F17/30637
摘要： Methods and computer-readable media for determining relevant search categories, such as images, videos, news, health, maps, products, etc., and subcategories that are associated with the search categories based on a query submitted by a user on a search page and displaying the relevant search categories and subcategories on an initial search results page. A query may be inputted by a user and may be received. A set of suggested refinement links, which may include search categories and subcategories, may be identified as being relevant to the query. Further, the subcategories, when selected, may return narrower search results than when a selection is made of a search category. Additionally, the initial search results page may be generated and may include the set of suggested refinement links determined to be relevant to the query, as well as search results.
摘要翻译： 用于基于用户在搜索页面上提交的查询来确定与搜索类别相关联的相关搜索类别（例如图像，视频，新闻，健康，地图，产品等）和子类别的方法和计算机可读介质 并在初始搜索结果页面上显示相关的搜索类别和子类别。 查询可以由用户输入并且可以被接收。 可以将一组建议的细化链接（可能包括搜索类别和子类别）标识为与查询相关。 此外，当选择时，子类别可以返回比搜索类别的选择更窄的搜索结果。 此外，可以生成初始搜索结果页面，并且可以包括确定为与查询相关的建议细化链接的集合以及搜索结果。
-
公开(公告)号：US20120150837A1
公开(公告)日：2012-06-14
申请号：US12964353
申请日：2010-12-09
申请人： FILIP RADLINSKI , NICK CRASWELL , PETER BAILEY
发明人： FILIP RADLINSKI , NICK CRASWELL , PETER BAILEY
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Methods and computer-readable media are provided for interleaving multiple sets of blended search results to identify a preferred set of blended search results for a search query or for a category of search queries. A search query is received and routed to multiple ranking systems, which return search results that are blended into sets of blended search results. Interleaving experiments are performed to determined, based on user preferences, which set of blended search results are preferred for that particular search query. Based on the outcome, a preferred blending algorithm is identified.
摘要翻译： 提供方法和计算机可读介质用于交织多组混合搜索结果以识别用于搜索查询或搜索查询类别的混合搜索结果的优选集合。 搜索查询被接收并被路由到多个排名系统，这些系统返回混合到混合搜索结果集合中的搜索结果。 执行交织实验以基于用户偏好确定哪一组混合搜索结果对于该特定搜索查询是优选的。 基于结果，确定了优选的混合算法。
-
公开(公告)号：US20120150831A1
公开(公告)日：2012-06-14
申请号：US12964092
申请日：2010-12-09
申请人： WALTER SUN , JUNAID AHMED , YIPENG LI , PETER BAILEY , NIKHIL DANDEKAR , SASI PARTHASARATHY , XIN CHEN , XIAO ZHANG
发明人： WALTER SUN , JUNAID AHMED , YIPENG LI , PETER BAILEY , NIKHIL DANDEKAR , SASI PARTHASARATHY , XIN CHEN , XIAO ZHANG
IPC分类号： G06F17/30
CPC分类号： G06F17/30312 , G06F17/3053 , G06F17/30613 , G06F17/30864 , G06F17/30867 , G06F17/30876
摘要： Methods, systems, and computer-readable media are provided for updating a search index with new uniform resource locators (URLs) and spiking URLs with increased user interest. History data, provided from browser applications residing on users' computers that indicate URLs accessed by the users, is parsed to identify new/previously unknown URLs. The history data also indicates URLs in which there is increased interest based on a number of recent hits as compared to an average number of hits determined over time. Author postings of new URLs to social networking sites and a quality rating of the authors may also be used to identify and filter new URLs. Search indexes are updated with the new and spiking URL data. As such, lag time between posting of new URLs and spiking of URL interest and inclusion of this data in a search index is greatly decreased.
摘要翻译： 提供了方法，系统和计算机可读介质，用于使用新的统一资源定位符（URL）更新搜索索引和增加用户兴趣的加标URL。 由驻留在用户计算机上的用于指示用户访问的URL的浏览器应用程序提供的历史数据将被解析，以识别新的/以前未知的URL。 与根据随时间确定的平均击球次数相比，历史数据还指示基于最近命中数的兴趣增加的URL。 社交网站的新URL的作者发布和作者的品质评级也可用于识别和过滤新的URL。 搜索索引将使用新的和加标的URL数据进行更新。 因此，新的URL发布之间的滞后时间和URL兴趣的尖峰以及将这些数据包含在搜索索引中的时间大大降低。
-
公开(公告)号：US20120150847A1
公开(公告)日：2012-06-14
申请号：US12964346
申请日：2010-12-09
申请人： FILIP RADLINSKI , NICK CRASWELL , PETER BAILEY , DANIEL SCHWARTZ , AIDAN CROOK , LIKHITA KRISHNAMURTHY
发明人： FILIP RADLINSKI , NICK CRASWELL , PETER BAILEY , DANIEL SCHWARTZ , AIDAN CROOK , LIKHITA KRISHNAMURTHY
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Methods and computer-readable media are provided for improving the efficiency of the interleaving process. Once it is determined that a search query is to be used in an interleaving experiment, a primary ranking system and a secondary ranking system are analyzed to determine whether their respective search results for that search query would be identical. If the search results would be identical, the search query is routed only to the primary ranking system and not the secondary ranking system. If, however, it is determined that the search results would not be identical, both the primary ranking system and the secondary ranking system receive the search query for processing.
摘要翻译： 提供了用于提高交错处理效率的方法和计算机可读介质。 一旦确定在交织实验中使用搜索查询，则分析主要排名系统和次级排名系统以确定其针对该搜索查询的各自的搜索结果是否相同。 如果搜索结果相同，则搜索查询仅被路由到主要排名系统而不是辅助排名系统。 然而，如果确定搜索结果不相同，则主要排名系统和次级排名系统都接收用于处理的搜索查询。
-
-
-
-
搜索结果
5 条记录 (耗时 0.016 秒)