Results 11 to 20 of about 302,520 (264)
A Nonconvex Method to Low-Rank Matrix Completion
IEEE Access, 2022 In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications.
Haizhen He +3 more
doaj +1 more source
Semiring Rank Matrix Factorization [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2017 Rank data, in which each row is a complete or partial ranking of available items (columns), is ubiquitous. Among others, it can be used to represent preferences of users, levels of gene expression, and outcomes of sports events. It can have many types of patterns, among which consistent rankings of a subset of the items in multiple rows, and multiple ...
Thanh Le Van +3 more
openaire +4 more sources
Rank Matrix Factorisation [PDF]
, 2015 We introduce the problem of rank matrix factorisation (RMF). That is, we consider the decomposition of a rank matrix, in which each row is a (partial or complete) ranking of all columns. Rank matrices naturally appear in many applications of interest, such as sports competitions.
Le Van, Thanh +3 more
openaire +2 more sources
On the Complexity of Matrix Rank and Rigidity [PDF]
Theory of Computing Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meena Mahajan, Jayalal Sarma
openaire +1 more source
Asymmetric Truncated Hankel Operators: Rank One, Matrix Representation
Journal of Function Spaces, 2021 Asymmetric truncated Hankel operators are the natural generalization of truncated Hankel operators. In this paper, we determine all rank one operators of this class.
Firdaws Rahmani, Yufeng Lu, Ran Li
doaj +1 more source
Rank-GCN for Robust Action Recognition
IEEE Access, 2022 We present a robust skeleton-based action recognition method with graph convolutional network (GCN) that uses the new adjacency matrix, called Rank-GCN. In Rank-GCN, the biggest change from previous approaches is how the adjacency matrix is generated to ...
Haetsal Lee +3 more
doaj +1 more source
Theoretical Computer Science, 2006 The authors consider the problem for maintaining information about the rank of a matrix under changes of the entries. For \(n \times n\) matrices, an upper bound of \(O(n^{1.575})\) arithmetic operations and a lower bound of \(O(n)\) arithmetic operations per element change are derived.
Frandsen, Gudmund Skovbjerg +1 more
openaire +3 more sources
An Insight to Estimated Item Response Matrix in Item Response Theory
IEEE Access, 2023 This paper investigates the performance of item response theory based on distance criteria rather than likelihood criteria. For this purpose, the estimated item response matrix is introduced.
Hideo Hirose
doaj +1 more source
Compound Damages Detection for Rotors by the Coupled Piezoelectric Impedance
IEEE Access, 2018 The rotor is a key component of rotating machinery, thus it is of great importance to quantitatively detect its damage. Since the sensitivity matrix in the impedance-based rotor damage identification model with a single piezoelectric transducer has lower
Yongfang Mao, Yi Qin, Aibing Zhang
doaj +1 more source
Linear Operators That Preserve Arctic Ranks of Boolean Matrices
Mathematics, 2021 We study some properties of arctic rank of Boolean matrices. We compare the arctic rank with Boolean rank and term rank of a given Boolean matrix. Furthermore, we obtain some characterizations of linear operators that preserve arctic rank on Boolean ...
Kyung-Tae Kang, Seok-Zun Song
doaj +1 more source