图 书 馆
面向自主网格：使用关联流分析作业流Toward Autonomic Grids: Analyzing the Job Flow with Affinity Streaming |
|
| 课程网址: | http://videolectures.net/kdd09_zhang_tagajfas/ |
| 主讲教师: | Xiangliang Zhang |
| 开课单位: | 巴黎大学 |
| 开课时间: | 2009-09-14 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a dataset, albeit with quadratic computational complexity. This paper, motivated by Autonomic Computing, extends AP to the data streaming framework. Firstly a hierarchical strategy is used to reduce the complexity to ${\cal O}(N^{1+\e})$; the distortion loss incurred is analyzed in relation with the dimension of the data items. Secondly, a coupling with a change detection test is used to cope with non-stationary data distribution, and rebuild the model as needed. The presented approach StrAP is applied to the stream of jobs submitted to the EGEE Grid, providing an understandable description of the job flow and enabling the system administrator to spot online some sources of failures. |
| 关 键 词: | 亲和传播; 聚类算法; 数据集 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-05-10：cwx |
| 阅读次数: | 28 |