Automatic gleaning of semantic information in social networks
    1.
    发明授权
    Automatic gleaning of semantic information in social networks 有权
    自动收集社交网络中的语义信息

    公开(公告)号:US08386534B2

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

    申请号:US12290449

    申请日:2008-10-30

    IPC分类号: G06F7/00 G06F17/30 G06F15/16

    CPC分类号: G06F17/3053 G06F17/30867

    摘要: Disclosed are method and apparatus for identifying members of a social network who have a high likelihood of providing a useful response to a query. A query engine examines the personal pages of a set of members and automatically gleans semantic information relevant to the query. From the automatically-gleaned semantic information, a score indicative of the likelihood that the member may provide a useful response is calculated.

    摘要翻译: 公开了用于识别对查询有很高可能性的社交网络的成员的方法和装置。 查询引擎检查一组成员的个人页面,并自动收集与查询相关的语义信息。 从自动收集的语义信息中,计算指示成员可以提供有用响应的可能性的得分。

    METHOD AND APPARATUS FOR PROVIDING REAL FRIENDS COUNT
    2.
    发明申请
    METHOD AND APPARATUS FOR PROVIDING REAL FRIENDS COUNT 有权
    提供真实朋友的方法和设备

    公开(公告)号:US20090083418A1

    公开(公告)日:2009-03-26

    申请号:US12233213

    申请日:2008-09-18

    IPC分类号: G06F15/173

    摘要: A method and apparatus for tracking communications in a network are disclosed. For example, the method receives a subscription from a customer for a service to track at least one variable associated with a plurality of communicants of the customer. The method identifies a plurality of members of a social network of the customer, and gathers communication data associated with the plurality of members for tracking the at least one variable. The method then displays at least one result derived from the communication data to the customer.

    摘要翻译: 公开了一种用于跟踪网络中的通信的方法和装置。 例如,该方法从客户接收服务的订阅以跟踪与客户的多个通信者相关联的至少一个变量。 该方法识别客户的社交网络的多个成员,并收集与多个成员相关联的通信数据,以跟踪至少一个变量。 该方法然后将至少一个从通信数据导出的结果显示给客户。

    Anonymization of Data Over Multiple Temporal Releases
    4.
    发明申请
    Anonymization of Data Over Multiple Temporal Releases 有权
    多个时间发布数据的匿名化

    公开(公告)号:US20120011591A1

    公开(公告)日:2012-01-12

    申请号:US12830685

    申请日:2010-07-06

    IPC分类号: G06F21/00

    CPC分类号: G06F21/6254 H04L63/0421

    摘要: The present disclosure is directed to systems, methods, and computer-readable storage media for anonymizing data over multiple temporal releases. Data is received, and nodes and connections in the data are identified. The data also is analyzed to identify predicted connections. The nodes, the connections, and the predicted connections are analyzed to determine how to group the nodes in the data. The data is published, and the grouping of the nodes is extended to subsequent temporal releases of the data, the nodes of which are grouped in accordance with the grouping used with the data.

    摘要翻译: 本公开涉及用于在多个时间版本上匿名数据的系统,方法和计算机可读存储介质。 接收数据,并识别数据中的节点和连接。 分析数据以识别预测的连接。 分析节点,连接和预测连接,以确定如何对数据中的节点进行分组。 发布数据,并且将节点的分组扩展到数据的随后的时间释放,其节点根据与数据一起使用的分组进行分组。

    Method and apparatus for providing real friends count
    5.
    发明授权
    Method and apparatus for providing real friends count 有权
    提供真实朋友数量的方法和设备

    公开(公告)号:US08732295B2

    公开(公告)日:2014-05-20

    申请号:US12233213

    申请日:2008-09-18

    IPC分类号: G06F15/173

    摘要: A method and apparatus for tracking communications in a network are disclosed. For example, the method receives a subscription from a customer for a service to track at least one variable associated with a plurality of communicants of the customer. The method identifies a plurality of members of a social network of the customer, and gathers communication data associated with the plurality of members for tracking the at least one variable. The method then displays at least one result derived from the communication data to the customer.

    摘要翻译: 公开了一种用于跟踪网络中的通信的方法和装置。 例如,该方法从客户接收服务的订阅以跟踪与客户的多个通信者相关联的至少一个变量。 该方法识别客户的社交网络的多个成员,并收集与多个成员相关联的通信数据,以跟踪至少一个变量。 该方法然后将至少一个从通信数据导出的结果显示给客户。

    Anonymization of data over multiple temporal releases
    6.
    发明授权
    Anonymization of data over multiple temporal releases 有权
    在多个时间版本上匿名化数据

    公开(公告)号:US08438650B2

    公开(公告)日:2013-05-07

    申请号:US12830685

    申请日:2010-07-06

    IPC分类号: H04L29/06

    CPC分类号: G06F21/6254 H04L63/0421

    摘要: The present disclosure is directed to systems, methods, and computer-readable storage media for anonymizing data over multiple temporal releases. Data is received, and nodes and connections in the data are identified. The data also is analyzed to identify predicted connections. The nodes, the connections, and the predicted connections are analyzed to determine how to group the nodes in the data. The data is published, and the grouping of the nodes is extended to subsequent temporal releases of the data, the nodes of which are grouped in accordance with the grouping used with the data.

    摘要翻译: 本公开涉及用于在多个时间版本上匿名数据的系统,方法和计算机可读存储介质。 接收数据,并识别数据中的节点和连接。 分析数据以识别预测的连接。 分析节点,连接和预测连接,以确定如何对数据中的节点进行分组。 发布数据,并且将节点的分组扩展到数据的随后的时间释放,其节点根据与数据一起使用的分组进行分组。

    Automatic gleaning of semantic information in social networks
    7.
    发明申请
    Automatic gleaning of semantic information in social networks 有权
    自动收集社交网络中的语义信息

    公开(公告)号:US20100114989A1

    公开(公告)日:2010-05-06

    申请号:US12290449

    申请日:2008-10-30

    IPC分类号: G06F7/06 G06F17/30 G06F7/00

    CPC分类号: G06F17/3053 G06F17/30867

    摘要: Disclosed are method and apparatus for identifying members of a social network who have a high likelihood of providing a useful response to a query. A query engine examines the personal pages of a set of members and automatically gleans semantic information relevant to the query. From the automatically-gleaned semantic information, a score indicative of the likelihood that the member may provide a useful response is calculated.

    摘要翻译: 公开了用于识别对查询有很高可能性的社交网络的成员的方法和装置。 查询引擎检查一组成员的个人页面,并自动收集与查询相关的语义信息。 从自动收集的语义信息中,计算指示成员可以提供有用响应的可能性的得分。

    Sampling from distributed streams of data

    公开(公告)号:US08458326B2

    公开(公告)日:2013-06-04

    申请号:US12826785

    申请日:2010-06-30

    IPC分类号: G06F15/173

    摘要: The present disclosure is directed to systems, methods, and computer-readable storage media for sampling from distributed data streams. Data elements are received at site servers configured to collect and report data to a coordinator device. The site servers assign a binary string to each of the data elements. Each bit of the binary strings can be independently set to a 0 or a 1 with a probability of one half. The binary string is used to sample from the received data elements, and the data elements and/or the sampled data elements can be transmitted to a coordinator device. The coordinator device can examine one or more bits of the binary string to draw samples of the received data elements in accordance with desired probabilities.

    METHODS AND APPARATUS FOR REPRESENTING PROBABILISTIC DATA USING A PROBABILISTIC HISTOGRAM
    10.
    发明申请
    METHODS AND APPARATUS FOR REPRESENTING PROBABILISTIC DATA USING A PROBABILISTIC HISTOGRAM 失效
    使用概率组织表示概率数据的方法和装置

    公开(公告)号:US20110145223A1

    公开(公告)日:2011-06-16

    申请号:US12636544

    申请日:2009-12-11

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30536

    摘要: Methods and apparatus for representing probabilistic data using a probabilistic histogram are disclosed. An example method comprises partitioning a plurality of ordered data items into a plurality of buckets, each of the data items capable of having a data value from a plurality of possible data values with a probability characterized by a respective individual probability distribution function (PDF), each bucket associated with a respective subset of the ordered data items bounded by a respective beginning data item and a respective ending data item, and determining a first representative PDF for a first bucket associated with a first subset of the ordered data items by partitioning the plurality of possible data values into a first plurality of representative data ranges and respective representative probabilities based on an error between the first representative PDF and a first plurality of individual PDFs characterizing the first subset of the ordered data items.

    摘要翻译: 公开了使用概率直方图表示概率数据的方法和装置。 一种示例性方法包括将多个有序数据项划分成多个桶,每个数据项能够具有来自多个可能数据值的数据值,其特征在于各自的概率分布函数(PDF), 每个桶与由相应的开始数据项和相应的结束数据项限定的有序数据项的相应子集相关联,并且通过分割多个数据项来确定与有序数据项的第一子集相关联的第一个桶的第一代表性PDF 基于第一代表性PDF和表征有序数据项的第一子集的第一多个单独PDF之间的误差,将可能的数据值转换成第一多个代表性数据范围和相应的代表概率。