You are not logged in.
Openly accessible

Efficient cross-validation of the complete two stages in KFD classifier formulation

An, Senjian, Liu, Wanquan and Venkatesh, Svetha 2006, Efficient cross-validation of the complete two stages in KFD classifier formulation, in ICPR 2006 : Proceedings of the 18th International Conference on Pattern Recognition, IEEE, Washington, D. C., pp. 240-244.

Attached Files
Name Description MIMEType Size Downloads
SYMPLECTIC-LICENCE Symplectic Licence Click to show the corresponding preview/stream 1.47KB 0
venkatesh-efficientcross-2006.pdf Published version application/pdf 139.07KB 42

Title Efficient cross-validation of the complete two stages in KFD classifier formulation
Author(s) An, Senjian
Liu, Wanquan
Venkatesh, SvethaORCID iD for Venkatesh, Svetha orcid.org/0000-0001-8675-6631
Conference name International Conference on Pattern Recognition (18th : 2006 : Hong Kong, China)
Conference location Hong Kong, China
Conference dates 20-24 Aug. 2006
Title of proceedings ICPR 2006 : Proceedings of the 18th International Conference on Pattern Recognition
Editor(s) [Unknown]
Publication date 2006
Conference series International Conference on Pattern Recognition
Start page 240
End page 244
Total pages 5
Publisher IEEE
Place of publication Washington, D. C.
Keyword(s) computational complexity
computer simulation
data acquisition
data reduction
mathematical models
Summary This paper presents an efficient evaluation algorithm for cross-validating the two-stage approach of KFD classifiers. The proposed algorithm is of the same complexity level as the existing indirect efficient cross-validation methods but it is more reliable since it is direct and constitutes exact cross-validation for the KFD classifier formulation. Simulations demonstrate that the proposed algorithm is almost as fast as the existing fast indirect evaluation algorithm and the twostage cross-validation selects better models on most of the thirteen benchmark data sets.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 0769525210
9780769525211
ISSN 1051-4651
Language eng
Field of Research 089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1.1 Full written paper - refereed
Copyright notice ©2006, IEEE
Free to Read? Yes
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044602

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 250 Abstract Views, 41 File Downloads  -  Detailed Statistics
Created: Fri, 20 Apr 2012, 11:34:43 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.