An architecture for component-based design of representative-based clustering algorithms

详细信息	查看全文 | 推荐本文 |

• 作者：Boris Deliba&scaron ; i膰p>ap>  ; [Author Vitae] ; Milan Vuki膰evi膰p>ap>p> ; p>p>vukicevicm@fon.bg.ac.rsp>  ; [Author Vitae] ; Milo&scaron ; Jovanovi膰p>ap>  ; [Author Vitae] ; Kathrin Kirchnerp>bp>  ; [Author Vitae] ; Johannes Ruhlandp>bp>  ; [Author Vitae] ; Milija Suknovi膰p>ap>  ; [Author Vitae]
• 关键词：Representative-based clustering algorithms ; Architecture ; Reusable component ; Generic algorithm ; K-means
• 刊名：Data and Knowledge Engineering
• 出版年：2012
• 期刊代码：44_0169023x
• 类别：cp
• 出版时间：May, 2012
• 卷：75
• 期：Complete
• 页码：78-98
• 文件大小：1429 K

摘要

We propose an architecture for the design of representative-based clustering algorithms based on reusable components. These components were derived from K-means-like algorithms and their extensions. With the suggested clustering design architecture, it is possible to reconstruct popular algorithms, but also to build new algorithms by exchanging components from original algorithms and their improvements. In this way, the design of a myriad of representative-based clustering algorithms and their fair comparison and evaluation are possible. In addition to the architecture, we show the usefulness of the proposed approach by providing experimental evaluation.