Sökning: "generalized singular value decomposition"
Visar resultat 1 - 5 av 8 avhandlingar innehållade orden generalized 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. Principal Word Vectors
Sammanfattning : Word embedding is a technique for associating the words of a language with real-valued vectors, enabling us to use algebraic methods to reason about their semantic and grammatical properties. This thesis introduces a word embedding method called principal word embedding, which makes use of principal component analysis (PCA) to train a set of word embeddings for words of a language. LÄS MER
4. Algorithms in data mining using matrix and tensor methods
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
5. Statistical methods for biomarker discovery in proteomics
Sammanfattning : Surface-Enhanced Laser Desorption and Ionization (SELDI) is a promising proteomic technique for discovering biomarkers. However, the pre-processing of the raw data is still problematic. LÄS MER