一种基于距离聚合的聚类监督学习方法
A clusterwise supervised learning procedure based on aggregation of distances
摘要:
如今,许多机器学习程序都可以在货架上使用,并且可以很容易地用于校准监督数据的预测模型。然而,当输入数据由多个未知聚类组成,并且存在不同的潜在预测模型时,拟合模型是一项更具挑战性的任务。在本文中,我们提出了一个三步自动解决这个问题的过程。KFC过程根据数据自适应地聚合不同的模型。该过程的第一步旨在捕捉输入数据的聚类结构,其特征可能是几个统计分布。它提供了几个分区,给出了分布的假设。对于每个分区,第二步基于每个聚类中的数据拟合特定的预测模型。整体模型是由对应于不同分区的模型的一致聚合来计算的。不同的模拟和真实数据的性能比较评估我们的方法在各种各样的预测问题的优异性能。
英文摘要:
Nowadays, many machine learning procedures are available on the shelve and may be used easily to calibrate predictive models on supervised data. However, when the input data consists of more than one unknown cluster, and when different underlying predictive models exist, fitting a model is a more challenging task. We propose, in this paper, a procedure in three steps to automatically solve this problem. The KFC procedure aggregates different models adaptively on data. The first step of the procedure aims at catching the clustering structure of the input data, which may be characterized by several statistical distributions. It provides several partitions, given the assumptions on the distributions. For each partition, the second step fits a specific predictive model based on the data in each cluster. The overall model is computed by a consensual aggregation of the models corresponding to the different partitions. A comparison of the performances on different simulated and real data assesses the excellent performance of our method in a large variety of prediction problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。