|
JAIST Repository >
a. 知識科学研究科・知識科学系 >
a10. 学術雑誌論文等 >
a10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/5018
|
| タイトル: | An evidential reasoning approach to weighted combination of classifiers for word sense disambiguation |
| 著者: | Le, Cuong Anh
Huynh, Van-Nam
Shimazu, Akira |
| キーワード: | Computational linguistics
Weighted combination of classifiers
Word sense disambiguation
Dempster-Shafer theory of evidence |
| 発行日: | 2005 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 3587 |
| 開始ページ: | 516 |
| 終了ページ: | 525 |
| DOI: | 10.1007/11510888_51 |
| 抄録: | Arguing that various ways of using context in word sense disambiguation (WSD) can be considered as distinct representations of a polysemous word, a theoretical framework for the weighted combination of soft decisions generated by experts employing these distinct representations is proposed in this paper. Essentially, this approach is based on the Dempster-Shafer theory of evidence. By taking the confidence of individual classifiers into account, a general rule of weighted combination for classifiers is formulated, and then two particular combination schemes are derived. These proposed strategies are experimentally tested on the datasets for four polysemous words, namely interest, line, serve, and hard, and obtained the better result in comparison with previous studies for all cases, with an exception of the word line. |
| Rights: | This is the author-created version of Springer, Cuong Anh Le, Van-Nam Huynh and Akira Shimazu, Lecture Notes in Computer Science, 3587, 2005, 516-525. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/11510888_51 |
| URI: | http://hdl.handle.net/10119/5018 |
| 資料タイプ: | author |
| 出現コレクション: | a10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C4760.pdf | | 191Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
