@inProceedings{
 title = {Dataset complexity can help to generate accurate ensembles of k-nearest neighbors.},
 type = {inProceedings},
 year = {2008},
 pages = {450-457},
 id = {a726083b-bcda-3051-8e65-3eb58c697ce9},
 created = {2019-11-19T16:28:42.612Z},
 file_attached = {false},
 profile_id = {bddcf02d-403b-3b06-9def-6d15cc293e20},
 group_id = {28b2996c-b80f-3c26-be71-695caf7040ac},
 last_modified = {2019-11-19T16:30:36.115Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {mvg:1174},
 source_type = {inproceedings},
 folder_uuids = {8292f5ec-1c57-4113-a303-25778e695f8c},
 private_publication = {false},
 bibtype = {inProceedings},
 author = {Okun, O and Valentini, G},
 booktitle = {Proc. International Joint Conference on Neural Networks (IJCNN 2008), Hong Kong}
}

{"_id":"p9r9iw8NaJgpS3RT2","bibbaseid":"okun-valentini-datasetcomplexitycanhelptogenerateaccurateensemblesofknearestneighbors-2008","authorIDs":[],"author_short":["Okun, O.","Valentini, G."],"bibdata":{"title":"Dataset complexity can help to generate accurate ensembles of k-nearest neighbors.","type":"inProceedings","year":"2008","pages":"450-457","id":"a726083b-bcda-3051-8e65-3eb58c697ce9","created":"2019-11-19T16:28:42.612Z","file_attached":false,"profile_id":"bddcf02d-403b-3b06-9def-6d15cc293e20","group_id":"28b2996c-b80f-3c26-be71-695caf7040ac","last_modified":"2019-11-19T16:30:36.115Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"mvg:1174","source_type":"inproceedings","folder_uuids":"8292f5ec-1c57-4113-a303-25778e695f8c","private_publication":false,"bibtype":"inProceedings","author":"Okun, O and Valentini, G","booktitle":"Proc. International Joint Conference on Neural Networks (IJCNN 2008), Hong Kong","bibtex":"@inProceedings{\n title = {Dataset complexity can help to generate accurate ensembles of k-nearest neighbors.},\n type = {inProceedings},\n year = {2008},\n pages = {450-457},\n id = {a726083b-bcda-3051-8e65-3eb58c697ce9},\n created = {2019-11-19T16:28:42.612Z},\n file_attached = {false},\n profile_id = {bddcf02d-403b-3b06-9def-6d15cc293e20},\n group_id = {28b2996c-b80f-3c26-be71-695caf7040ac},\n last_modified = {2019-11-19T16:30:36.115Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {mvg:1174},\n source_type = {inproceedings},\n folder_uuids = {8292f5ec-1c57-4113-a303-25778e695f8c},\n private_publication = {false},\n bibtype = {inProceedings},\n author = {Okun, O and Valentini, G},\n booktitle = {Proc. International Joint Conference on Neural Networks (IJCNN 2008), Hong Kong}\n}","author_short":["Okun, O.","Valentini, G."],"bibbaseid":"okun-valentini-datasetcomplexitycanhelptogenerateaccurateensemblesofknearestneighbors-2008","role":"author","urls":{},"downloads":0},"bibtype":"inProceedings","creationDate":"2019-11-19T16:11:28.795Z","downloads":0,"keywords":[],"search_terms":["dataset","complexity","help","generate","accurate","ensembles","nearest","neighbors","okun","valentini"],"title":"Dataset complexity can help to generate accurate ensembles of k-nearest neighbors.","year":2008}