Sökning: "singular value decomposition"
Visar resultat 1 - 5 av 37 avhandlingar innehållade orden singular value decomposition.
1. Generalized Hebbian Algorithm for Dimensionality Reduction in Natural Language Processing
Sammanfattning : The current surge of interest in search and comparison tasks in natural language processing has brought with it a focus on vector space approaches and vector space dimensionality reduction techniques. Presenting data as points in hyperspace provides opportunities to use a variety of welldeveloped tools pertinent to this representation. LÄS MER
2. Bilinear Regression and Second Order Calibration
Sammanfattning : We consider calibration of second-order (or "hyphenated") instruments for chemical analysis. Many such instruments generate bilinear two-way (matrix) type data for each specimen. The bilinear regression model is to be estimated from a number of specimens of known composition. LÄS MER
3. Information retrieval using the singular value decomposition and Krylov subspaces
Sammanfattning : .... LÄS MER
4. Singular Value Computations for Toeplitz Matrices and Subspace Tracking
Sammanfattning : This thesis addresses the problem of computing the largest singular values and corresponding singular vectors of a Toeplitz matrix. These are often requested in signal processing and system identification to extract the signal from the noise. LÄS MER
5. Subspace Computations via Matrix Decompositions and Geometric Optimization
Sammanfattning : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. LÄS MER