公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：US09116940B1

公开(公告)日：2015-08-25

申请号：US13862768

申请日：2013-04-15

Applicant: Google Inc.

Inventor： Nitin Gupta ,  Alon Yitzchak Halevy ,  Jayant Madhavan ,  Tuan Anh Cao ,  Sreeram Balakrishnan

IPC: G06F17/30

CPC classification number: G06F17/30336 ,  G06F17/3053

Abstract: Systems and techniques are provided for receiving an input column and a search keyword and providing one or more suggested columns with which to merge the input column. A coverage score and a refinity score are calculated for potential columns based on the input column as well as a search score based on the search keyword. The one or more suggested columns may be determined based on the coverage score, refinity score, and/or the search score. The input column and/or a potential column may be modified based on a function and the modification may result in a plurality of modified input and/or potential columns. Coverage, refinity, and search scores may be calculated based on the modified columns.

Abstract translation: 系统和技术被提供用于接收输入列和搜索关键字，并提供一个或多个建议列以与其合并输入列。 根据输入栏以及基于搜索关键字的搜索分数计算潜在列的覆盖率分数和自适应度分数。 一个或多个建议列可以基于覆盖分数，重要度分数和/或搜索分数来确定。 可以基于功能来修改输入列和/或潜在列，并且修改可以导致多个修改的输入和/或潜在列。 可以根据修改的列计算覆盖率，自由度和搜索分数。

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

公开(公告)号：US20130268517A1

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

申请号：US13908456

申请日：2013-06-03

Applicant: Google Inc.

Inventor： Jayant Madhavan ,  Fei Wu ,  Alon Yitzchak Halevy

IPC: G06F17/30

CPC classification number: G06F17/30554 ,  G06F17/30528 ,  G06F17/3053 ,  G06F17/30672 ,  G06F17/30867

Abstract: Methods, systems, and apparatus, including computer program products, for generating aspects associated with entities. In some implementations, a method includes receiving data identifying an entity; generating a group of candidate aspects for the entity; modifying the group of candidate aspects to generate a group of modified candidate aspects comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score; and storing an association between one or more highest ranked modified candidate aspects and the entity. The aspects can be used to organize and present search results in response to queries for the entity.

Abstract translation: 用于生成与实体相关的方面的方法，系统和装置，包括计算机程序产品。 在一些实现中，一种方法包括接收识别实体的数据; 为该实体产生一组候选方面; 修改所述候选方面的组以生成一组修改的候选方面，其包括组合类似候选方面并使用与一个或多个候选方面相关联的一个或多个方面类别对候选方面分组; 基于多样性分数和受欢迎程度，对修改的候选方面组中的一个或多个修改后的候选方面进行排序; 以及存储一个或多个最高排名的修改候选方面与所述实体之间的关联。 这些方面可以用于组织和呈现搜索结果以响应对实体的查询。

公开(公告)号：US20190065502A1

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

申请号：US14692164

申请日：2015-04-21

Applicant: Google Inc.

Inventor： Hongrae Lee ,  Jayant Madhavan ,  Yuliang Li

IPC: G06F17/30

Abstract: Methods and apparatus determining features related to a table of a document and/or providing information related to a table of a document in response to a search query. Some implementations are directed generally to determining an ordered collection of information that is responsive to search query terms, wherein the ordered collection of information is based at least in part on content of a table of a document that is responsive to the search query terms. Some implementations are directed generally to determining a table of a document includes an ordered collection of information and determining one or more features of the table.

公开(公告)号：US20160026696A1

公开(公告)日：2016-01-28

申请号：US14875177

申请日：2015-10-05

Applicant: Google Inc.

Inventor： Jayant Madhavan ,  Fei Wu ,  Alon Yitzchak Halevy

IPC: G06F17/30

CPC classification number: G06F16/248 ,  G06F16/24575 ,  G06F16/24578 ,  G06F16/3338 ,  G06F16/9535

Abstract: Methods, systems, and apparatus, including computer program products, for generating aspects associated with entities. In some implementations, a method includes receiving data identifying an entity; generating a group of candidate aspects for the entity; modifying the group of candidate aspects to generate a group of modified candidate aspects comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score; and storing an association between one or more highest ranked modified candidate aspects and the entity. The aspects can be used to organize and present search results in response to queries for the entity.

Abstract translation: 用于生成与实体相关的方面的方法，系统和装置，包括计算机程序产品。 在一些实现中，一种方法包括接收识别实体的数据; 为该实体产生一组候选方面; 修改所述候选方面的组以生成一组修改的候选方面，其包括组合类似候选方面并使用与一个或多个候选方面相关联的一个或多个方面类别对候选方面分组; 基于多样性分数和受欢迎程度，对修改的候选方面组中的一个或多个修改后的候选方面进行排序; 以及存储一个或多个最高排名的修改候选方面与所述实体之间的关联。 这些方面可以用于组织和呈现搜索结果以响应对实体的查询。

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

公开(公告)号：US20140074854A1

公开(公告)日：2014-03-13

申请号：US14079764

申请日：2013-11-14

Applicant: Google Inc.

Inventor： Hector Gonzalez ,  Jayant Madhavan ,  Andrin Von Rechenberg ,  Anno Langen ,  Alon Halevy

IPC: G06F17/30

CPC classification number: G06F17/30241 ,  G06F17/30091 ,  G06F17/30312 ,  G06F17/30554 ,  G06F17/30991 ,  G06F17/30994

Abstract: Aspects of the invention provide a service for data management and integration across a wide range of applications. Clustered computers may be arranged in a cloud-type configuration for storing and handling large amounts of user data under the control of a front-end management server. Communities of distributed users may collaborate on the data across multiple enterprises. Very large tabular data files are uploaded to the storage facilities. The data files are maintained as tables, and a composite table of related information is created and maintained in response to user queries. Different ways of visualizing the data are provided. Depending on the amount of information that can be displayed, features in a spatial index may the thinned for presentation. Spatial and structured queries are processing and results are intersected to obtain information for display.

Abstract translation: 本发明的方面提供了用于广泛应用的数据管理和集成的服务。 集群计算机可以以云型配置来布置，用于在前端管理服务器的控制下存储和处理大量的用户数据。 分布式用户的社区可能会跨多个企业的数据进行协作。 非常大的表格数据文件被上传到存储设施。 数据文件被保持为表，并且响应于用户查询创建和维护相关信息的复合表。 提供了可视化数据的不同方法。 根据可显示的信息量，空间索引中的特征可能会变薄以进行呈现。 空间和结构化查询是处理，结果相交以获取显示信息。

公开(公告)号：US09916348B1

公开(公告)日：2018-03-13

申请号：US14824538

申请日：2015-08-12

Applicant: Google Inc.

Inventor： Jayant Madhavan ,  Hongrae Lee ,  Warren H. Y. Shen ,  Sreeram Viswanath Balakrishnan

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/3043 ,  G06F17/30424 ,  G06F17/3053 ,  G06F17/30864

Abstract: In one aspect, a method includes receiving a query determined to be a question query that seeks an answer response and data identifying resources determined to be responsive to the query; identifying structured content set in a top-ranked subset of the resources, each structured content set being content arranged according to related attributes in one of the resources; for each identified structured content set, determining whether the query matches the structured content set based on terms of the query matching related attributes of the structured content set; selecting one of the structured content sets for which the query is determined to match; generating, from the selected structured content set, a structured fact set from the related attributes that matched the terms of the query; and providing the structured fact set with search results that identify the resources determined to be responsive to the query.