Name
Abstract | ||
|---|---|---|
With the advent of Big Data era, data reduction methods are highly demanded given its ability to simplify huge data, and ease complex learning processes. Concretely, algorithms that are able to filter relevant dimensions from a set of millions are of huge importance. Although effective, these techniques suffer from the scalability curse as well. In this work, we propose a distributed feature weighting algorithm, which is able to rank millions of features in parallel using large samples. This method, inspired by the well-known RELIEF algorithm, introduces a novel redundancy elimination measure that provides similar schemes to those based on entropy at a much lower cost. It also allows smooth scale up when more instances are demanded in feature estimations. Empirical tests performed on our method show its estimation ability in manifold huge sets --both in number of features and instances--, as well as its simplified runtime cost (specially, at the redundancy detection step). |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Learning | Weighting,Feature selection,Redundancy (engineering),Artificial intelligence,Big data,Mathematics,Machine learning,Manifold,Data reduction,Scalability |
DocType | Volume | Citations |
Journal | abs/1804.05774 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergio Ramírez-Gallego | 1 | 98 | 6.99 |
| Salvador García | 2 | 4151 | 118.45 |
| Ning Xiong | 3 | 58 | 5.90 |
| Francisco Herrera | 4 | 27391 | 1168.49 |