arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.3722cs.LGcs.AIstat.ML
收藏

分层亲和传播

Hierarchical Affinity Propagation

University of Toronto(多伦多大学)

Inmar Givoni, Clement Chung, Brendan J. Frey

摘要:

亲和传播是一种基于样本的聚类算法,它找到一组最好的数据点,并将每个数据点与一个样本相关联。我们扩展亲和传播的原则性的方式来解决层次聚类问题,这出现在各种领域,包括生物学,传感器网络和决策运筹学。我们推导出一个推理算法,通过传播信息上下的层次结构,是有效的,尽管所需的图形模型制定的高阶电位。我们证明,我们的方法优于贪婪的技术,集群一层的时间。我们表明,在一个人工数据集设计模仿艾滋病毒株突变动态,我们的方法优于相关方法。对于真实的HIV序列,在地面真相不可用的情况下,我们表明我们的方法在潜在的目标函数方面取得了更好的结果,并显示结果与地理位置和毒株亚型有意义地对应。最后,我们报告的结果使用的方法进行质谱分析,显示它表现良好相比,国家的最先进的方法。

英文摘要:

Affinity propagation is an exemplar-based clustering algorithm that finds a set of data-points that best exemplify the data, and associates each datapoint with one exemplar. We extend affinity propagation in a principled way to solve the hierarchical clustering problem, which arises in a variety of domains including biology, sensor networks and decision making in operational research. We derive an inference algorithm that operates by propagating information up and down the hierarchy, and is efficient despite the high-order potentials required for the graphical model formulation. We demonstrate that our method outperforms greedy techniques that cluster one layer at a time. We show that on an artificial dataset designed to mimic the HIV-strain mutation dynamics, our method outperforms related methods. For real HIV sequences, where the ground truth is not available, we show our method achieves better results, in terms of the underlying objective function, and show the results correspond meaningfully to geographical location and strain subtypes. Finally we report results on using the method for the analysis of mass spectra, showing it performs favorably compared to state-of-the-art methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑