Show simple item record

dc.contributor.authorMeng, Lei
dc.date.accessioned2010-08-12T20:37:24Z
dc.date.available2010-08-12T20:37:24Z
dc.date.issued2010-08-12T20:37:24Z
dc.identifier.urihttp://hdl.handle.net/2104/7992
dc.description.abstractThis project investigates m-fold cross-validation algorithms for automatic selection of k with k-nearest neighbors problems. An algorithm taxonomy is used to identify different m-fold cross-validation algorithms. The taxonomy contains three elements: the order of computing, the number of indexes and the number of threads. Different combinations of these elements produce different algorithms. Ten reasonable algorithms are implemented and tested on four datasets. These datasets are of different dimensions and different sizes. By analyzing the performance and results of these ten algorithms, the functionality of different elements in the taxonomy in different situation is identified.en
dc.format.extent1100140 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.titleEfficient M-fold Cross-validation Algorithm for KNearest Neighborsen
dc.licenseGPLen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record