dc.creatorAnilu, Franco-Arcega
dc.creatorJesús Ariel, Carrasco-Ochoa
dc.creatorGuillermo, Sánchez-Díaz
dc.creatorJosé Francisco, Martínez-Trinidad
dc.date.accessioned2013-03-22T01:56:29Z
dc.date.available2013-03-22T01:56:29Z
dc.date.created2013-03-22T01:56:29Z
dc.date.issued2013-03-06
dc.identifierComputación y Sistemas; Vol. 17 No. 1
dc.identifier1405-5546
dc.identifierhttp://www.repositoriodigital.ipn.mx/handle/123456789/14665
dc.description.abstractAbstract: In this paper, several algorithms have been developed for building decision trees from large datasets. These algorithms overcome some restrictions of the most recent algorithms in the state of the art. Three of these algorithms have been designed to process datasets described exclusively by numeric attributes, and the fourth one, for processing mixed datasets. The proposed algorithms process all the training instances without storing the whole dataset in the main memory. Besides, the developed algorithms are faster than the most recent algorithms for building decision trees from large datasets, and reach competitive accuracy rates.
dc.languageen_US
dc.publisherComputación y Sistemas; Vol. 17 No. 1
dc.relationComputación y Sistemas;Vol. 17 No. 1
dc.subjectKeywords: Decision trees, supervised classification, large datasets.
dc.titleDecision Tree based Classifiers for Large Datasets
dc.typeOther


Este ítem pertenece a la siguiente institución