Buscar
Mostrando ítems 1-2 de 2
Scalable Feature Selection Using ReliefF Aided by Locality-Sensitive Hashing
(Wiley, 2021)
[Abstract] Feature selection algorithms, such as ReliefF, are very important for processing high-dimensionality data sets. However, widespread use of popular and effective such algorithms is limited by their computational ...
Fast Distributed kNN Graph Construction Using Auto-tuned Locality-sensitive Hashing
(Association for Computing Machinery, 2020)
[Abstract]: The k-nearest-neighbors (kNN) graph is a popular and powerful data structure that is used in various areas of Data Science, but the high computational cost of obtaining it hinders its use on large datasets. ...