Sökning: "reduced rank regression"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden reduced rank regression.

  1. 1. Algorithms in data mining : reduced rank regression and classification by tensor methods

    Detta är en avhandling från Linköping : Linköpings universitet

    Författare :Berkant Savas; Linköpings universitet.; Linköpings universitet.; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. LÄS MER

  2. 2. Parameter Estimation for Multisensor Signal Processing Reduced Rank Regression, Array Processing and MIMO Communications

    Detta är en avhandling från Stockholm : KTH

    Författare :Karl Werner; KTH.; [2007]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TECHNOLOGY Information technology Signal processing; TEKNIKVETENSKAP Informationsteknik Signalbehandling;

    Sammanfattning : This thesis deals with three estimation problems motivated by spatial signal processing using arrays of sensors. All three problems are approached using tools from estimation theory, including asymptotical analysis of performance and Cramér-Rao lower bound; Monte Carlo methods are used to evaluate small sample performance. LÄS MER

  3. 3. Algorithms in data mining using matrix and tensor methods

    Detta är en avhandling från Matematiska institutionen

    Författare :Berkant Savas; Linköpings universitet.; Linköpings universitet.; [2008]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; MATHEMATICS Applied mathematics Numerical analysis; MATEMATIK Tillämpad matematik Numerisk analys;

    Sammanfattning : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. LÄS MER

  4. 4. Rank Reduction with Convex Constraints

    Detta är en avhandling från Department of Automatic Control, Lund Institute of Technology, Lund University

    Författare :Christian Grussler; Lund University.; Lunds universitet.; [2017]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; low-rank approximation; model reduction; non-convex optimization; Douglas-Rachford; matrix completion; overlapping norm; k-support norm; atomic norm;

    Sammanfattning : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. LÄS MER

  5. 5. On Reduced Rank Linear Regression and Direction Estimation in Unknown Colored Noise Fields

    Detta är en avhandling från Stockholm : KTH

    Författare :Karl Werner; KTH.; [2005]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TECHNOLOGY Information technology Signal processing; TEKNIKVETENSKAP Informationsteknik Signalbehandling;

    Sammanfattning : Two estimation problems are treated in this thesis. Estimators are suggested and the asymptotical properties of the estimates are investigated analytically. Numerical simulations are used to assess small-sample performance. In addition, performance bounds are calculated. LÄS MER