Search results for "Matrix"
showing 10 items of 3205 documents
Tuning of Extended Kalman Filters for Sensorless Motion Control with Induction Motor
2019
This work deals with the tuning of an Extended Kalman Filter for sensorless control of induction motors for electrical traction in automotive. Assuming that the parameters of the induction motor-load model are known, Genetic Algorithms are used for obtaining the system noise covariance matrix, considering the measurement noise covariance matrix equal to the identity matrix. It is shown that only stator currents have to be acquired for reaching this objective, which is easy to accomplish using Hall-effect transducers. In fact, the Genetic Algorithm minimizes, with respect to the system covariance matrix, a suitable measure of the displacement between the stator currents experimentally acquir…
The impact of sample reduction on PCA-based feature extraction for supervised learning
2006
"The curse of dimensionality" is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimensions. In this paper, different feature extraction (FE) techniques are analyzed as means of dimensionality reduction, and constructive induction with respect to the performance of Naive Bayes classifier. When a data set contains a large number of instances, some sampling approach is applied to address the computational complexity of FE and classification processes. The main goal of this paper is to show the impact of sample reduction on the process of FE for supervised learning. In our study we analyzed the conventional PC…
Projection Clustering Unfolding: A New Algorithm for Clustering Individuals or Items in a Preference Matrix
2020
In the framework of preference rankings, the interest can lie in clustering individuals or items in order to reduce the complexity of the preference space for an easier interpretation of collected data. The last years have seen a remarkable flowering of works about the use of decision tree for clustering preference vectors. As a matter of fact, decision trees are useful and intuitive, but they are very unstable: small perturbations bring big changes. This is the reason why it could be necessary to use more stable procedures in order to clustering ranking data. In this work, a Projection Clustering Unfolding (PCU) algorithm for preference data will be proposed in order to extract useful info…
Group Nonnegative Matrix Factorization with Sparse Regularization in Multi-set Data
2021
Constrained joint analysis of data from multiple sources has received widespread attention for that it allows us to explore potential connections and extract meaningful hidden components. In this paper, we formulate a flexible joint source separation model termed as group nonnegative matrix factorization with sparse regularization (GNMF-SR), which aims to jointly analyze the partially coupled multi-set data. In the GNMF-SR model, common and individual patterns of particular underlying factors can be extracted simultaneously with imposing nonnegative constraint and sparse penalty. Alternating optimization and alternating direction method of multipliers (ADMM) are combined to solve the GNMF-S…
(Approximate) Low-Mode Averaging with a new Multigrid Eigensolver
2015
We present a multigrid based eigensolver for computing low-modes of the Hermitian Wilson Dirac operator. For the non-Hermitian case multigrid methods have already replaced conventional Krylov subspace solvers in many lattice QCD computations. Since the $\gamma_5$-preserving aggregation based interpolation used in our multigrid method is valid for both, the Hermitian and the non-Hermitian case, inversions of very ill-conditioned shifted systems with the Hermitian operator become feasible. This enables the use of multigrid within shift-and-invert type eigensolvers. We show numerical results from our MPI-C implementation of a Rayleigh quotient iteration with multigrid. For state-of-the-art lat…
Feature Dimensionality Reduction for Mammographic Report Classification
2016
The amount and the variety of available medical data coming from multiple and heterogeneous sources can inhibit analysis, manual interpretation, and use of simple data management applications. In this paper a deep overview of the principal algorithms for dimensionality reduction is carried out; moreover, the most effective techniques are applied on a dataset composed of 4461 mammographic reports is presented. The most useful medical terms are converted and represented using a TF-IDF matrix, in order to enable data mining and retrieval tasks. A series of query have been performed on the raw matrix and on the same matrix after the dimensionality reduction obtained using the most useful techni…
A hybrid virtual–boundary element formulation for heterogeneous materials
2021
Abstract In this work, a hybrid formulation based on the conjoined use of the recently developed Virtual Element Method (VEM) and the Boundary Element Method (BEM) is proposed for the effective computational analysis of multi-region domains, representative of heterogeneous materials. VEM has been recently developed as a generalisation of the Finite Element Method (FEM) and it allows the straightforward employment of elements of general polygonal shape, maintaining a high level of accuracy. For its inherent features, it allows the use of meshes of general topology, including non-convex elements. On the other hand, BEM is an effective technique for the numerical solution of sets of boundary i…
Quantitative evaluation of muscle synergy models: a single-trial task decoding approach.
2012
Delis, Ioannis | Berret, Bastien | Pozzo, Thierry | Panzeri, Stefano; International audience; ''Muscle synergies, i.e., invariant coordinated activations of groups of muscles, have been proposed as building blocks that the central nervous system (CNS) uses to construct the patterns of muscle activity utilized for executing movements . Several efficient dimensionality reduction algorithms that extract putative synergies from electromyographic (EMG) signals have been developed. Typically, the quality of synergy decompositions is assessed by computing the Variance Accounted For (VAF). Yet, little is known about the extent to which the combination of those synergies en codes task discriminating…
''Investigating reduction of dimensionality during single-joint elbow movements: a case study on muscle synergies''
2013
Chiovetto, Enrico | Berret, Bastien | Delis, Ioannis | Panzeri, Stefano | Pozzo, Thierry; International audience; ''A long standing hypothesis in the neuroscience community is that the central nervous system (CNS) generates the muscle activities to accomplish movements by combining a relatively small number of stereotyped patterns of muscle activations, often referred to as" muscle synergies." Different definitions of synergies have been given in the literature. The most well-known are those of synchronous, time-varying and temporal muscle synergies. Each one of them is based on a different mathematical model used to factor some EMG array recordings collected during the execution of variety…
The Sliced COO Format for Sparse Matrix-Vector Multiplication on CUDA-enabled GPUs
2012
Abstract Existing formats for Sparse Matrix-Vector Multiplication (SpMV) on the GPU are outperforming their corresponding implementations on multi-core CPUs. In this paper, we present a new format called Sliced COO (SCOO) and an effcient CUDA implementation to perform SpMV on the GPU. While previous work shows experiments on small to medium-sized sparse matrices, we perform evaluations on large sparse matrices. We compared SCOO performance to existing formats of the NVIDIA Cusp library. Our resutls on a Fermi GPU show that SCOO outperforms the COO and CSR format for all tested matrices and the HYB format for all tested unstructured matrices. Furthermore, comparison to a Sandy-Bridge CPU sho…