图 书 馆
用Winnow学习预测后缀树Learning Prediction Suffix Trees with Winnow |
|
| 课程网址: | http://videolectures.net/icml09_karampatziakis_lpst/ |
| 主讲教师: | Nikos Karampatziakis |
| 开课单位: | 康奈尔大学 |
| 开课时间: | 2009-08-26 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Prediction suffix trees (PSTs) are a popular tool for modeling sequences and have been successfully applied in many domains such as compression and language modeling. In this work we adapt the well studied Winnow algorithm to the task of learning PSTs. The proposed algorithm automatically grows the tree, so that it provably remains competitive with any fixed PST determined in hindsight. At the same time we prove that the depth of the tree grows only logarithmically with the number of mistakes made by the algorithm. Finally, we empirically demonstrate its effectiveness in two different tasks. |
| 关 键 词: | 预测后缀树; 压缩; Winnow算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-04-23：lxf |
| 阅读次数: | 36 |