Results 21 to 30 of about 42,601 (304)
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
The P_0-matrix completion problem
The Electronic Journal of Linear Algebra, 2002 A partial matrix is a rectangular array in which some entries are specified while others are free to be chosen. A completion of a partial matrix is a specific choice of values for the unspecified entries. A pattern for \(n \times n\) matrices is a list of positions of the matrix. An \(n \times n\) matrix is called a \(P_0\)-matrix (respectively, a \(P\)
Choi, Ji Young +4 more
openaire +4 more sources
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
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
A semismooth newton method for the nearest Euclidean distance matrix problem [PDF]
, 2013 The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter ...
Qi, Houduo
core +1 more source
The (weakly) sign symmetric P-matrix completion problems [PDF]
, 2003 In this paper it is shown that a partial sign symmetric P-matrix, whose digraph of specified entries is a symmetric n-cycle with n ≥ 6, can be completed to a sign symmetric P-matrix.
Hardy, Timothy L. +5 more
core +2 more sources
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
Directional clustering through matrix factorization [PDF]
, 2016 This paper deals with a clustering problem where feature vectors are clustered depending on the angle between feature vectors, that is, feature vectors are grouped together if they point roughly in the same direction.
Blumensath, Thomas
core +1 more source
Tensor factorization based method for low rank matrix completion and its application on tensor completion [PDF]
, 2022 Low rank matrix and tensor completion problems are to recover the incomplete two and higher order data by using their low rank structures. The essential problem in the matrix and tensor completion problems is how to improve the efficiency.
Yu, Quan, Zhang, Xinzhen
core +2 more sources
Matrix Completion Problems for the Positiveness and Contraction Through Graphs [PDF]
, 2023 In this work, we study contractive and positive real matrix completion problems which are motivated in part by studies on sparce (or dense) matrices for weighted sparse recovery problems and rating matrices with rating density in recommender systems ...
Christopher, Louis C.
core +1 more source