☆ 4.7 Article

A parallel low rank matrix optimization method for recovering internet traffic network data via link flow measurement

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Computer Science, Artificial Intelligence

Hierarchical Deep Click Feature Prediction for Fine-Grained Image Recognition

Jun Yu et al.

Summary: This paper proposes a method to predict the click feature of an image from visual features by integrating sparse constraints and an improved RELU operator. The method learns from an auxiliary image dataset containing click information to discover the hierarchy of word semantics. Experimental results show that the method achieves higher recognition accuracy, larger compression ratio, and good one-shot learning ability and scalability to unseen categories.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2022)

添加到收藏夹

Article Computer Science, Artificial Intelligence

An accurate and practical algorithm for internet traffic recovery problem

Zhenyu Ming et al.

Summary: A new Sparsity Low-Rank Recovery (SLRR) model and an improved SCB-spADMM algorithm were proposed to recover traffic data quickly and accurately from link-load measurements. By exploiting the properties of traffic data, the problem scale was significantly reduced and the global convergence of the algorithm was established. The method achieved the best accuracy on classic datasets and reached second-level feedback on a large-scale real-life network traffic dataset.

NEUROCOMPUTING (2022)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Efficiently Inferring Top-k Largest Monitoring Data Entries Based on Discrete Tensor Completion

Jiazheng Tian et al.

Summary: This paper addresses the issue of incomplete network monitoring data and proposes a method to infer the top-k largest monitoring data entries using 3-D tensor interpolation. The approach utilizes a discrete tensor completion model with binary codes to reduce storage costs, and introduces three novel techniques to speed up the inference process. Extensive experiments demonstrate that the proposed algorithm achieves similar inference accuracy with significantly smaller time and storage space compared to state-of-the-art tensor completion algorithms.

IEEE-ACM TRANSACTIONS ON NETWORKING (2021)

添加到收藏夹

Article Green & Sustainable Science & Technology

Multilevel Service-Provisioning-Based Autonomous Vehicle Applications

Mashael Khayyat et al.

SUSTAINABILITY (2020)

添加到收藏夹

Article Engineering, Biomedical

ADMM based low-rank and sparse matrix recovery method for sparse photoacoustic microscopy

Ting Liu et al.

BIOMEDICAL SIGNAL PROCESSING AND CONTROL (2019)

添加到收藏夹

Article Computer Science, Software Engineering

An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming

Liang Chen et al.

MATHEMATICAL PROGRAMMING (2017)

添加到收藏夹

Article Computer Science, Software Engineering

A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

Xudong Li et al.

MATHEMATICAL PROGRAMMING (2016)

添加到收藏夹

Article Computer Science, Software Engineering

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

Caihua Chen et al.

MATHEMATICAL PROGRAMMING (2016)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version)

Matthew Roughan et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2012)

添加到收藏夹

Article Computer Science, Software Engineering

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

Zaiwen Wen et al.

MATHEMATICAL PROGRAMMING COMPUTATION (2012)

添加到收藏夹

Article Mathematics, Applied

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

N. Halko et al.

SIAM REVIEW (2011)

添加到收藏夹

Article Mathematics, Applied

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

Benjamin Recht et al.

SIAM REVIEW (2010)

添加到收藏夹

Article Mathematics, Applied

A fast randomized algorithm for the approximation of matrices

Franco Woolfe et al.

APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS (2008)

添加到收藏夹

Article Computer Science, Theory & Methods

Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix

Petros Drineas et al.

SIAM JOURNAL ON COMPUTING (2006)

添加到收藏夹

Article Computer Science, Information Systems

Providing public intradomain traffic matrices to the research community

S Uhlig et al.

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW (2006)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Estimating point-to-point and point-to-multipoint traffic matrices: An information-theoretic approach

Y Zhang et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2005)

添加到收藏夹

Article Engineering, Electrical & Electronic

Optimizing OSPF/IS-IS weights in a changing world

B Fortz et al.

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2002)

添加到收藏夹

Article Mathematics, Applied

Atomic decomposition by basis pursuit

SSB Chen et al.

SIAM REVIEW (2001)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.