By Topic

Rules selection in word sense disambiguation using Adaboost

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

2 Author(s)
Ying Qin ; Sch. of Inf. Eng., Beijing Univ. of Posts & Telecommun., China ; Xiaojie Wang

Boosting algorithm is confirmed as a promising and practical machine learning method which has successfully been applied to some classification problems. Word sense disambiguation system using Boosting acquired the state-of-the-art performance. This paper explores the primary but unavoidable problem of rules selection in Adaboost applied to word sense disambiguation system, presenting the relations among rules selection, iteration number and the performance of the system on sparse data. The results show the increment of the iteration number in Adaboost trained on a small set of examples without noise is neither helpful nor harmful. The algorithm is sensitive to weak rules selection in two aspects: on one hand, some rules make the training error converge more quickly and have higher generalization ability simultaneously, on the other hand, conflictions may occur among weak rules built on different features causing trouble to the whole system.

Published in:

Natural Language Processing and Knowledge Engineering, 2005. IEEE NLP-KE '05. Proceedings of 2005 IEEE International Conference on

Date of Conference:

30 Oct.-1 Nov. 2005