| Abstract |
Instance selection is becoming more and more relevant due to the huge amount of data that is constantly being produced. However, although current algorithms are useful for fairly large datasets, many scaling problems are found when the number of instances is of hundred of thousands or millions. Most instance selection algorithms are of complexity at least O(n(2)), n being the number of instances. When we face huge problems, the scalability becomes an issue, and most of the algorithms are not applicable.\n Recently, two general methods for scaling up instance selection algorithms have been published in the literature: stratification and democratization. Both methods are able to successfully deal with large datasets. In this paper we show a comparison of these two methods when applied to very large and huge data-sets up to 50,000,000 instances. Additionally, we also test their performance in huge datasets that are also class-imbalanced. The comparison is made using a parallel implementation of both methods to fully exploit their possibilities.\n Although both methods show very good behavior in terms of testing error; storage reduction and execution time, democratization proves an overall better performance. |
