Amazon Technologies, Inc.

American Express Travel Related Services Company, Inc.

Bharath Venkatesh

Srujana Merugu

Gowda Dayananda Anjaneyapura Range

Gourav Roy

Amit Chandak

Aswin Natarajan

Prateek Gupta

Sathish Kumar Palanisamy

Jagannathan Srinivasan

Shourya Roy

Salil Joshi

Dawn Thomas

Yue Jiao

Disclosed are various approaches for providing a natural language interface for searching databases. A natural language query is parsed to identify a plurality of tokens. At least one operator is identified with a machine-learning model based at least in part on the plurality of tokens. Next, at least one attribute and at least one respective attribute value are identified with a machine-learning model based at least in part on the plurality of tokens. Then, at least one constraint is identified with a machine-learning model based at least in part on the plurality of tokens. Finally, a machine language query is generated based at least in part on the at least one operator, the constraint(s), the attribute(s), and the respective attribute value(s).

Natural language interface to databases

A number of attributes of different attribute types, to be used to assign observation records of a data set to clusters, are identified. Attribute-type-specific distance metrics for the attributes, which can be combined to obtain a normalized aggregated distance of an observation record from a cluster representative, are selected. One or more iterations of a selected clustering methodology are implemented on the data set using resources of a machine learning service until targeted termination criteria are met. A given iteration includes assigning the observations to clusters of a current version of a clustering model based on the aggregated distances from the cluster representatives of the current version, and updating the cluster representatives to generate a new version of the clustering model.

Scalable clustering for mixed machine learning data

An approximate data structure to represent clusters of observation records of a data set is identified. A hierarchical representation of a plurality of clusters, including the targeted number of clusters among which the observation records are to be distributed, is generated. Each node of the hierarchy comprises an instance of the approximate data structure. Until a set of termination criteria are met, iterations of a selected clustering methodology are run. In a given iteration, distances of observation records from the cluster representatives of a current version of the model are computed using the hierarchical representation, and a new version of the model with modified cluster representatives is generated.

Clustering sparse high dimensional data using sketches

Growing community of inventors

Bengaluru, India

Bharath Venkatesh