Sökning: "Singular Value Decomposition"

Visar resultat 1 - 5 av 31 avhandlingar innehållade orden Singular Value Decomposition.

  1. 1. Generalized Hebbian Algorithm for Dimensionality Reduction in Natural Language Processing

    Detta är en avhandling från Institutionen för datavetenskap

    Författare :Genevieve Gorrell; Arne Jönsson; Robin Cooper; Alexander Rudnicky; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Generalized Hebbian Algorithm; Language Modelling; Singular Value Decomposition; Eigen Decomposition; Latent Semantic Analysis; Vector Space Models; HUMANITIES and RELIGION Languages and linguistics Linguistic subjects Computational linguistics; HUMANIORA och RELIGIONSVETENSKAP Språkvetenskap Lingvistikämnen Datorlingvistik;

    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. 2. Bilinear Regression and Second Order Calibration

    Detta är en avhandling från Stockholm : Stockholm University

    Författare :Marie Linder; Pieter Kroonenberg; [1999]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; chemometrics; calibration; multivariate; hyphenated methods; matrix data; bilinear model; least squares; singular value decomposition; generalized rank annihilation; trilinear decomposition; parallel factor analysis; principal components regression; partial least squares; prediction; matematisk statistik; Mathematical Statistics;

    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. 3. Information retrieval using the singular value decomposition and Krylov subspaces

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :Katarina Blom; Göteborgs universitet.; Gothenburg University.; [1999]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  4. 4. Subspace Computations via Matrix Decompositions and Geometric Optimization

    Detta är en avhandling från Matematiska institutionen

    Författare :Lennart Simonsson; Axel Ruhe; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Numerical Analysis; Rank-revealing UTV; Jacobi-Davidson algorithm; Decomposition; Grassmann type algorithms; MATHEMATICS Applied mathematics Numerical analysis; MATEMATIK Tillämpad matematik Numerisk analys;

    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

  5. 5. Computation of Parameters in some Mathematical Models

    Detta är en avhandling från Matematiska institutionen

    Författare :Gunilla Wikström; [2002]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; inverse problems; parameter estimation; systems of ordinary differential equations; short-cut methods; separable nonlinear least squares problems; Matlab toolbox for nonlinear least squares ; linear systems of equations; pseudoinverse solution; perturbation theory; singular value decomposition; experimental error analysis; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Sammanfattning : In computational science it is common to describe dynamic systems by mathematical models in forms of differential or integral equations. These models may contain parameters that have to be computed for the model to be complete. LÄS MER