Results 41 to 50 of about 9,160 (266)
Novel Algorithms Based on Majorization Minimization for Nonnegative Matrix Factorization
Matrix decomposition is ubiquitous and has applications in various fields like speech processing, data mining and image processing to name a few. Under matrix decomposition, nonnegative matrix factorization is used to decompose a nonnegative matrix into ...
R. Jyothi, Prabhu Babu, Rajendar Bahl
doaj +1 more source
Factorization of generalized γ-generating matrices [PDF]
The class of \(\gamma\)-generating matrices and its subclasses of regular and singular \(\gamma\)-generating matrices were introduced in [\textit{D. Z. Arov}, J. Sov. Math. 52, No. 6, 3487--3491 (1990; Zbl 0718.41004); translation from Teor. Funkts., Funkts. Anal. Prilozh.
openaire +3 more sources
Using Dynamic Multi-Task Non-Negative Matrix Factorization to Detect the Evolution of User Preferences in Collaborative Filtering. [PDF]
Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about
Bin Ju +4 more
doaj +1 more source
Pentadiagonal Companion Matrices
The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally ...
Eastman Brydon, Vander Meulen Kevin N.
doaj +1 more source
Arf numerical semigroups with high multiplicity via Gröbner basis
In this paper, Arf numerical semigroups with high multiplicity are given. RF (Row Factorization)-matrices, Gröbner basis are presented by writing the ideals of numerical semigroup with RF-matrices.
Belgin Özer
doaj +1 more source
Factorizations of Matrices over Projective-free Rings [PDF]
An element of a ring R is called strongly J#-clean provided that it can be written as the sum of an idempotent and an element in J#(R) that commute. In this paper, we characterize the strong J#-cleanness of matrices over projective-free rings. This extends many known results on strongly clean matrices over commutative local rings.
Chen H., Kose H., Kurtulmaz, Y.
openaire +7 more sources
Factorization of Delannoy matrices
Summary: The Delannoy matrices are factorized with Pascal matrices, which easily results in the Cholesky decomposition and the inverse of such matrices. The determinants of Delannoy matrices are connected with triangular numbers. Finally, a factorization of Delannoy matrices with Hypercube matrices and Pascal matrices is given.
openaire +2 more sources
Elementary triangular matrices and inverses of k-Hessenberg and triangular matrices
We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict k-Hessenberg matrices and banded matrices. Our results can
Verde-Star Luis
doaj +1 more source
Differential expansion for antiparallel triple pretzels: the way the factorization is deformed
For a peculiar family of double braid knots there is a remarkable factorization formula for the coefficients of the differential (cyclotomic) expansion (DE), which nowadays is widely used to construct the exclusive Racah matrices S and $${\bar{S}}$$ S ...
A. Morozov, N. Tselousov
doaj +1 more source
Calculating and predicting drug-target interactions (DTIs) is a crucial step in the field of novel drug discovery. Nowadays, many models have improved the prediction performance of DTIs by fusing heterogeneous information, such as drug chemical structure
Jiacheng Sun +14 more
doaj +1 more source

