Referenced Items are not available for this document.
Classification methods with linear computational complexity O(nd) in the number of samples n and their dimensionality d often give results that are better or at least statistically not significantly worse that slower algorithms. This is demonstrated here for many benchmark datasets downloaded from the UCI Machine Learning Repository. Results provided in this paper should be used as a reference for estimating usefulness of new learning algorithms: higher complexity methods should provide significantly better results to justify their use.
Published in:
Neural Networks (IJCNN), The 2012 International Joint Conference on
Date of Conference: 10-15 June 2012
- Page(s):
- 1 - 4
- ISSN :
- 2161-4393
- E-ISBN :
- 978-1-4673-1489-3
- Print ISBN:
- 978-1-4673-1488-6
- INSPEC Accession Number:
- 12906474
- Conference Location :
- Brisbane, QLD
- Digital Object Identifier :
- 10.1109/IJCNN.2012.6252380
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
