arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.00728stat.ME
收藏

新型矩阵t图形网络后验的软计算

Soft computing for the posterior of a new matrix t graphical network

J. Pillay, A. Bekker, J. T. Ferreira, M. Arashi

AI总结:

本文提出一种基于矩阵变量gamma噪声先验的新型矩阵t图形网络模型,通过贝叶斯结构学习计算后验并评估网络中心性,在合成与真实股票数据上验证了其比现有模型更灵活。

摘要:

在网络环境中对含噪数据进行建模仍然是一个无法回避的难题;幸运的是,随机矩阵理论可以有效地全面描述网络环境。因此,有必要使用矩阵变量模型对这些网络(以及伴随的含噪数据)进行概率刻画。在已有文献中,使用贝叶斯方法对网络数据进行去噪并不常见。本文采用贝叶斯观点,并引入一种新的矩阵变量t模型作为先验,其依赖于矩阵变量gamma分布来刻画噪声过程,并在正态性假设被违反的情况下遵循高斯图形网络。从统计学习的角度来看,这种理论考虑无疑有助于在数据科学的机器学习中,对具有网络属性的含噪数据所对应的结构进行现实世界层面的理解。本文提供了一个完整的结构学习程序,用于计算和近似所得到的感兴趣后验,以评估所考虑模型的网络中心性度量。本文使用合成数据和真实股票价格数据进行了实验,不仅验证了所提算法的能力,而且表明该模型比Billio et al. (2021)最初所暗示的具有更广泛的灵活性。

英文摘要:

Modelling noisy data in a network context remains an unavoidable obstacle; fortunately, random matrix theory may comprehensively describe network environments effectively. Thus it necessitates the probabilistic characterisation of these networks (and accompanying noisy data) using matrix variate models. Denoising network data using a Bayes approach is not common in surveyed literature. This paper adopts the Bayesian viewpoint and introduces a new matrix variate t-model in a prior sense by relying on the matrix variate gamma distribution for the noise process, following the Gaussian graphical network for the cases when the normality assumption is violated. From a statistical learning viewpoint, such a theoretical consideration indubitably benefits the real-world comprehension of structures causing noisy data with network-based attributes as part of machine learning in data science. A full structural learning procedure is provided for calculating and approximating the resulting posterior of interest to assess the considered model's network centrality measures. Experiments with synthetic and real-world stock price data are performed not only to validate the proposed algorithm's capabilities but also to show that this model has wider flexibility than originally implied in Billio et al. (2021).

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

↑