Results 21 to 30 of about 2,941,748 (302)
Polynomial and Pseudopolynomial Procedures for Solving Interval Two-Sided (Max, Plus)-Linear Systems
Mathematics, 2021 Max-plus algebra is the similarity of the classical linear algebra with two binary operations, maximum and addition. The notation Ax = Bx, where A, B are given (interval) matrices, represents (interval) two-sided (max, plus)-linear system.
Helena Myšková, Ján Plavka
doaj +1 more source
Interval-valued Matrix Factorization with Applications [PDF]
2010 IEEE International Conference on Data Mining, 2010 In this paper, we propose the Interval-valued Matrix Factorization (IMF) framework. Matrix Factorization (MF) is a fundamental building block of data mining. MF techniques, such as Nonnegative Matrix Factorization (NMF) and Probabilistic Matrix Factorization (PMF), are widely used in applications of data mining. For example, NMF has shown its advantage
Zhiyong Shen +3 more
openaire +2 more sources
Enclosures for the solution set of parametric interval linear systems
International Journal of Applied Mathematics and Computer Science, 2012 We investigate parametric interval linear systems of equations. The main result is a generalization of the Bauer–Skeel and the Hansen–Bliek–Rohn bounds for this case, comparing and refinement of both.
Hladík Milan
doaj +1 more source
The Flow Matrix Offers a Straightforward Alternative to the Problematic Markov Matrix
Land, 2023 The Flow matrix is a novel method to describe and extrapolate transitions among categories. The Flow matrix extrapolates a constant transition size per unit of time on a time continuum with a maximum of one incident per observation during the ...
Jessica Strzempko +1 more
doaj +1 more source
matrix-toolbox/CHM_CATALOG: v2.2.0
, 2023 Sinkhorn matrices, symmetric and Hermitian ...
matrix-toolbox
core +1 more source
Robustness of Interval Monge Matrices in Fuzzy Algebra
Mathematics, 2020 Max–min algebra (called also fuzzy algebra) is an extremal algebra with operations maximum and minimum. In this paper, we study the robustness of Monge matrices with inexact data over max–min algebra.
Máté Hireš +2 more
doaj +1 more source
Complexity issues for the symmetric interval eigenvalue problem
Open Mathematics, 2014 We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with
Hladík Milan
doaj +1 more source
Improved Method of Interval valued neutrosophic matrix composition and Its Application in Medical Diagnosis [PDF]
Neutrosophic Sets and SystemsNeutrosophic sets are an important branch of topology that addresses issues with inconsistent, indeterminate, and uncertain situations in everyday life.
S. Sathiya, A. Puspalatha
doaj +1 more source