By Topic

Improving performance of the k-nearest neighbor classifier by tolerant rough sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yongguang Bao ; Dept.of Intelligence and Comput. Sci., Nagoya Inst. of Technol., Japan ; Xiaoyong Du ; Ishii, N.

The authors report on efforts to improve the performance of k-nearest neighbor classification by introducing the tolerant rough set. We relate the tolerant rough relation with object similarity. Two objects are called similar if and only if these two objects satisfy the requirements of the tolerant rough relation. Hence, the tolerant rough set is used to select objects from the training data and constructing the similarity function. A genetic algorithm (GA) algorithm is used for seeking optimal similarity metrics. Experiments have been conducted on some artificial and real world data, and the results show that our algorithm can improve the performance of the k-nearest neighbor classification, and achieve a higher accuracy compared with the C4.5 system

Published in:

Cooperative Database Systems for Advanced Applications, 2001. CODAS 2001. The Proceedings of the Third International Symposium on

Date of Conference: