专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09514404B1 Using embedding functions with a deep network 有权
公开(公告)号：US09514404B1
公开(公告)日：2016-12-06
申请号：US14860497
申请日：2015-09-21
申请人： Google Inc.
发明人： Gregory S. Corrado , Kai Chen , Jeffrey A. Dean , Gary R. Holt , Julian P. Grady , Sharat Chikkerur , David W. Sculley, II
IPC分类号： G06F15/18 , G06E1/00 , G06E3/00 , G06G7/00 , G06N3/08 , G06N3/04
CPC分类号： G06N3/08 , G06N3/04 , G06N3/0454 , G06N3/084
摘要： Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using embedded function with a deep network. One of the methods includes receiving an input comprising a plurality of features, wherein each of the features is of a different feature type; processing each of the features using a respective embedding function to generate one or more numeric values, wherein each of the embedding functions operates independently of each other embedding function, and wherein each of the embedding functions is used for features of a respective feature type; processing the numeric values using a deep network to generate a first alternative representation of the input, wherein the deep network is a machine learning model composed of a plurality of levels of non-linear operations; and processing the first alternative representation of the input using a logistic regression classifier to predict a label for the input.

2. 发明申请

US20160042034A1 GROUPING AND PRICING LOW-COMPETITION CONTENT ITEM REQUESTS 审中-公开
标题翻译：分组和定价低竞争内容项目要求
公开(公告)号：US20160042034A1
公开(公告)日：2016-02-11
申请号：US14455677
申请日：2014-08-08
申请人： Google Inc.
发明人： David W. Sculley, II , Daniel Golovin
IPC分类号： G06F17/30
CPC分类号： G06Q30/0273
摘要： Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. A set of k requests is identified, each request being associated with a request for content. Candidate content items are identified for one or more of the requests in the set. Identified candidate content items are ranked based at least in part on their respective associated bids, expected value or long-term value. Top K candidate content items are determined based on the ranking. A price is assigned to each of the top K candidate content items based on the ranking and the associated bids. One or more of the top K candidate content items are provided responsive to the requests in the set.
摘要翻译：方法，系统和装置包括在计算机可读存储介质上编码的计算机程序，包括用于提供内容的方法。识别一组k个请求，每个请求与内容请求相关联。为集合中的一个或多个请求标识候选内容项。至少部分地根据其相关联的出价，期望值或长期价值对所识别的候选内容项进行排名。顶级K候选内容项目是根据排名确定的。基于排名和相关联的出价，将价格分配给每个顶级K候选内容项目。响应于该组中的请求来提供顶级K候选内容项中的一个或多个。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式