fICA : FastICA Algorithms and Their Improved Variants
Miettinen, J., Nordhausen, K., & Taskinen, S. (2018). fICA : FastICA Algorithms and Their Improved Variants. The R Journal, 10(2), 148-158. https://doi.org/10.32614/rj-2018-046
Julkaistu sarjassa
The R JournalPäivämäärä
2018Tekijänoikeudet
© 2019 The Authors
Abstract In independent component analysis (ICA) one searches for mutually independent non gaussian latent variables when the components of the multivariate data are assumed to be linear combinations of them. Arguably, the most popular method to perform ICA is FastICA. There are two classical versions, the deflation-based FastICA where the components are found one by one, and the symmetric FastICA where the components are found simultaneously. These methods have been implemented previously in two R packages, fastICA and ica. We present the R package fICA and compare it to the other packages. Additional features in fICA include optimization of the extraction order in the deflation-based version, possibility to use any nonlinearity function, and improvement to convergence of the deflation-based algorithm. The usage of the package is demonstrated by applying it to the real ECG data of a pregnant woman.
Julkaisija
R Foundation for Statistical ComputingISSN Hae Julkaisufoorumista
2073-4859Asiasanat
Alkuperäislähde
https://journal.r-project.org/archive/2018/RJ-2018-046/RJ-2018-046.pdfJulkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/28869373
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Improving identification algorithms in causal inference
Tikka, Santtu (University of Jyväskylä, 2018)Causal models provide a formal approach to the study of causality. One of the most useful features of causal modeling is that it enables one to make causal claims about a phenomenon using observational data alone under ... -
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
Linja, Joakim; Hämäläinen, Joonas; Nieminen, Paavo; Kärkkäinen, Tommi (MDPI AG, 2020)Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of ... -
Dimension Reduction for Time Series in a Blind Source Separation Context Using R
Nordhausen, Klaus; Matilainen, Markus; Miettinen, Jari; Virta, Joni; Taskinen, Sara (Foundation for Open Access Statistic, 2021)Multivariate time series observations are increasingly common in multiple fields of science but the complex dependencies of such data often translate into intractable models with large number of parameters. An alternative ... -
Algorithmic issues in computational intelligence optimization : from design to implementation, from implementation to design
Caraffini, Fabio (University of Jyväskylä, 2016)The vertiginous technological growth of the last decades has generated a variety of powerful and complex systems. By embedding within modern hardware devices sophisticated software, they allow the solution of complicated ... -
Identifying Counterfactual Queries with the R Package cfid
Tikka, Santtu (Technische Universität Wien, 2023)In the framework of structural causal models, counterfactual queries describe events that concern multiple alternative states of the system under study. Counterfactual queries often take the form of “what if” type questions ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.