公开(公告)号：US20160203411A1

公开(公告)日：2016-07-14

申请号：US15075957

申请日：2016-03-21

Applicant: Google Inc.

Inventor： Eldar Sadikov ,  Jayant Madhavan ,  Alon Yitzchak Halevy

IPC: G06N7/00 ,  G06F17/30

CPC classification number: G06N7/005 ,  G06F17/30389 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30958 ,  G06F17/30979

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

公开(公告)号：US09582766B2

公开(公告)日：2017-02-28

申请号：US15075957

申请日：2016-03-21

Applicant: Google Inc.

Inventor： Eldar Sadikov ,  Jayant Madhavan ,  Alon Yitzchak Halevy

IPC: G06F17/30 ,  G06N7/00

CPC classification number: G06N7/005 ,  G06F17/30389 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30958 ,  G06F17/30979

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于聚类查询优化。 一种方法包括构建用于第一查询的图形的表示，其中该图具有用于第一查询的节点，用于第一查询的多个细化中的每一个的节点，以及用于第一查询的文档集合中的每个文档的节点 并且其中图形具有从第一查询节点到每个细化节点的边缘，从第一查询到第一查询的相应文档集合中的每个文档的边缘，每个细化的边缘到相应文档中的每个文档 精确的集合，以及每个细化的边缘到每个共同查询的细化。 该方法还包括通过将图中的细化节点划分成适当的子集来将细化聚类成细化簇。

公开(公告)号：US09323806B2

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

申请号：US13854275

申请日：2013-04-01

Applicant: Google, Inc.

Inventor： Eldar Sadikov ,  Jayant Madhavan ,  Alon Halevy

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06N7/005 ,  G06F17/30389 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30958 ,  G06F17/30979

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

公开(公告)号：US20150161201A1

公开(公告)日：2015-06-11

申请号：US13854275

申请日：2013-04-01

Applicant: Google Inc.

Inventor： Eldar Sadikov ,  Jayant Madhavan ,  Alon Halevy

IPC: G06F17/30

CPC classification number: G06N7/005 ,  G06F17/30389 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30958 ,  G06F17/30979

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于聚类查询优化。 一种方法包括构建用于第一查询的图形的表示，其中该图具有用于第一查询的节点，用于第一查询的多个细化中的每一个的节点，以及用于第一查询的文档集合中的每个文档的节点 并且其中图形具有从第一查询节点到每个细化节点的边缘，从第一查询到第一查询的相应文档集合中的每个文档的边缘，每个细化的边缘到相应文档中的每个文档 精确的集合，以及每个细化的边缘到每个共同查询的细化。 该方法还包括通过将图中的细化节点划分成适当的子集来将细化聚类成细化簇。