arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.04009stat.MLcs.LGstat.ME
收藏

一种基于并行模型的边缘和多变量聚类方法

A parallelizable model-based approach for marginal and multivariate clustering

University of Edinburgh(爱丁堡大学);Universidad Torcuato Di Tella(托尔夸托·迪特拉大学)

Miguel de Carvalho, Gabriel Martos Venturini, Andrej Svetlošák

摘要:

本文开发了一种聚类方法,利用基于模型的聚类的坚固性,同时试图减轻它的一些陷阱。首先,我们注意到标准的基于模型的聚类可能会导致每个边缘的聚类数量相同,这对于各种数据集来说似乎是一个相当人为的假设。我们通过为每个保证金指定一个有限混合模型来解决这个问题,该模型允许每个保证金具有不同数量的聚类,然后使用我们称为Reign-and-Conquer的策略游戏启发算法对多变量数据进行聚类。其次,由于建议的聚类方法只指定一个模型的利润率-但离开联合未指定-它具有的优势是部分并行化,因此,所提出的方法是计算吸引力,以及更易于处理的中到高维比一个“完整的”(联合)基于模型的聚类方法。人工数据上的一组数值实验表明,所提出的方法在各种情况下的整体性能良好,并使用真实数据集来展示其在实践中的应用。

英文摘要:

This paper develops a clustering method that takes advantage of the sturdiness of model-based clustering, while attempting to mitigate some of its pitfalls. First, we note that standard model-based clustering likely leads to the same number of clusters per margin, which seems a rather artificial assumption for a variety of datasets. We tackle this issue by specifying a finite mixture model per margin that allows each margin to have a different number of clusters, and then cluster the multivariate data using a strategy game-inspired algorithm to which we call Reign-and-Conquer. Second, since the proposed clustering approach only specifies a model for the margins -- but leaves the joint unspecified -- it has the advantage of being partially parallelizable; hence, the proposed approach is computationally appealing as well as more tractable for moderate to high dimensions than a `full' (joint) model-based clustering approach. A battery of numerical experiments on artificial data indicate an overall good performance of the proposed methods in a variety of scenarios, and real datasets are used to showcase their application in practice.

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

↑