Results 21 to 30 of about 23,208,688 (165)
Randomized Matrix Decompositions Using R
Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data ...
N. Benjamin Erichson +3 more
doaj +1 more source
Investigating the feature extraction capabilities of non-negative matrix factorisation algorithms for black-and-white images [PDF]
Nonnegative matrix factorisation (NMF) is a class of matrix factorisation methods to approximate a nonnegative matrix as a product of two nonnegative matrices.
Liew How Hui +2 more
doaj +1 more source
Diagonal Loading Beamforming Based on Aquila Optimizer
Traditional beamforming algorithms are only applicable to ideal environments. When the array antenna receives data under circumstances of small snapshots or large signal-to-noise ratio(SNR), noise eigenvalues of classic sample matrix inversion(SMI) and ...
Chao Liu, Jiaqi Zhen
doaj +1 more source
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure [PDF]
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube
L Jokar
doaj
Two M-decomposed based identification algorithms are proposed for large-scale systems in this study. Since the least squares algorithms involve matrix inversion calculation, they can be inefficient for large-scale systems whose information matrices are ...
Yuejiang Ji, Lixin Lv
doaj +1 more source
Non-negative Matrix Factorization for Dimensionality Reduction [PDF]
—What matrix factorization methods do is reduce the dimensionality of the data without losing any important information. In this work, we present the Non-negative Matrix Factorization (NMF) method, focusing on its advantages concerning other methods of ...
Olaya Jbari, Otman Chakkor
doaj +1 more source
A new Approach for the Modulus-Based Matrix Splitting Algorithms
We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it.
Wenpeng Wang +3 more
doaj +1 more source
Biased Deep Distance Factorization Algorithm for Top-N Recommendation [PDF]
Since traditional matrix factorization algorithms are mostly based on shallow linear models,it is difficult to learn latent factors of users and items at a deep level.When the dataset is sparse,it is inclined to overfitting.To deal with the problem,this ...
QIAN Meng-wei , GUO Yi
doaj +1 more source
Sequential and Adaptive Learning Algorithms for M-Estimation
The M-estimate of a linear observation model has many important engineering applications such as identifying a linear system under non-Gaussian noise.
Guang Deng
doaj +1 more source
We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of sizes (Formula presented.) respectively, where (Formula presented.) is equal to (Formula presented.).
Lingas, Andrzej, +2 more
core +1 more source

