The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Aug. 05, 2025

Filed:

Jun. 21, 2024
Applicant:

Gracenote, Inc., New York, NY (US);

Inventors:

Aneesh Vartakavi, Emeryville, CA (US);

Peter C. Dimaria, Berkeley, CA (US);

Markus K. Cremer, Orinda, CA (US);

Phillip Popp, Oakland, CA (US);

Assignee:

Gracenote, Inc., New York, NY (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/41 (2019.01);
U.S. Cl.
CPC ...
G06F 16/41 (2019.01);
Abstract

A clustering machine can cluster descriptive vectors in a balanced manner. The clustering machine calculates distances between pairs of descriptive vectors and generates clusters of vectors arranged in a hierarchy. The clustering machine determines centroid vectors of the clusters, such that each cluster is represented by its corresponding centroid vector. The clustering machine calculates a sum of inter-cluster vector distances between pairs of centroid vectors, as well as a sum of intra-cluster vector distances between pairs of vectors in the clusters. The clustering machine calculates multiple scores of the hierarchy by varying a scalar and calculating a separate score for each scalar. The calculation of each score is based on the two sums previously calculated for the hierarchy. The clustering machine may select or otherwise identify a balanced subset of the hierarchy by finding an extremum in the calculated scores.


Find Patent Forward Citations

Loading…