11977959

Data Compression Using Nearest Neighbor Cluster

PublishedMay 7, 2024
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
9 claims

Legal claims defining the scope of protection, as filed with the USPTO.

3

3. The method of claim 1, wherein the locality sensitive hashing function is a secure hash algorithm 1 (“SHA-1”) or a Message Digest 5 (“MD5”) algorithm.

4

4. The method of claim 1, wherein the cluster is created in an unsupervised learning environment.

5

5. The method of claim 1, wherein the cluster is created using an offload engine.

8

8. The method of claim 1, wherein, instead of using locality sensitive hashing to create the cluster of nearest neighbors, one or more of the following algorithms has been used to create the cluster of nearest neighbors: a k-means clustering algorithm, a k-medoids clustering algorithm, a mean shift algorithm, a generalized method of moment (GMM) algorithm, or a density based spatial clustering of applications with noise (DBSCAN) algorithm.

11

11. The system of claim 9, wherein the locality sensitive hashing function is a secure hash algorithm 1 (“SHA-1”) or a Message Digest 5 (“MD5”) algorithm.

12

12. The system of claim 9, wherein the cluster is created in an unsupervised learning environment.

13

13. The system of claim 9, wherein the cluster is created using the offload engine.

16

16. The system of claim 9, wherein, instead of using locality sensitive hashing to create the cluster of nearest neighbors, one or more of the following algorithms has been used to create the cluster of nearest neighbors: a k-means clustering algorithm, a k-medoids clustering algorithm, a mean shift algorithm, a generalized method of moment (GMM) algorithm, or a density based spatial clustering of applications with noise (DBSCAN) algorithm.

18

18. The non-transitory, computer readable medium of claim 17, wherein, instead of using locality sensitive hashing to create the cluster of nearest neighbors, one or more of the following algorithms has been used to create the cluster of nearest neighbors: a k-means clustering algorithm, a k-medoids clustering algorithm, a mean shift algorithm, a generalized method of moment (GMM) algorithm, or a density based spatial clustering of applications with noise (DBSCAN) algorithm.

Patent Metadata

Filing Date

Unknown

Publication Date

May 7, 2024

Inventors

Jonathan Krasner
Sweetesh Singh

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “DATA COMPRESSION USING NEAREST NEIGHBOR CLUSTER” (11977959). https://patentable.app/patents/11977959

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.

DATA COMPRESSION USING NEAREST NEIGHBOR CLUSTER — Jonathan Krasner | Patentable