2026-06-05T19:24:16Zhttps://riubu.ubu.es/oai/request

oai:riubu.ubu.es:10259/42212021-11-10T09:38:16Zcom_10259_5377com_10259_5086com_10259_2604com_10259_4219col_10259_5378col_10259_4220

Arnaiz González, Álvar Diez Pastor, José Francisco Rodríguez Diez, Juan José García Osorio, César 2016-09-01T09:42:59Z 2016-09-01T09:42:59Z 2016-09 0950-7051 http://hdl.handle.net/10259/4221 10.1016/j.knosys.2016.05.056 Over recent decades, database sizes have grown considerably. Larger sizes present new challenges, because machine learning algorithms are not prepared to process such large volumes of information. Instance selection methods can alleviate this problem when the size of the data set is medium to large. However, even these methods face similar problems with very large-to-massive data sets. In this paper, two new algorithms with linear complexity for instance selection purposes are presented. Both algorithms use locality-sensitive hashing to find similarities between instances. While the complexity of conventional methods (usually quadratic, O(n2), or log-linear, O(nlogn)) means that they are unable to process large-sized data sets, the new proposal shows competitive results in terms of accuracy. Even more remarkably, it shortens execution time, as the proposal manages to reduce complexity and make it linear with respect to the data set size. The new proposal has been compared with some of the best known instance selection methods for testing and has also been evaluated on large data sets (up to a million instances). Supported by the Research Projects TIN 2011-24046 and TIN 2015-67534-P from the Spanish Ministry of Economy and Competitiveness. application/pdf eng Elsevier Knowledge-Based Systems. 2016. V. 107, p. 83–95 http://dx.doi.org/10.1016/j.knosys.2016.05.056 info:eu-repo/grantAgreement/MINECO/TIN 2011-24046 info:eu-repo/grantAgreement/MINECO/TIN 2015-67534-P Attribution 4.0 International http://creativecommons.org/licenses/by/4.0/ info:eu-repo/semantics/openAccess Nearest neighbor Data reduction Instance selection Hashing Big data Informática Computer science Instance selection of linear complexity for big data info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion