公开(公告)号：US08762364B2

公开(公告)日：2014-06-24

申请号：US12050846

申请日：2008-03-18

Applicant: Rajesh Parekh ,  Jignesh Parmar ,  Pavel Berkhin

Inventor： Rajesh Parekh ,  Jignesh Parmar ,  Pavel Berkhin

IPC: G06F17/30

CPC classification number: G06F17/30867

Abstract: Embodiments of the invention relate to methods of presenting personalized search results pages to users, and to search engine systems and servers configured to implement such methods. For example, a method of presenting such a page to a user of a search engine includes steps of computing an engagement index of the user based on the distribution in time of that user's interactions with the search engine then presenting, in response to a query by the user, a personalized search results page to the user.

Abstract translation: 本发明的实施例涉及向用户呈现个性化搜索结果页面的方法以及被配置为实现这种方法的搜索引擎系统和服务器的方法。 例如，向搜索引擎的用户呈现这样的页面的方法包括以下步骤：基于该用户与搜索引擎的交互的时间分布来计算用户的参与度索引，然后响应于以下的查询： 用户，个性化搜索结果页面给用户。

公开(公告)号：US20090240677A1

公开(公告)日：2009-09-24

申请号：US12050846

申请日：2008-03-18

Applicant: Rajesh Parekh ,  Jignesh Parmar ,  Pavel Berkhin

Inventor： Rajesh Parekh ,  Jignesh Parmar ,  Pavel Berkhin

IPC: G06F17/30

CPC classification number: G06F17/30867

Abstract: Embodiments of the invention relate to methods of presenting personalized search results pages to users, and to search engine systems and servers configured to implement such methods. For example, a method of presenting such a page to a user of a search engine includes steps of computing an engagement index of the user based on the distribution in time of that user's interactions with the search engine then presenting, in response to a query by the user, a personalized search results page to the user.

Abstract translation: 本发明的实施例涉及向用户呈现个性化搜索结果页面的方法以及被配置为实现这种方法的搜索引擎系统和服务器的方法。 例如，向搜索引擎的用户呈现这样的页面的方法包括以下步骤：基于该用户与搜索引擎的交互的时间分布来计算用户的参与度索引，然后响应于以下的查询： 用户，个性化搜索结果页面给用户。

公开(公告)号：US20100083194A1

公开(公告)日：2010-04-01

申请号：US12239770

申请日：2008-09-27

Applicant: Abraham Bagherjeiran ,  Jignesh Parmar

Inventor： Abraham Bagherjeiran ,  Jignesh Parmar

IPC: G06F17/50

CPC classification number: G06F17/509 ,  G06F17/10

Abstract: An improved system and method for finding connected components in a large-scale graph is provided. In a map-reduce framework, subsets of a collection of edges for unique vertices may be distributed to several mappers. Connected components of subgraphs represented by each subset of edges may be computed by each mapper. Then the sets of edges for connected components of subgraphs may be sorted by vertex. The sets of edges representing connected components of subgraphs may be distributed to one or more reducers to find maximal sets of weakly connected components of the large-scale graph. The sorted sets of edges for each vertex representing the maximal sets of connected components for subgraphs may be merged by a reducer to identify maximal sets of connected components of a graph, and the maximal sets of connected components of a graph may be output.

Abstract translation: 提供了一种用于在大型图中查找连接的组件的改进的系统和方法。 在map-reduce框架中，用于唯一顶点的边集合的子集可以分布到多个映射器。 由每个边缘子集表示的子图的连接分量可以由每个映射器计算。 然后可以通过顶点对子图的连接组件的边缘集合进行排序。 表示子图的连接分量的边缘集合可以被分配给一个或多个减速器以找到大尺度图的最弱的弱连接分量集合。 表示用于子图的连接组件的最大组的每个顶点的排序集合可以由减法器合并以识别图的连通分量的最大集合，并且可以输出图的连通分量的最大集合。