Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://hdl.handle.net/20.500.14279/1977
Πεδίο DC | Τιμή | Γλώσσα |
---|---|---|
dc.contributor.author | Yanev, Petko I. | - |
dc.contributor.author | Kontoghiorghes, Erricos John | - |
dc.date.accessioned | 2013-01-28T08:19:22Z | en |
dc.date.accessioned | 2013-05-16T08:22:21Z | - |
dc.date.accessioned | 2015-12-02T09:32:18Z | - |
dc.date.available | 2013-01-28T08:19:22Z | en |
dc.date.available | 2013-05-16T08:22:21Z | - |
dc.date.available | 2015-12-02T09:32:18Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | Journal of Computational and Graphical Statistics, 2009, vol. 18, no. 4, pp. 894-914 | en_US |
dc.identifier.issn | 15372715 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/1977 | - |
dc.description.abstract | An efficient graph-based strategy for performing the exhaustive k-fold crossvalidation procedure is proposed. All training (and testing) subsets are presented as nodes of a complete weighted graph. The arcs between the nodes indicate the different possibilities for deriving the solution of the destination node given the solution of the source node. The weights of the arcs represent the complexities of (the numerical operations involved in) updating and downdating the corresponding data matrices. The complete graph with arcs connecting every pair of nodes is defined and its properties are investigated. The optimum way of performing the exhaustive k-fold cross-validation is equivalent in deriving the path within the graph that has the minimum computational complexity. Furthermore, a generalization of the complete k-fold cross-validation graph is used to derive new strategies for performing random k-fold cross-validations. The proposed strategies generate additional nodes during the computations, which are part of the generalized graph. The additional nodes represent new models which have not been required initially, but provide additional information about the evaluated model. The advantages and the drawbacks of the proposed strategies are discussed. Numerical results are presented and analyzed. Finally the computation of all nearest neighbors of a given node is also considered. The Fortran 90 source code for the algorithms in the manuscript is available on-line. | en_US |
dc.format | en_US | |
dc.language.iso | en | en_US |
dc.relation.ispartof | Journal of Computational and Graphical Statistics | en_US |
dc.rights | © Taylor & Francis | en_US |
dc.subject | Downdating | en_US |
dc.subject | Model evaluation | en_US |
dc.subject | Model selection | en_US |
dc.subject | QR decomposition | en_US |
dc.subject | Resampling | en_US |
dc.subject | Updating | en_US |
dc.title | Graph-based strategies for performing the exhaustive and random k-fold cross-validations | en_US |
dc.type | Article | en_US |
dc.affiliation | Cyprus University of Technology | en |
dc.collaboration | Université de Neuchâtel | en_US |
dc.collaboration | University of Cyprus | en_US |
dc.collaboration | University of London | en_US |
dc.subject.category | Computer and Information Sciences | en_US |
dc.journals | Subscription | en_US |
dc.country | Switzerland | en_US |
dc.country | Cyprus | en_US |
dc.country | United Kingdom | en_US |
dc.subject.field | Natural Sciences | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.doi | 10.1198/jcgs.2009.08019 | en_US |
dc.dept.handle | 123456789/54 | en |
dc.relation.issue | 4 | en_US |
dc.relation.volume | 18 | en_US |
cut.common.academicyear | 2009-2010 | en_US |
dc.identifier.spage | 894 | en_US |
dc.identifier.epage | 914 | en_US |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
crisitem.journal.journalissn | 1537-2715 | - |
crisitem.journal.publisher | Taylor & Francis | - |
crisitem.author.dept | Department of Finance, Accounting and Management Science | - |
crisitem.author.faculty | Faculty of Tourism Management, Hospitality and Entrepreneurship | - |
crisitem.author.orcid | 0000-0001-9704-9510 | - |
crisitem.author.parentorg | Faculty of Management and Economics | - |
Εμφανίζεται στις συλλογές: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
2
checked on 9 Νοε 2023
WEB OF SCIENCETM
Citations
50
2
Last Week
0
0
Last month
0
0
checked on 29 Οκτ 2023
Page view(s)
576
Last Week
1
1
Last month
31
31
checked on 13 Μαρ 2025
Google ScholarTM
Check
Altmetric
Όλα τα τεκμήρια του δικτυακού τόπου προστατεύονται από πνευματικά δικαιώματα