US Patent 11671241 Privacy-preserving fast approximate K-means clustering with hamming vectors

This method is a process that improves the execution time and maintains very precise clustering effectiveness utilizing a unique algorithm (identified as PPK means) that optimizes a process that is referred to as K-means clustering. The PPK means algorithm utilizes estimation values of signatures of new centroids for speed improvement and encoded data to provide a level of privacy protection. A system comprises a processor, operably coupled to memory, and that executes the computer-executable components, wherein the computer-executable components comprise: an encoding component that encodes a set of real-time valued vectors as bit vectors; and a clustering component that performs K-means clustering on the bit encoded vectors.