公开(公告)号：US20110153663A1

公开(公告)日：2011-06-23

申请号：US12643237

申请日：2009-12-21

申请人： Yehuda Koren ,  Yifan Hu ,  Christopher T. Volinsky

发明人： Yehuda Koren ,  Yifan Hu ,  Christopher T. Volinsky

IPC分类号： G06F17/30

CPC分类号： H04N21/6582 ,  G06F16/903 ,  H04N21/44222 ,  H04N21/4668

摘要： Systems and methods to provide a recommendation engine that uses implicit feedback observations are provided. A particular method includes receiving accessing data comprising a plurality of implicit feedback observations for a plurality of users. The plurality of users includes a first user that requested a recommendation. Each implicit feedback observation is associated with a particular user and a particular item of a plurality of items. The method includes determining a plurality of preference ratings and a plurality of confidence ratings for each user of the plurality of users for each item based on the plurality of implicit feedback observations. The method includes generating a recommendation list of one or more of the plurality of items for the first user based on the plurality of preference ratings and the plurality of confidence ratings.

摘要翻译： 提供了提供使用隐式反馈观察的推荐引擎的系统和方法。 一种特定方法包括接收包括多个用户的多个隐含反馈观察的访问数据。 多个用户包括请求推荐的第一用户。 每个隐式反馈观察与特定用户和多个项目的特定项目相关联。 该方法包括基于多个隐含反馈观察，针对每个项目确定多个用户中的每个用户的多个偏好等级和多个置信度。 该方法包括基于多个偏好等级和多个置信度产生针对第一用户的多个项目中的一个或多个项目的推荐列表。

公开(公告)号：US20100134497A1

公开(公告)日：2010-06-03

申请号：US12326185

申请日：2008-12-02

申请人： Yifan Hu ,  Yehuda Koren

发明人： Yifan Hu ,  Yehuda Koren

IPC分类号： G06T11/20

CPC分类号： G06T11/206

摘要： Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity location is generated for each vertex. Each vertex's location from the layout is merged with each vertex's proximity location. A cost function associated with the layout is minimized.

摘要翻译： 披露图形数据的方法，系统和产品。 检索包含顶点位置的布局。 为每个顶点生成邻近位置。 每个顶点的布局位置与每个顶点的邻近位置合并。 与布局相关联的成本函数最小化。

公开(公告)号：US08565122B2

公开(公告)日：2013-10-22

申请号：US12938340

申请日：2010-11-02

申请人： Yehuda Koren ,  Stephen North ,  Christopher Volinsky

发明人： Yehuda Koren ,  Stephen North ,  Christopher Volinsky

IPC分类号： H04L29/12 ,  H04L12/24 ,  H04L12/56

CPC分类号： H04L41/12 ,  G06Q30/02 ,  H04L45/02

摘要： A method and apparatus for measuring and extracting proximity in networks are disclosed. In one embodiment, the present method receives a network from a user for analysis and extraction of a smaller proximity sub-graph. The method computes a candidate sub-graph and determines at least one Cycle Free Escape Conductivity (CFEC) proximity of at least two nodes in accordance with the candidate sub-graph. The method then extracts and presents a proximity sub-graph that best captures the proximity.

摘要翻译： 公开了一种用于测量和提取网络中的接近度的方法和装置。 在一个实施例中，本方法从用户接收用于分析和提取较小邻近子图的网络。 该方法计算候选子图并且根据候选子图确定至少两个节点的至少一个循环自由逃脱电导率（CFEC）接近度。 该方法然后提取并呈现最佳捕获邻近度的邻近子图。

公开(公告)号：US08510248B2

公开(公告)日：2013-08-13

申请号：US12949429

申请日：2010-11-18

申请人： Yehuda Koren ,  Ronny Lempel ,  Nadav Golbandi

发明人： Yehuda Koren ,  Ronny Lempel ,  Nadav Golbandi

IPC分类号： G06F17/00 ,  G06N5/02

CPC分类号： G06N5/046

摘要： Bootstrapping a recommender system that makes item recommendations. The bootstrapping identifying questions for use in interviewing a user, e.g., a new user to the recommender system, to obtain user information, e.g., user profile information, for use in predicting item ratings for the user, the predicted item ratings for use in identifying item recommendations for the user. The bootstrapping using a cost function to minimize error in selection of the questions for the interview. The bootstrapping comprising a static bootstrapping and an adaptive bootstrapping.

摘要翻译： 引导推荐系统，使项目建议。 引导识别用于访问用户的问题，例如，向推荐者系统的新用户，以获得用户信息，例如用于预测用户的项目评级的用户简档信息，用于识别的预测项目评级 项目建议为用户。 引导使用成本函数来最小化选择面试问题的错误。 引导包括静态引导和自适应引导。

公开(公告)号：US07966143B1

公开(公告)日：2011-06-21

申请号：US12272832

申请日：2008-11-18

申请人： Yehuda Koren ,  Craig Gotsman

发明人： Yehuda Koren ,  Craig Gotsman

IPC分类号： G01C17/38

CPC分类号： G01S5/0289

摘要： Certain exemplary embodiments comprise a method, comprising: in a sensor node network comprising a plurality of sensor nodes, each sensor node from the plurality of sensor nodes having location coordinates that are initially unknown, each sensor node from the plurality of sensor nodes having neighbors, each sensor node from the plurality of sensor nodes capable of determining distances only to that sensor node's neighbors: for each sensor node from the plurality of sensor nodes, communicating with that sensor node's neighbors; and based only on communications between neighbors, in a fully distributed manner, generating a sensor node network layout that indicates the location coordinates of each sensor node.

摘要翻译： 某些示例性实施例包括一种方法，包括：在包括多个传感器节点的传感器节点网络中，来自多个传感器节点的每个传感器节点具有最初未知的位置坐标，来自多个传感器节点的每个传感器节点具有邻居， 来自多个传感器节点的每个传感器节点能够仅确定与该传感器节点的邻居的距离：对于来自多个传感器节点的每个传感器节点与该传感器节点的邻居进行通信; 并且以完全分布的方式仅基于邻居之间的通信，生成指示每个传感器节点的位置坐标的传感器节点网络布局。

公开(公告)号：US20090083258A1

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

申请号：US12107449

申请日：2008-04-22

申请人： Yehuda Koren ,  Robert Bell

发明人： Yehuda Koren ,  Robert Bell

IPC分类号： G06F17/30

CPC分类号： G06Q30/0201 ,  G06Q30/02 ,  G06Q30/0627 ,  G06Q30/0631

摘要： Systems and techniques for estimation of item ratings for a user. A set of item ratings by multiple users is maintained, and similarity measures for all items are precomputed, as well as values used to generate interpolation weights for ratings neighboring a rating of interest to be estimated. A predetermined number of neighbors are selected for an item whose rating is to be estimated, the neighbors being those with the highest similarity measures. Global effects are removed, and interpolation weights for the neighbors are computed simultaneously. The interpolation weights are used to estimate a rating for the item based on the neighboring ratings, Suitably, ratings are estimated for all items in a predetermined dataset that have not yet been rated by the user, and recommendations are made of the user by selecting a predetermined number of items in the dataset having the highest estimated ratings.

摘要翻译： 用于估计用户的项目评级的系统和技术。 维护多个用户的一组项目评级，并且预先计算所有项目的相似性度量，以及用于生成与要估计的兴趣等级相邻的评级的插值权重的值。 对于要评估等级的项目，选择预定数量的邻居，邻居是具有最高相似性度量的项目。 全局效应被去除，同时计算邻居的插值权重。 内插权重用于基于相邻评级来估计项目的评级。适当地，估计尚未被用户评级的预定数据集中的所有项目的评级，并且通过选择一个 数据集中预定数量的项目具有最高的估计等级。

公开(公告)号：US10225590B2

公开(公告)日：2019-03-05

申请号：US13447876

申请日：2012-04-16

申请人： Oren Somekh ,  Yehuda Koren ,  Natalie Aizenberg ,  Yoelle Maarek ,  Ronny Lempel

发明人： Oren Somekh ,  Yehuda Koren ,  Natalie Aizenberg ,  Yoelle Maarek ,  Ronny Lempel

IPC分类号： H04N21/25 ,  H04N21/258 ,  H04N21/2668 ,  H04N21/6543

摘要： Disclosure includes a system, method and architecture to monitor media content streams, e.g., streams of digital encoded media data such as without limitation audio and/or video data, from a number of media content streaming providers and identify media content items from those media content items being streamed by the media content streaming providers for inclusion in a personalized media content stream for a user. In a direct streaming approach, the media content items contained in a stream are available while each item is being streamed by the content provider. In a centralized streaming approach, media content items contained in each media content stream that is currently being streamed by content provider are available for a limited window of time, which can be dependent on buffer length.

公开(公告)号：US20120173533A1

公开(公告)日：2012-07-05

申请号：US12984539

申请日：2011-01-04

申请人： Vishwanath Tumkur Ramarao ,  Andrei Broder ,  Idan Szpektor ,  Edo Liberty ,  Yehuda Koren ,  Mark E. Risher ,  Yoelle Maarek Smadja

发明人： Vishwanath Tumkur Ramarao ,  Andrei Broder ,  Idan Szpektor ,  Edo Liberty ,  Yehuda Koren ,  Mark E. Risher ,  Yoelle Maarek Smadja

IPC分类号： G06F17/30

CPC分类号： G06Q10/00

摘要： Embodiments are directed towards identifying auto-folder tags for messages by using a combinational optimization approach of bi-clustering folder names and features of messages based on relationship strengths. The combinational optimization approach of bi-clustering, generally, groups a plurality of folder names and a plurality of features into one or more metafolders to optimize a cost. The cost is based on an aggregate of cut relationship strengths, where a cut results when a relationship folder name and feature are grouped in separate metafolders. Furthermore, the plurality of folder names and the plurality of features are obtained by monitoring actions of a plurality of users, where the folder names are user generated folder names and features are from a plurality of messages. The metafolders may be used to tag new user messages with an auto-folder tag.

摘要翻译： 实施例旨在通过使用基于关系强度的消息的双重聚类文件夹名称和特征的组合优化方法来识别消息的自动文件夹标签。 双组合的组合优化方法通常将多个文件夹名称和多个特征分组到一个或多个元文件夹中以优化成本。 成本基于剪切关系强度的总和，当关系文件夹名称和要素分组在单独的元文件夹中时，会产生裁剪。 此外，通过监视多个用户的动作来获得多个文件夹名称和多个特征，其中文件夹名称是用户生成的文件夹名称和特征来自多个消息。 元文件夹可用于使用自动文件夹标签来标记新的用户消息。

公开(公告)号：US08001132B2

公开(公告)日：2011-08-16

申请号：US12107449

申请日：2008-04-22

申请人： Yehuda Koren ,  Robert Bell

发明人： Yehuda Koren ,  Robert Bell

IPC分类号： G06F7/20 ,  G06F17/30

CPC分类号： G06Q30/0201 ,  G06Q30/02 ,  G06Q30/0627 ,  G06Q30/0631

摘要： Systems and techniques for estimation of item ratings for a user. A set of item ratings by multiple users is maintained, and similarity measures for all items are precomputed, as well as values used to generate interpolation weights for ratings neighboring a rating of interest to be estimated. A predetermined number of neighbors are selected for an item whose rating is to be estimated, the neighbors being those with the highest similarity measures. Global effects are removed, and interpolation weights for the neighbors are computed simultaneously. The interpolation weights are used to estimate a rating for the item based on the neighboring ratings, Suitably, ratings are estimated for all items in a predetermined dataset that have not yet been rated by the user, and recommendations are made of the user by selecting a predetermined number of items in the dataset having the highest estimated ratings.

摘要翻译： 用于估计用户的项目评级的系统和技术。 维护多个用户的一组项目评级，并且预先计算所有项目的相似性度量，以及用于生成与要估计的兴趣等级相邻的评级的插值权重的值。 对于要评估等级的项目，选择预定数量的邻居，邻居是具有最高相似性度量的项目。 全局效应被去除，同时计算邻居的插值权重。 内插权重用于基于相邻评级来估计项目的评级。适当地，估计尚未被用户评级的预定数据集中的所有项目的评级，并且通过选择一个 数据集中预定数量的项目具有最高的估计等级。

公开(公告)号：US20110044197A1

公开(公告)日：2011-02-24

申请号：US12938340

申请日：2010-11-02

申请人： Yehuda Koren ,  Stephen North ,  Christopher Volinsky

发明人： Yehuda Koren ,  Stephen North ,  Christopher Volinsky

IPC分类号： H04L12/26

CPC分类号： H04L41/12 ,  G06Q30/02 ,  H04L45/02

摘要： A method and apparatus for measuring and extracting proximity in networks are disclosed. In one embodiment, the present method receives a network from a user for analysis and extraction of a smaller proximity sub-graph. The method computes a candidate sub-graph and determines at least one Cycle Free Escape Conductivity (CFEC) proximity of at least two nodes in accordance with the candidate sub-graph. The method then extracts and presents a proximity sub-graph that best captures the proximity.

摘要翻译： 公开了一种用于测量和提取网络中的接近度的方法和装置。 在一个实施例中，本方法从用户接收用于分析和提取较小邻近子图的网络。 该方法计算候选子图并且根据候选子图确定至少两个节点的至少一个循环自由逃脱电导率（CFEC）接近度。 该方法然后提取并呈现最佳捕获邻近度的邻近子图。