Cost-sensitive classification with k-nearest neighbors

Qin, Z; Wang, T; Zhang, C; Zhang, S

Cost-sensitive classification with k-nearest neighbors

Qin, Z Wang, T Zhang, C

Zhang, S

Permalink

Publisher:: Springer
Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science, 2013, 8041 pp. 112 - 131
Issue Date:: 2013-01

Closed Access

	Filename	Description	Size
	2013004344OK.pdf		262.09 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Qin, Z	en_US
dc.contributor.author	Wang, T	en_US
dc.contributor.author	Zhang, C https://orcid.org/0000-0001-5715-7154	en_US
dc.contributor.author	Zhang, S	en_US
dc.date	2013-08-10	en_US
dc.date.issued	2013-01	en_US
dc.identifier.citation	Lecture Notes in Computer Science, 2013, 8041 pp. 112 - 131	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28317
dc.description.abstract	Cost-sensitive learning algorithms are typically motivated by imbalance data in clinical diagnosis that contains skewed class distribution. While other popular classification methods have been improved against imbalance data, it is only unsolved to extend k-Nearest Neighbors (kNN) classification, one of top-10 datamining algorithms, to make it cost-sensitive to imbalance data. To fill in this gap, in this paper we study two simple yet effective cost-sensitive kNN classification approaches, called Direct-CS-kNN and Distance-CS-kNN. In addition, we utilize several strategies (i.e., smoothing, minimum-cost k value selection, feature selection and ensemble selection) to improve the performance of Direct-CS-kNN and Distance-CS-kNN. We conduct several groups of experiments to evaluate the efficiency with UCI datasets, and demonstrate that the proposed cost-sensitive kNN classification algorithms can significantly reduce misclassification cost, often by a large margin, as well as consistently outperform CS-4.5 with/without additional enhancements.	en_US
dc.publisher	Springer	en_US
dc.relation.ispartof	Lecture Notes in Computer Science	en_US
dc.relation.ispartof	International Conference on Knowledge Science, Engineering and Management	en_US
dc.relation.isbasedon	10.1007/978-3-642-39787-5_10	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Cost-sensitive classification with k-nearest neighbors	en_US
dc.type	Conference Proceeding
utslib.citation.volume	8041	en_US
utslib.location.activity	China	en_US
utslib.for	080201 Analysis of Algorithms and Complexity	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/DVC (International)
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - ACRI - Australia China Relations Institute
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.consider-herdc	true	en_US
pubs.finish-date	2013-08-12	en_US
pubs.start-date	2013-08-10	en_US
pubs.volume	8041	en_US

Abstract:

Cost-sensitive learning algorithms are typically motivated by imbalance data in clinical diagnosis that contains skewed class distribution. While other popular classification methods have been improved against imbalance data, it is only unsolved to extend k-Nearest Neighbors (kNN) classification, one of top-10 datamining algorithms, to make it cost-sensitive to imbalance data. To fill in this gap, in this paper we study two simple yet effective cost-sensitive kNN classification approaches, called Direct-CS-kNN and Distance-CS-kNN. In addition, we utilize several strategies (i.e., smoothing, minimum-cost k value selection, feature selection and ensemble selection) to improve the performance of Direct-CS-kNN and Distance-CS-kNN. We conduct several groups of experiments to evaluate the efficiency with UCI datasets, and demonstrate that the proposed cost-sensitive kNN classification algorithms can significantly reduce misclassification cost, often by a large margin, as well as consistently outperform CS-4.5 with/without additional enhancements.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/28317