US 11,810,174 B1
Index searching with non-Euclidean representations
Sumeet Katariya, Sunnyvale, CA (US); Nikhil S. Rao, San Jose, CA (US); Chandan K. Reddy, Broadlands, VA (US); Karthik Subbian, Palo Alto, CA (US); and Nurendra Choudhary, Arlington, VA (US)
Assigned to Amazon Technologies, Inc., Reno, NV (US)
Filed by Amazon Technologies, Inc., Reno, NV (US)
Filed on Mar. 31, 2021, as Appl. No. 17/219,511.
Int. Cl. G06Q 30/06 (2023.01); G06F 16/9538 (2019.01); G06N 20/00 (2019.01); G06Q 30/0601 (2023.01)
CPC G06Q 30/0623 (2013.01) [G06F 16/9538 (2019.01); G06N 20/00 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method, comprising:
receiving a query;
transforming Euclidean coordinates for the query to a hyperbolic space, the transformed Euclidean coordinates corresponding to a query hyperboloid within the hyperbolic space;
generating one or more geometric combinations associated with the query hyperboloid;
comparing a distance of the one or more geometric combinations within the hyperbolic space to relative positions of one or more product hyperboloids, the one or more product hyperboloids corresponding to units stored within an index with a hierarchical structure;
determining, based at least in part on the distance, a set of search results; and
providing, responsive to the query, the set of search results.