图 书 馆
利用常数据流的任意时间算法的优势Harnessing the Strengths of Anytime Algorithms for Constant Data Streams |
|
| 课程网址: | http://videolectures.net/ecmlpkdd09_kranen_hsaacds/ |
| 主讲教师: | Philipp Kranen |
| 开课单位: | 亚琛工业大学 |
| 开课时间: | 2009-10-20 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Anytime algorithms have been proposed for many different applications e.g. in data mining. Their strengths are the ability to first provide a result after a very short initialization and second to improve their result with additional time. Therefore, anytime algorithms have so far been used when the available processing time varies, e.g. on varying data streams. In this paper we propose to employ anytime algorithms on constant data streams, i.e. for tasks with constant time allowance. We introduce two approaches that harness the strengths of anytime algorithms on constant data streams and thereby improve the over all quality of the result with respect to the corresponding budget algorithm. We derive formulas for the expected performance gain and demonstrate the effectiveness of our novel approaches using existing anytime algorithms on benchmark data sets. The goal that was set and reached in this paper is to improve the quality of the result over that of traditional budget approaches, which are used in an abundance of stream mining applications. Using anytime classification as an example application we show for SVM, Bayes and nearest neighbor classifiers that both our novel approaches improve the classification accuracy for slow and fast data streams. The results confirm our general theoretic models and show the effectiveness of our approaches. The simple yet effective idea can be employed for any anytime algorithm along with a quality measure and motivates further research in e.g. classification confidence measures or anytime algorithms. |
| 关 键 词: | 数据挖掘; 数据流; 时间算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-03-27：lxf |
| 阅读次数: | 38 |