基于消息传递的无监督和半监督聚类:软约束仿射传播
Unsupervised and semi-supervised clustering by message passing: Soft-constraint affinity propagation
摘要:
软约束仿射传播(SCAP)是一种新的基于物理学的聚类技术。首先,我们推导出一个简化版本的算法,并讨论时间和内存效率的实现的可能性。随后,我们给出了一个详细的性能分析SCAP人工数据,表明该算法有效地揭示了集群和层次数据结构。我们将该算法推广到半监督聚类问题,其中数据已经部分标记,聚类将标签分配给以前未标记的点。SCAP使用数据的几何组织和以计算高效的方式分配给几个点的可用标签,如在人工和生物基准数据上所示。
英文摘要:
Soft-constraint affinity propagation (SCAP) is a new statistical-physics based clustering technique. First we give the derivation of a simplified version of the algorithm and discuss possibilities of time- and memory-efficient implementations. Later we give a detailed analysis of the performance of SCAP on artificial data, showing that the algorithm efficiently unveils clustered and hierarchical data structures. We generalize the algorithm to the problem of semi-supervised clustering, where data are already partially labeled, and clustering assigns labels to previously unlabeled points. SCAP uses both the geometrical organization of the data and the available labels assigned to few points in a computationally efficient way, as is shown on artificial and biological benchmark data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。