公开(公告)号：US09460456B2

公开(公告)日：2016-10-04

申请号：US14222584

申请日：2014-03-21

Applicant: Yahoo! Inc.

Inventor： Kevin J. Lang

IPC: G06F17/16 ,  G06Q30/02

CPC classification number: G06Q30/0269

Abstract: Briefly, embodiments of methods and/or systems of computation via array decomposition are disclosed. For one embodiment, as an example, a system may be capable of implementation of an advertising audience overlap analysis dashboard in which for an audience exceeding 100 million users and exceeding 10,000 user groups. Such a system embodiment, for example, may be capable of computing an exact count of user overlap among the user groups in less than two hours.

Abstract translation: 简而言之，公开了通过阵列分解的方法和/或计算系统的实施例。 对于一个实施例，作为示例，系统可以能够实现广告观众重叠分析仪表板，其中针对超过1亿用户和超过10,000个用户组的观众。 例如，这样的系统实施例可能能够在少于两个小时内计算用户组之间用户重叠的精确计数。

公开(公告)号：US20150269122A1

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

申请号：US14222584

申请日：2014-03-21

Applicant: Yahoo! Inc.

Inventor： Kevin J. Lang

IPC: G06F17/16 ,  G06Q30/02

CPC classification number: G06Q30/0269

Abstract: Briefly, embodiments of methods and/or systems of computation via array decomposition are disclosed. For one embodiment, as an example, a system may be capable of implementation of an advertising audience overlap analysis dashboard in which for an audience exceeding 100 million users and exceeding 10,000 user groups. Such a system embodiment, for example, may be capable of computing an exact count of user overlap among the user groups in less than two hours.

Abstract translation: 简而言之，公开了通过阵列分解的方法和/或计算系统的实施例。 对于一个实施例，作为示例，系统可以能够实现广告观众重叠分析仪表板，其中针对超过1亿用户和超过10,000个用户组的观众。 例如，这样的系统实施例可能能够在少于两个小时内计算用户组之间用户重叠的精确计数。

公开(公告)号：US20170193109A1

公开(公告)日：2017-07-06

申请号：US14986180

申请日：2015-12-31

Applicant: Yahoo! Inc.

Inventor： Kevin J. Lang ,  Edo Liberty ,  Konstantin Shmakov

IPC: G06F17/30 ,  G06F9/38 ,  G06N99/00

Abstract: Briefly, embodiments disclosed herein relate generally to on-line content sampling, and more particularly to utilization of machine learning techniques to sample on-line content in a search engine environment, for example.

公开(公告)号：US08819038B1

公开(公告)日：2014-08-26

申请号：US14078301

申请日：2013-11-12

Applicant: Yahoo! Inc.

Inventor： Lee Rhodes ,  Anirban Dasgupta ,  Kevin J. Lang

IPC: G06F17/30

CPC classification number: G06F17/30595 ,  G06F17/3033 ,  G06F17/30424 ,  G06F17/30563

Abstract: Techniques are provided for improving the speed and accuracy of analytics on big data using theta sketches, by converting fixed-size sketches to theta sketches, and by performing set operations on sketches. In a technique for performing a set operation, two sketches are analyzed to identify the maximum value of each sketch. The maximum values of the two sketches are compared. Based the comparison, one or more values are removed from the sketch whose maximum value is greater. After the removal, a set operation (e.g., union, intersection, or difference) is performed based on the modified sketch and the unmodified sketch. A result of the set operation is a third sketch, which may be used to estimate a cardinality of the larger data sets that are represented by the two input sketches.

Abstract translation: 提供了技术，通过将固定尺寸草图转换为theta素描，以及通过在草图上执行设置操作来提高使用θ素描的大数据分析的速度和准确性。 在用于执行设置操作的技术中，分析两个草图以识别每个草图的最大值。 比较两幅草图的最大值。 基于比较，从最大值更大的草图中删除一个或多个值。 在移除之后，基于修改的草图和未修改的草图来执行设置操作（例如，联合，相交或差异）。 设置操作的结果是第三个草图，其可以用于估计由两个输入草图表示的较大数据集的基数。