Results 241 to 250 of about 64,813 (288)
Some of the next articles are maybe not open access.
Pseudo-inverse Locality Preserving Projections
2009 International Conference on Computational Intelligence and Security, 2009This paper proposes a novel algorithm, named Pseudo-inverse Locality Preserving Projections (PLPP), for dimensionality reduction involving undersampled problems. This algorithm considers the matrix singularity caused by undersampled problems by substituting the Moore-Penrose pseudo-inverse for the inverse of the matrix.
Rong-Hua Li, Zhiping Luo, Guoqiang Han
openaire +1 more source
Mathematical Proceedings of the Cambridge Philosophical Society, 1961
Drazin (2) has recently introduced the concept of a pseudo-invertible element of an associative ring or semigroup. In this note we first show that such an element of a semigroup S may be characterized by the fact that some power of it lies in a subgroup of S.
openaire +2 more sources
Drazin (2) has recently introduced the concept of a pseudo-invertible element of an associative ring or semigroup. In this note we first show that such an element of a semigroup S may be characterized by the fact that some power of it lies in a subgroup of S.
openaire +2 more sources
The Pseudo-Inverse of a Product
SIAM Journal on Applied Mathematics, 1973Let A and B be bounded linear operators on a complex Hilbert space H, such that the range of each is a closed subspace of H. The following three conditions are necessary and sufficient for the pseudo-inverse of $AB$to be the pseudo-inverse of A followed by the pseudo-inverse of B : (i) the range of $AB$ must be closed; (ii) the range of $A^ * $ must be
openaire +2 more sources
Pseudo-inversion on Formal Languages
2014We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudo-inversion of a string w = uxv to consist of all strings v R xu R , where uv ≠ λ and consider the operation from a formal language theoretic viewpoint.
Da-Jung Cho +5 more
openaire +1 more source
Displacement rank of pseudo-inverses
[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992The concept of displacement rank can be defined in a general framework, and turns out to be a useful tool for revealing hidden structures in matrices. When a n*n matrix is structured, it can be described by O(n) parameters. Manipulations of linear systems can then be carried out with much less storage and computational requirements.
openaire +1 more source
Perturbation theory for pseudo-inverses
BIT, 1973A perturbation theory for pseudo-inverses is developed. The theory is based on a useful decomposition (theorem 2.1) ofB + -A + whereB andA arem ×n matrices. Sharp estimates of ∥B + -A +∥ are derived for unitary invariant norms whenA andB are of the same rank and ∥B -A∥ is small.
openaire +1 more source
Pseudo-inversion: closure properties and decidability
Natural Computing, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cho, Da-Jung +5 more
openaire +1 more source
Pseudo-inverse filtering of IVUS images
IEE Proceedings - Science, Measurement and Technology, 1998The resolution of medical ultrasound systems can be improved using filtering techniques. The authors present a filter for improving the axial resolution that approximates to an inverse filter, but which is less sensitive to noise than a standard inverse filter.
W.F. Young, S. McLaughlin
openaire +1 more source
Pseudo-inverse locality preserving iterative hashing
2017 International Conference on Progress in Informatics and Computing (PIC), 2017Hashing learning has attracted increasing attention these years with the rapid increase of data. Some high-dimensional data have caused the ‘dimension disaster’ which make traditional methods ineffective. In this paper, we propose a method to find the nearest neighbor quickly from the high-dimensional data, named pseudo-inverse locality preserving ...
Zhongshu Du, Yongli Wang, Huacheng Sun
openaire +1 more source
Modified pseudo-inverse neural networks storing correlated patterns
Journal of Physics A: Mathematical and General, 1992Summary: Neural networks with symmetric couplings which have an intermediate form between the Hebb learning rule and the pseudo-inverse one, storing strongly correlated patterns, are studied. Signal-to-noise analysis is made and replica-symmetric thermodynamic calculations are performed. Both approaches show that both in the Hopfield model limit and in
R. Der +2 more
openaire +2 more sources