Results 21 to 30 of about 435,592 (297)
The Q0-matrix completion problem [PDF]
Arab Journal of Mathematical Sciences, 2020 A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and Q0-matrix completion problem. Finally, a classification of the digraphs of order up to four is done
openaire +2 more sources
Connection Science, 2023 Traffic matrices (TMs) are essential for managing networks. Getting the whole TMs is difficult because of the high measurement cost. Several recent studies propose sparse measurement schemes to reduce the cost, which involve taking measurements on only a
Kai Jin +4 more
doaj +1 more source
Linear Algebra and its Applications, 2003 An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph.
Araújo, C. Mendes +2 more
openaire +3 more sources
Nonconvex matrix completion with Nesterov’s acceleration
Big Data Analytics, 2018 Background In matrix completion fields, the traditional convex regularization may fall short of delivering reliable low-rank estimators with good prediction performance. Previous works use the alternation least squares algorithm to optimize the nonconvex
Xiao-Bo Jin +4 more
doaj +1 more source
E-Jurnal Matematika, 2023 Transportation problem is one of the problems that can be solved by using linear programming. Transportation method allow businessmen to minimize distribution costs, increase profits, and also fulfill the consumer needs at the same times.
MIKHA LAYASISA TARIGAN +2 more
doaj +1 more source
Binary Matrix Completion With Nonconvex Regularizers
IEEE Access, 2019 Many practical problems involve the recovery of a binary matrix from partial information, so the binary matrix completion (BMC) technique has increasingly been of interest in machine learning. In particular, we consider a special case of the BMC problems,
Chunsheng Liu, Hong Shan
doaj +1 more source
Image Completion with Hybrid Interpolation in Tensor Representation
Applied Sciences, 2020 The issue of image completion has been developed considerably over the last two decades, and many computational strategies have been proposed to fill-in missing regions in an incomplete image. When the incomplete image contains many small-sized irregular
Rafał Zdunek, Tomasz Sadowski
doaj +1 more source
Matrix Tri-Factorization Over the Tropical Semiring
IEEE Access, 2023 Tropical semiring has proven successful in several research areas, including optimal control, bioinformatics, discrete event systems, and decision problems. Previous studies have applied a matrix two-factorization algorithm based on the tropical semiring
Amra Omanovic, Polona Oblak, Tomaz Curk
doaj +1 more source
Robust low‐rank Hankel matrix recovery for skywave radar slow‐time samples
IET Radar, Sonar & Navigation, 2021 In skywave radar, the slow‐time samples received in a certain range‐azimuth cell are usually processed for signal analysis and target detection. Particularly, to extract the principal components, such as sea clutter and target signal, in slow‐time ...
Baiqiang Zhang, Junhao Xie, Wei Zhou
doaj +1 more source
Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning
AAAI Conference on Artificial Intelligence, 2021 One-bit matrix completion is an important class of positive-unlabeled (PU) learning problems where the observations consist of only positive examples, e.g., in top-N recommender systems.
Chao Chen +4 more
semanticscholar +1 more source