Number of found documents: 1654
Published from to

Assessment of Independent EEG Components Obtained by Different Methods for BCI Based on Motor Imagery
Húsek, Dušan; Frolov, A. A.; Kerechanin, J. V.; Bobrov, P.D.
2021 - English
Eight methods of decomposition of a multichannel EEG signal are compared in terms of their ability to identify the most physiologically significant components. The criterion for the meaningfulness of a method is its ability to reduce mutual information between components; to create components that can be attributed to the activity of dipoles located in the cerebral cortex; find components that are provided by other methods and for this case; and at the same time, these components should most contribute to the accuracy of the BCI based on imaginary movement. Independent component analysis methods AMICA, RUNICA and FASTICA outperform others in the first three criteria and are second only to the Common Spatial Patterns method in the fourth criterion. The components created by all methods for 386 experimental sessions of 27 subjects were combined into more than 100 clusters containing more than 10 elements. Additionally, the components of the 12 largest clusters were analyzed. They have proven to be of great importance in controlling BCI, their origins can be modeled using dipoles in the brain, and they have been detected by several degradation methods. Five of the 12 selected components have been identified and described in our previous articles. Even if the physiological and functional origins of the rest of identified components’ are to be the subject of further research, we have shown that their physiological nature is at least highly probable.\n Keywords: brain–computer interface; motor imagery; blind source separation; independent component analysis; common spatial patterns; cluster analysis; EEG pattern extraction; EEG analysis; ICA; CSP; BCI; motor imagery Available at various institutes of the ASCR
Assessment of Independent EEG Components Obtained by Different Methods for BCI Based on Motor Imagery

Eight methods of decomposition of a multichannel EEG signal are compared in terms of their ability to identify the most physiologically significant components. The criterion for the meaningfulness of ...

Húsek, Dušan; Frolov, A. A.; Kerechanin, J. V.; Bobrov, P.D.
Ústav informatiky, 2021

Application Of Implicitly Weighted Regression Quantiles: Analysis Of The 2018 Czech Presidential Election
Kalina, Jan; Vidnerová, Petra
2021 - English
Regression quantiles can be characterized as popular tools for a complex modeling of a continuous response variable conditioning on one or more given independent variables. Because they are however vulnerable to leverage points in the regression model, an alternative approach denoted as implicitly weighted regression quantiles have been proposed. The aim of current work is to apply them to the results of the second round of the 2018 presidential election in the Czech Republic. The election results are modeled as a response of 4 demographic or economic predictors over the 77 Czech counties. The analysis represents the first application of the implicitly weighted regression quantiles to data with more than one regressor. The results reveal the implicitly weighted regression quantiles to be indeed more robust with respect to leverage points compared to standard regression quantiles. If however the model does not contain leverage points, both versions of the regression quantiles yield very similar results. Thus, the election dataset serves here as an illustration of the usefulness of the implicitly weighted regression quantiles. Keywords: linear regression; quantile regression; robustness; outliers; elections results Fulltext is available at external website.
Application Of Implicitly Weighted Regression Quantiles: Analysis Of The 2018 Czech Presidential Election

Regression quantiles can be characterized as popular tools for a complex modeling of a continuous response variable conditioning on one or more given independent variables. Because they are however ...

Kalina, Jan; Vidnerová, Petra
Ústav informatiky, 2021

Nearly All Reals Can Be Sorted with Linear Time Complexity
Jiřina, Marcel
2021 - English
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain at the same place in the memory (in place sorting). In this case, the space complexity of the new variant of the algorithm is the same as the complexity of the quicksort. We also quantify the practical limits for possible sorting reals in a linear time. This possibility is assured under additional assumptions on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. A new, faster version of the algorithm is attached. Keywords: sorting; algorithm; real sorting key; time complexity; linear complexity Available in digital repository of the ASCR
Nearly All Reals Can Be Sorted with Linear Time Complexity

We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain ...

Jiřina, Marcel
Ústav informatiky, 2021

Multifractal approaches in econometrics and fractal-inspired robust regression
Kalina, Jan
2021 - English
While the mainstream economic theory is based on the concept of general economic equilibrium, the economies throughout the world have recently been facing serious transformations and challenges. Thus, instead of a convergence to equilibrium, the economies can be regarded as unstable, turbulent or chaotic with properties characteristic for fractal or multifractal processes. This paper starts with a discussion of recent data analysis tools inspired by fractal or multifractal concepts. We pay special attention to available data analysis tools based on reciprocal weights assigned to individual observations - these are inspired by an assumed fractal structure of multivariate data. As an extension, we consider here a novel version of the least weighted squares estimator of parameters for the linear regression model, which exploits reciprocal weights. Finally, we perform a statistical analysis of 31 datasets with economic motivation and compare the performance of the least weighted squares estimator with various weights. It turns out that the reciprocal weights, inspired by the fractal theory, are not superior to other choices of weights. In fact, the best prediction results are obtained with trimmed linear weights. Keywords: chaos in economics; fractal market hypothesis; reciprocal weights; robust regression; prediction Available in digital repository of the ASCR
Multifractal approaches in econometrics and fractal-inspired robust regression

While the mainstream economic theory is based on the concept of general economic equilibrium, the economies throughout the world have recently been facing serious transformations and challenges. Thus, ...

Kalina, Jan
Ústav informatiky, 2021

On kernel-based nonlinear regression estimation
Kalina, Jan; Vidnerová, Petra
2021 - English
This paper is devoted to two important kernel-based tools of nonlinear regression: the Nadaraya-Watson estimator, which can be characterized as a successful statistical method in various econometric applications, and regularization networks, which represent machine learning tools very rarely used in econometric modeling. This paper recalls both approaches and describes their common features as well as differences. For the Nadaraya-Watson estimator, we explain its connection to the conditional expectation of the response variable. Our main contribution is numerical analysis of suitable data with an economic motivation and a comparison of the two nonlinear regression tools. Our computations reveal some tools for the Nadaraya-Watson in R software to be unreliable, others not prepared for a routine usage. On the other hand, the regression modeling by means of regularization networks is much simpler and also turns out to be more reliable in our examples. These also bring unique evidence revealing the need for a careful choice of the parameters of regularization networks Keywords: nonlinear regression; machine learning; kernel smoothing; regularization; regularization networks Available in digital repository of the ASCR
On kernel-based nonlinear regression estimation

This paper is devoted to two important kernel-based tools of nonlinear regression: the Nadaraya-Watson estimator, which can be characterized as a successful statistical method in various econometric ...

Kalina, Jan; Vidnerová, Petra
Ústav informatiky, 2021

Visual Images Segmentation based on Uniform Textures Extraction
Goltsev, A.; Gritsenko, V.; Húsek, Dušan
2020 - English
A new effective procedure for partial texture segmentation of visual images is proposed. The procedure segments any input image into a number of non-overlapping homogeneous ne-grained texture areas. The main advantages of the proposed procedure are as follows. It is completely unsupervised, that is, it processes the input image without any prior knowledge of either the type of textures or the number of texture segments in the image. In addition, the procedure segments arbitrary images of all types. This means that no changes to the procedure parameters are required to switch from one image type to another. Another major advantage of the procedure is that in most cases it extracts the uniform ne-grained texture segments present in the image, just as humans do. This result is supported by series of experiments that demonstrate the ability of the procedure to delineate uniform ne-grained texture segments over a wide range of images. At a minimum, image processing according to the proposed technique leads to a signficant reduction in the uncertainty of the internal structure of the analyzed image. Keywords: Texture feature; Texture window; Homogeneous ne-grained texture segment; Texture segment extraction; Texture segmentation Available at various institutes of the ASCR
Visual Images Segmentation based on Uniform Textures Extraction

A new effective procedure for partial texture segmentation of visual images is proposed. The procedure segments any input image into a number of non-overlapping homogeneous ne-grained texture areas. ...

Goltsev, A.; Gritsenko, V.; Húsek, Dušan
Ústav informatiky, 2020

Least Weighted Absolute Value Estimator with an Application to Investment Data
Vidnerová, Petra; Kalina, Jan
2020 - English
While linear regression represents the most fundamental model in current econometrics, the least squares (LS) estimator of its parameters is notoriously known to be vulnerable to the presence of outlying measurements (outliers) in the data. The class of M-estimators, thoroughly investigated since the groundbreaking work by Huber in 1960s, belongs to the classical robust estimation methodology (Jurečková et al., 2019). M-estimators are nevertheless not robust with respect to leverage points, which are defined as values outlying on the horizontal axis (i.e. outlying in one or more regressors). The least trimmed squares estimator seems therefore a more suitable highly robust method, i.e. with a high breakdown point (Rousseeuw & Leroy, 1987). Its version with weights implicitly assigned to individual observations, denoted as the least weighted squares estimator, was proposed and investigated in Víšek (2011). A trimmed estimator based on the 𝐿1-norm is available as the least trimmed absolute value estimator (Hawkins & Olive, 1999), which has not however acquired attention of practical econometricians. Moreover, to the best of our knowledge, its version with weights implicitly assigned to individual observations seems to be still lacking. Keywords: robust regression; regression median; implicit weighting; computational aspects; nonparametric bootstrap Fulltext is available at external website.
Least Weighted Absolute Value Estimator with an Application to Investment Data

While linear regression represents the most fundamental model in current econometrics, the least squares (LS) estimator of its parameters is notoriously known to be vulnerable to the presence of ...

Vidnerová, Petra; Kalina, Jan
Ústav informatiky, 2020

On the Effect of Human Resources on Tourist Infrastructure: New Ideas on Heteroscedastic Modeling Using Regression Quantiles
Kalina, Jan; Janáček, Patrik
2020 - English
Tourism represents an important sector of the economy in many countries around the world. In this work, we are interested in the effect of the Human Resources and Labor Market pillar of the Travel and Tourism Competitiveness Index on tourist service infrastructure across 141 countries of the world. A regression analysis requires to handle heteroscedasticity in these data, which is not an uncommon situation in various available human capital studies. Our first task is focused on testing significance of individual variables in the model. It is illustrated here that significance tests are influenced by heteroscedasticity, which remains true also for tests for regression quantiles or robust regression estimators, resistant to a possible contamination of data by outliers. Only if a suitable model is considered, which takes heteroscedasticity into account, the effect of the Human Resources and Labor Market pillar turns out to be significant. Further, we propose and present a new diagnostic tool denoted as aquintile plot, allowing to interpret immediately the heteroscedastic structure of the linear regression model for possibly contaminated data. Keywords: tourism infrastructure; human resources; regression; robustness; regression quantiles Fulltext is available at external website.
On the Effect of Human Resources on Tourist Infrastructure: New Ideas on Heteroscedastic Modeling Using Regression Quantiles

Tourism represents an important sector of the economy in many countries around the world. In this work, we are interested in the effect of the Human Resources and Labor Market pillar of the Travel and ...

Kalina, Jan; Janáček, Patrik
Ústav informatiky, 2020

Two limited-memory optimization methods with minimum violation of the previous quasi-Newton equations
Vlček, Jan; Lukšan, Ladislav
2020 - English
Limited-memory variable metric methods based on the well-known BFGS update are widely used for large scale optimization. The block version of the BFGS update, derived by Schnabel (1983), Hu and Storey (1991) and Vlček and Lukšan (2019), satisfies the quasi-Newton equations with all used difference vectors and for quadratic objective functions gives the best improvement of convergence in some sense, but the corresponding direction vectors are not descent directions generally. To guarantee the descent property of direction vectors and simultaneously violate the quasi-Newton equations as little as possible in some sense, two methods based on the block BFGS update are proposed. They can be advantageously combined with methods based on vector corrections for conjugacy (Vlček and Lukšan, 2015). Global convergence of the proposed algorithm is established for convex and sufficiently smooth functions. Numerical experiments demonstrate the efficiency of the new methods. Keywords: unconstrained minimization; variable metric methods; limited-memory methods; variationally derived methods; global convergence; numerical results Available in a digital repository NRGL
Two limited-memory optimization methods with minimum violation of the previous quasi-Newton equations

Limited-memory variable metric methods based on the well-known BFGS update are widely used for large scale optimization. The block version of the BFGS update, derived by Schnabel (1983), Hu and Storey ...

Vlček, Jan; Lukšan, Ladislav
Ústav informatiky, 2020

Linear-time Algorithms for Largest Inscribed Quadrilateral
Keikha, Vahideh
2020 - English
Let P be a convex polygon of n vertices. We present a linear-time algorithm for the problem of computing the largest-area inscribed quadrilateral of P. We also design the parallel version of the algorithm with O(log n) time and O(n) work in CREW PRAM model, which is quite work optimal. Our parallel algorithm also computes all the antipodal pairs of a convex polygon with O(log n) time and O(log2n+s) work, where s is the number of antipodal pairs, that we hope is of independent interest. We also discuss several approximation algorithms (both constant factor and approximation scheme) for computing the largest-inscribed k-gons for constant values of k, in both area and perimeter measures. Keywords: Maximum-area quadrilateral; extreme area k-gon Available in a digital repository NRGL
Linear-time Algorithms for Largest Inscribed Quadrilateral

Let P be a convex polygon of n vertices. We present a linear-time algorithm for the problem of computing the largest-area inscribed quadrilateral of P. We also design the parallel version of the ...

Keikha, Vahideh
Ústav informatiky, 2020

About project

NRGL provides central access to information on grey literature produced in the Czech Republic in the fields of science, research and education. You can find more information about grey literature and NRGL at service web

Send your suggestions and comments to nusl@techlib.cz

Provider

http://www.techlib.cz

Facebook

Other bases