公开(公告)号：US20160335678A1

公开(公告)日：2016-11-17

申请号：US14713811

申请日：2015-05-15

Applicant: Yahoo! Inc.

Inventor： Nagaraj Kota ,  Srinath Mandalapu ,  Anthony Thaniserikaran Devassy

IPC: G06Q30/02

CPC classification number: G06Q30/0275 ,  G06Q30/0277

Abstract: Systems and methods for building an index for matching queries and bidded terms are disclosed. The expansion of the bid-terms includes a collective expansion using graph mining techniques on a subgraph extracted from user actions on a bi-partite graph. The extracted subgraph is specific to an AdGroup (obtained using all the available context) and is personalized. The extracted subgraph can be tuned to various objectives such as head/torso/tail, specific vs generic etc. Multiple relevance measures of candidate query nodes are calculated with reference to multiple source nodes or context, and the final rankings are biased to commercial relevance using personalized random-walks.

Abstract translation: 公开了用于构建用于匹配查询和出价条款的索引的系统和方法。 投标条款的扩展包括使用图形挖掘技术在从双分图上的用户操作中提取的子图上的集体扩展。 提取的子图特定于AdGroup（使用所有可用上下文获得）并且是个性化的。 提取的子图可以调整到诸如头/躯干/尾巴，特定对等的各种目标。参考多个源节点或上下文来计算候选查询节点的多个相关性度量，并且最终排名被偏向商业相关性 个性化随机散步。