Abstract
AbstractWe give a permutation approach to validation (estimation of out‐sample error). One typical use of validation is model selection. We establish the legitimacy of the proposed permutation complexity by proving a uniform bound on the out‐sample error, similar to a Vapnik‐Chervonenkis (VC)‐style bound. We extensively demonstrate this approach experimentally on synthetic data, standard data sets from the UCI‐repository, and a novel diffusion data set. The out‐of‐sample error estimates are comparable to cross validation (CV); yet, the method is more efficient and robust, being less susceptible to overfitting during model selection. Copyright © 2010 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 3: 361‐380 2010
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Statistical Analysis and Data Mining: The ASA Data Science Journal
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.