LEVERAGING A SOCIAL GRAPH FOR USE WITH ELECTRONIC MESSAGING
    2.
    发明申请
    LEVERAGING A SOCIAL GRAPH FOR USE WITH ELECTRONIC MESSAGING 有权
    利用电子消息传递使用社交图

    公开(公告)号:US20130254303A1

    公开(公告)日:2013-09-26

    申请号:US13430284

    申请日:2012-03-26

    IPC分类号: G06F15/16

    摘要: Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying a person to whom a message is to be communicated, a social graph is analyzed to identify connection paths connecting the message sender, or an entity on whose behalf the message sender is acting, to the message recipient. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path having the highest path score, as derived by aggregating edge scores assigned to the edges, may be presented.

    摘要翻译: 描述了用于分析社交网络服务的社交图以识别并随后呈现连接各种实体的连接路径的技术。 对于一些实施例,在用户选择或以其他方式识别要向其传达消息的人员之后,分析社交图来标识将消息发送者或其代表消息发送者正在行动的实体连接到的连接路径到 消息收件人。 社会图用分别具有表示实体和实体之间的关联的节点和边的图形数据结构来实现。 在一些实施例中,节点代表人,公司,教育机构(例如,学校,大学等)和组。 在识别连接路径之后,可以呈现通过聚合分配给边缘的边缘分数导出的具有最高路径分数的连接路径。

    TECHNIQUES FOR IDENTIFYING AND PRESENTING CONNECTION PATHS
    3.
    发明申请
    TECHNIQUES FOR IDENTIFYING AND PRESENTING CONNECTION PATHS 审中-公开
    识别和显示连接方式的技术

    公开(公告)号:US20130254305A1

    公开(公告)日:2013-09-26

    申请号:US13548957

    申请日:2012-07-13

    IPC分类号: G06F15/16

    摘要: Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying two entities represented as nodes in a social graph, the social graph is analyzed to identify connection paths connecting the nodes representing the two entities. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path or paths having the highest path scores, as derived by aggregating edge scores assigned to the edges, may be presented.

    摘要翻译: 描述了用于分析社交网络服务的社交图以识别并随后呈现连接各种实体的连接路径的技术。 利用一些实施例,在用户选择或以其他方式识别在社交图中表示为节点的两个实体之后,分析社交图以标识连接表示两个实体的节点的连接路径。 社会图用分别具有表示实体和实体之间的关联的节点和边的图形数据结构来实现。 在一些实施例中,节点代表人,公司,教育机构(例如,学校,大学等)和组。 在识别连接路径之后,可以呈现通过聚合分配给边缘的边缘分数导出的具有最高路径分数的连接路径或路径。

    Displaying items using a reduced presentation
    6.
    发明申请
    Displaying items using a reduced presentation 有权
    使用减少的演示显示项目

    公开(公告)号:US20080066017A1

    公开(公告)日:2008-03-13

    申请号:US11519563

    申请日:2006-09-11

    IPC分类号: G06F3/048

    CPC分类号: G06F17/30905

    摘要: To reduce the amount of space needed to display an item, while still retaining meaning for the item, a reduced presentation is determined for the item. The reduced presentation is based on analysis of a portion that contains information that may be less important for the user to see in order to understand the whole item. The item may contain a portion that is based on user input. It is this portion upon which the reduced presentation determination may be made. However, the reduced presentation determination may be based on another factor. For example, the technique is applicable to displaying any list of items that have some common pattern in the items. Based on analysis of the common pattern, a reduced presentation can be determined for at least one of the items.

    摘要翻译: 为了减少显示项目所需的空间量,同时仍保留项目的含义,为项目确定缩减的演示文稿。 缩减的呈现是基于对包含可能不太重要以供用户了解整个项目的信息的部分的分析。 该项目可能包含基于用户输入的部分。 可以进行减少的呈现确定的这个部分。 然而,减少的呈现确定可以基于另一个因素。 例如,该技术适用于在项目中显示具有一些共同模式的项目的任何列表。 基于对共同模式的分析,可以确定至少一个项目的简化呈现。

    METHODS AND SYSTEMS FOR OBTAINING AND PRESENTING ALUMNI DATA
    7.
    发明申请
    METHODS AND SYSTEMS FOR OBTAINING AND PRESENTING ALUMNI DATA 审中-公开
    用于获取和显示铝数据的方法和系统

    公开(公告)号:US20140101143A1

    公开(公告)日:2014-04-10

    申请号:US13647027

    申请日:2012-10-08

    IPC分类号: G06F17/30

    CPC分类号: G06Q10/063114 G06Q50/01

    摘要: Obtaining alumni data from a database includes storing standardized alumni data in alumni data profiles, receiving a selected data entity representing an institution, searching the alumni data profiles to locate the profiles of alumni of the institution, determining a plurality of ranked sets of data by searching the profiles of alumni of the institution, and displaying each of the elements of the plurality of ranked sets of data respectively as elements in a plurality of facets. The elements in the plurality of facets may be displayed visually as a graphics display. A further operation may include receiving a selected data entity representing an element of a first facet and, responsive to receiving the selected data entity, displaying, at each of the facets of the plurality of facets other than the first facet, the elements of the facet ranked in order of the number of alumni in each element of the facet.

    摘要翻译: 从数据库获取校友数据包括在校友数据简档中存储标准化的校友数据,接收代表机构的选定数据实体,搜索校友数据简档以定位机构校友的简档,通过搜索确定多个排列的数据集 并且将多个排列的数据组中的每个元素分别显示为多个方面的元素。 多个面中的元素可以视觉地显示为图形显示。 另外的操作可以包括接收表示第一小面的元素的所选择的数据实体,并且响应于接收所选择的数据实体,在除了第一小面之外的多个小平面的每一个方面上显示小平面的元素 按照方面每个元素中校友人数的顺序排列。