Buscar
Mostrando ítems 1-4 de 4
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 ...
Large scale anomaly detection in mixed numerical and categorical input spaces
(Elsevier, 2019)
[Abstract]: This work presents the ADMNC method, designed to tackle anomaly detection for large-scale problems with a mixture of categorical and numerical input variables. A flexible parametric probability measure is ...
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. ...
A scalable decision-tree-based method to explain interactions in dyadic data
(Elsevier, 2019-12)
[Abstract]: Gaining relevant insight from a dyadic dataset, which describes interactions between two entities, is an open problem that has sparked the interest of researchers and industry data scientists alike. However, ...