利用迭代傅里叶变换去噪确定性网络
Denoising deterministic networks using iterative Fourier transforms
AI总结:
本文提出一种基于迭代傅里叶变换的去噪方法,用于在存在边修剪和噪声的情况下识别确定性网络结构,并在晶格和Kautz网络上表现出最佳性能。
摘要:
我们详细介绍了一种基于傅里叶变换的新型方法(IterativeFT),用于在存在边修剪和高斯噪声的情况下识别确定性网络结构。该技术涉及对目标网络邻接矩阵进行迭代执行的正向和反向二维离散傅里叶变换。该方法的去噪能力通过在邻接矩阵的实域和频域表示上应用稀疏化操作来实现,当实域的稀疏模式稳定时,算法收敛。为了证明该方法的有效性,我们将其应用于几个确定性模型的噪声版本,包括Kautz、晶格、树和二分网络。为了对比,我们还评估了偏好附加网络,以说明其在随机图上的行为。我们比较了IterativeFT与简单的实域和频域阈值法、降秩重建和局部自适应网络稀疏化方法的性能。与比较的网络去噪方法相比,所提出的IterativeFT方法在晶格和Kuatz网络上提供了最佳的整体性能,在树和二分网络上具有竞争力的性能。重要的是,IterativeFT技术在过滤噪声边和恢复缺失的真实边方面都很有效。
英文摘要:
We detail a novel Fourier-based approach (IterativeFT) for identifying deterministic network structure in the presence of both edge pruning and Gaussian noise. This technique involves the iterative execution of forward and inverse 2D discrete Fourier transforms on a target network adjacency matrix. The denoising ability of the method is achieved via the application of a sparsification operation to both the real and frequency domain representations of the adjacency matrix with algorithm convergence achieved when the real domain sparsity pattern stabilizes. To demonstrate the effectiveness of the approach, we apply it to noisy versions of several deterministic models including Kautz, lattice, tree and bipartite networks. For contrast, we also evaluate preferential attachment networks to illustrate the behavior on stochastic graphs. We compare the performance of IterativeFT against simple real domain and frequency domain thresholding, reduced rank reconstruction and locally adaptive network sparsification. Relative to the comparison network denoising approaches, the proposed IterativeFT method provides the best overall performance for lattice and Kuatz networks with competitive performance on tree and bipartite networks. Importantly, the InterativeFT technique is effective at both filtering noisy edges and recovering true edges that are missing from the observed network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。