Noisy Data Elimination Using Mutual K-Nearest Neighbor For Classification Mining

Liu, H; Zhang, S

Noisy Data Elimination Using Mutual K-Nearest Neighbor For Classification Mining

Liu, H Zhang, S

Permalink

Publisher:: Elsevier Science Inc
Publication Type:: Journal Article
Citation:: Journal Of Systems And Software, 2012, 85 (5), pp. 1067 - 1074
Issue Date:: 2012-01

Closed Access

	Filename	Description	Size
	2011005458OK.pdf		483.17 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	Liu, H	en_US
dc.contributor.author	Zhang, S	en_US
dc.date.issued	2012-01	en_US
dc.identifier.citation	Journal Of Systems And Software, 2012, 85 (5), pp. 1067 - 1074	en_US
dc.identifier.issn	0164-1212	en_US
dc.identifier.uri	http://hdl.handle.net/10453/22214
dc.description.abstract	k nearest neighbor (kNN) is an effective and powerful lazy learning algorithm, notwithstanding its easy-to-implement. However, its performance heavily relies on the quality of training data. Due to many complex real-applications, noises coming from vario	en_US
dc.publisher	Elsevier Science Inc	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP0985456
dc.relation.ispartof	Journal Of Systems And Software	en_US
dc.relation.isbasedon	10.1016/j.jss.2011.12.019	en_US
dc.subject.classification	Software Engineering	en_US
dc.title	Noisy Data Elimination Using Mutual K-Nearest Neighbor For Classification Mining	en_US
dc.type	Journal Article
utslib.citation.volume	5	en_US
utslib.citation.volume	85	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	0804 Data Format	en_US
utslib.for	0806 Information Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access
pubs.consider-herdc	true	en_US
pubs.issue	5	en_US
pubs.volume	85	en_US

Abstract:

k nearest neighbor (kNN) is an effective and powerful lazy learning algorithm, notwithstanding its easy-to-implement. However, its performance heavily relies on the quality of training data. Due to many complex real-applications, noises coming from vario

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

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