Associating interest and disinterest keywords with similar and dissimilar users
    11.
    发明授权
    Associating interest and disinterest keywords with similar and dissimilar users 有权
    将兴趣和不感兴趣的关键字与类似和不同的用户相关联

    公开(公告)号:US09031951B1

    公开(公告)日:2015-05-12

    申请号:US13437572

    申请日:2012-04-02

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30861 G06F17/30035

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, including a method for propagating labels. The method comprises determining a set of labels to be associated with users of a social network, the labels including one or more designators for specifying areas of interest and areas of disinterest for a user. The method further comprises associating nodes in a graph representing the social network, where the users are represented by user nodes in the graph, and determining that a user is similar or dissimilar to another user in the social network. The method further comprises determining weights for the labels, each weight reflecting a magnitude of a contribution of an associated label to a characterization of the respective node, and propagating labels to other nodes that are related to the respective node by a relationship, including propagating labels in accordance with the determined similarity or dissimilarity.

    摘要翻译: 方法,系统和装置,包括在计算机可读存储介质上编码的计算机程序,包括传播标签的方法。 所述方法包括确定要与社交网络的用户相关联的一组标签,所述标签包括用于指定感兴趣区域和用户不感兴趣区域的一个或多个指示符。 该方法还包括将表示社交网络的图中的节点相关联,其中用户由图中的用户节点表示,并且确定用户与社交网络中的另一用户相似或不相似。 所述方法还包括确定所述标签的权重,每个权重反映相关标签对相应节点的表征的贡献的大小,以及通过关系将标签传播到与相应节点相关的其他节点,包括传播标签 根据确定的相似性或不相似性。

    Selection of hash lookup keys for efficient retrieval
    12.
    发明授权
    Selection of hash lookup keys for efficient retrieval 有权
    选择哈希查询键以进行有效的检索

    公开(公告)号:US08184953B1

    公开(公告)日:2012-05-22

    申请号:US12391153

    申请日:2009-02-23

    IPC分类号: H04N9/80

    CPC分类号: G06F17/30858 G11B27/28

    摘要: Videos are received and indexed based on fingerprints generated for the videos, using lookup keys which correspond to sub portions of the reference fingerprints. Specifically, a set of lookup keys is selected such that the number of reference fingerprints such that the clumping associated with the associated each of the lookup keys is minimized. Clumping occurs when a number of reference identifiers associated with a lookup key exceeds a maximum value.

    摘要翻译: 基于为视频生成的指纹,使用与参考指纹的子部分相对应的查找键来接收和索引视频。 具体地,选择一组查找键,使得参考指纹的数量使得与相关联的每个查找键相关联的聚集被最小化。 当与查找键相关联的多个参考标识符超过最大值时,会发生分组。

    Selection of hash lookup keys for efficient retrieval
    13.
    发明授权
    Selection of hash lookup keys for efficient retrieval 有权
    选择哈希查询键以进行有效的检索

    公开(公告)号:US08712216B1

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

    申请号:US13476906

    申请日:2012-05-21

    IPC分类号: H04N9/80

    CPC分类号: G06F17/30858 G11B27/28

    摘要: Videos are received and indexed based on fingerprints generated for the videos, using lookup keys which correspond to sub portions of the reference fingerprints. Specifically, a set of lookup keys is selected such that the number of reference fingerprints such that the clumping associated with the associated each of the lookup keys is minimized. Clumping occurs when a number of reference identifiers associated with a lookup key exceeds a maximum value.

    摘要翻译: 基于为视频生成的指纹,使用与参考指纹的子部分相对应的查找键来接收和索引视频。 具体地,选择一组查找键,使得参考指纹的数量使得与相关联的每个查找键相关联的聚集被最小化。 当与查找键相关联的多个参考标识符超过最大值时,会发生分组。

    Identifying related queries
    14.
    发明授权
    Identifying related queries 有权
    识别相关查询

    公开(公告)号:US08732153B1

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

    申请号:US13616893

    申请日:2012-09-14

    IPC分类号: G06F7/00 G06F17/30

    摘要: A method includes receiving search queries. Images are generated that represent the volume of each search query relative to all search queries over a period of time. The images are processed to generate wavelets for each image. Related queries having similar increases or decreases in volume are identified by comparing at least some of the wavelets corresponding to a first query to wavelets corresponding to other queries.

    摘要翻译: 一种方法包括接收搜索查询。 生成表示在一段时间内相对于所有搜索查询的每个搜索查询的卷的图像。 处理图像以生成每个图像的小波。 通过将对应于第一查询的至少一些小波与对应于其他查询的小波进行比较来识别具有类似体积增加或减小的相关查询。

    Identifying related queries
    15.
    发明授权
    Identifying related queries 有权
    识别相关查询

    公开(公告)号:US08515935B1

    公开(公告)日:2013-08-20

    申请号:US13219076

    申请日:2011-08-26

    IPC分类号: G06F7/00 G06F17/30

    摘要: A method includes receiving search queries. Images are generated that represent the volume of each search query relative to all search queries over a period of time. The images are processed to generate wavelets for each image. Related queries having similar increases or decreases in volume are identified by comparing at least some of the wavelets corresponding to a first query to wavelets corresponding to other queries.

    摘要翻译: 一种方法包括接收搜索查询。 生成表示在一段时间内相对于所有搜索查询的每个搜索查询的卷的图像。 处理图像以生成每个图像的小波。 通过将对应于第一查询的至少一些小波与对应于其他查询的小波进行比较来识别具有类似体积增加或减小的相关查询。

    Approximate hashing functions for finding similar content
    16.
    发明授权
    Approximate hashing functions for finding similar content 有权
    用于查找类似内容的大致散列函数

    公开(公告)号:US08498951B1

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

    申请号:US13250161

    申请日:2011-09-30

    IPC分类号: G06F15/18

    CPC分类号: G06N3/08

    摘要: A method including training a plurality of learning systems, each learning system implementing a learning function and having an input and producing an output, initializing one or more data structures, and evaluating a target sample is described. Also described are methods that include initializing one or more data structures and evaluating a target sample for a best match.

    摘要翻译: 描述了一种训练多个学习系统的方法,每个学习系统实现学习功能并具有输入和产生输出,初始化一个或多个数据结构以及评估目标样本。 还描述了包括初始化一个或多个数据结构并评估目标样本以获得最佳匹配的方法。

    Image compression using exemplar dictionary based on hierarchical clustering
    17.
    发明授权
    Image compression using exemplar dictionary based on hierarchical clustering 有权
    使用基于层次聚类的示范字典的图像压缩

    公开(公告)号:US08515193B1

    公开(公告)日:2013-08-20

    申请号:US13083493

    申请日:2011-04-08

    IPC分类号: G06K9/36

    摘要: An exemplar dictionary is built from example image blocks for determining predictor blocks for encoding and decoding images. The exemplar dictionary comprises a hierarchical organization of example image blocks. The hierarchical organization of image blocks is obtained by clustering a set of example image blocks, for example, based on k-means clustering. Performance of clustering is improved by transforming feature vectors representing the image blocks to fewer dimensions. Principal component analysis is used for determining feature vectors with fewer dimensions. The clustering performed at higher levels of the hierarchy uses fewer dimensions of feature vectors compared to lower levels of hierarchy. Performance of clustering is improved by processing only a sample of the image blocks of a cluster. The clustering performed at higher levels of the hierarchy uses lower sampling rates as compared to lower levels of hierarchy.

    摘要翻译: 从用于确定用于对图像进行编码和解码的预测器块的示例图像块构建示范字典。 示例性字典包括示例图像块的分级组织。 通过例如基于k均值聚类来聚类一组示例图像块来获得图像块的分级组织。 通过将表示图像块的特征向量变换为较少的维度来提高聚类的性能。 主成分分析用于确定尺寸较小的特征向量。 在层次较高的层次上执行的聚类与较低级别的层次相比,使用较少的特征向量维度。 通过仅处理集群的图像块的样本来提高聚类的性能。 与较低级别的层次相比,在较高层次上执行的聚类使用较低的采样率。

    Approximate hashing functions for finding similar content

    公开(公告)号:US08504495B1

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

    申请号:US13250109

    申请日:2011-09-30

    IPC分类号: G06F15/18

    CPC分类号: G06N3/08

    摘要: A method including training a plurality of learning systems, each learning system implementing a learning function and having an input and producing an output, initializing one or more data structures, and evaluating a target sample is described. Also described are methods that include initializing one or more data structures and evaluating a target sample for a best match.