October 2022 Summaries

K-means clustering is an unsupervised machine learning algorithm that groups objects based on attributes. It is widely used in various industries, such as customer segmentation, recommendation engines, and similarity search. The algorithm works by calculating the distance of each data element from the geometric center of a cluster and reconfiguring the cluster if it finds a point belonging to a specific cluster closer to the centroid of another cluster. K-means clustering is useful in areas such as image processing, information retrieval, recommendation engines, and data compression. The number of clusters can be chosen using methods like the elbow method or the silhouette method. Zilliz offers a one-stop solution for challenges in handling unstructured data, especially for enterprises that build AI/ML applications that leverage vector similarity search.

The K-Nearest Neighbors (KNN) algorithm is a supervised machine learning technique used for classification and regression problems. It is categorized as a lazy learner, meaning it only stores the training dataset without going through a training stage. KNN works by estimating the likelihood that an unobserved data point will belong to one of two groups based on its nearest neighbors in the dataset. The algorithm uses a voting mechanism where the class with the most votes is assigned to the relevant data point. Different distance metrics can be used to determine whether or not a data point is a neighbor, such as Euclidean, Manhattan, Hamming, Cosine, Jaccard, and Minkowski distances. KNN can be improved by normalizing data on the same scale, tuning hyperparameters like K and distance metric, and using techniques like cross-validation to test different values of K. The algorithm is time-efficient, simple to tune, and easily adaptable to multi-class problems but may not perform well with high-dimensional or unbalanced data.

This blog introduces the fundamentals of CLIP, an advanced text-to-image service developed by OpenAI. It explains how search algorithms and semantic similarity are used to match texts with images. The process involves mapping the semantics of texts and images into a high-dimensional space where vectors representing similar semantics have small distances between them. A typical text-to-image service consists of three parts: request side (texts), search algorithm, and underlying databases (images). CLIP helps in creating a unified semantic space for both texts and images, enabling efficient cross-modal search. The next article will demonstrate how to build a prototype text-to-image service using these concepts.