Clustering algorithm with other functions (Laplacian Norm, Jacobi algorithm - Eigenvalues and Eigenvectors extractor, etc)
-
Updated
Oct 27, 2022 - C
Clustering algorithm with other functions (Laplacian Norm, Jacobi algorithm - Eigenvalues and Eigenvectors extractor, etc)
The Similarity Search Tree is an efficient method for indexing high dimensional feature vectors. The main objective of this data structure is to obtain the nearest neighbors given a certain query vector in a reasonable amount of time. In this project, the k-NN algorithm was adapted for supporting image retrieval.
Parallellization of the Kmeans algorithm with OpenMP
Add a description, image, and links to the centroids topic page so that developers can more easily learn about it.
To associate your repository with the centroids topic, visit your repo's landing page and select "manage topics."