期刊
PATTERN RECOGNITION
卷 45, 期 1, 页码 447-464出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2011.05.016
关键词
Partitioning clustuing algorithms; Relational data; Relevance weight; Multiple dissimilarity matrices
资金
- CNPq
- FACEPE
- INRIA (France)
This paper introduces hard clustering algorithms that are able to partition objects taking into account simultaneously their relational descriptions given by multiple dissimilarity matrices. These matrices have been generated using different sets of variables and dissimilarity functions. These methods are designed to furnish a partition and a prototype for each cluster as well as to learn a relevance weight for each dissimilarity matrix by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives. These relevance weights change at each algorithm iteration and can either be the same for all clusters or different from one cluster to another. Experiments with data sets (synthetic and from UCI machine learning repository) described by real-valued variables as well as with time trajectory data sets show the usefulness of the proposed algorithms. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据