Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userClassification of EEG recordings in auditory brain activity via a logistic functional linear regression model
101
0
0.0
(
0
)
Added by
Irene Gannaz
Publication date
2014
fields
Mathematical Statistics
and research's language is
English
Authors
Ir`ene Gannaz
Ask ChatGPT about the research
No Arabic abstract
We want to analyse EEG recordings in order to investigate the phonemic categorization at a very early stage of auditory processing. This problem can be modelled by a supervised classification of functional data. Discrimination is explored via a logistic functional linear model, using a wavelet representation of the data. Different procedures are investigated, based on penalized likelihood and principal component reduction or partial least squares reduction.
rate research
Read More
Neuronal morphology is an essential element for brain activity and function. We take advantage of current availability of brain-wide neuron digital reconstructions of the Pyramidal cells from a mouse brain, and analyze several emergent features of brain-wide neuronal morphology. We observe that axonal trees are self-affine while dendritic trees are self-similar. We also show that tree size appear to be random, independent of the number of dendrites within single neurons. Moreover, we consider inhomogeneous branching model which stochastically generates rooted 3-Cayley trees for the brain-wide neuron topology. Based on estimated order-dependent branching probability from actual axonal and dendritic trees, our inhomogeneous model quantitatively captures a number of topological features including size and shape of both axons and dendrites. This sheds lights on a universal mechanism behind the topological formation of brain-wide axonal and dendritic trees.
Biomedical researchers usually study the effects of certain exposures on disease risks among a well-defined population. To achieve this goal, the gold standard is to design a trial with an appropriate sample from that population. Due to the high cost of such trials, usually the sample size collected is limited and is not enough to accurately estimate some exposures effect. In this paper, we discuss how to leverage the information from external `big data (data with much larger sample size) to improve the estimation accuracy at the risk of introducing small bias. We proposed a family of weighted estimators to balance the bias increase and variance reduction when including the big data. We connect our proposed estimator to the established penalized regression estimators. We derive the optimal weights using both second order and higher order asymptotic expansions. Using extensive simulation studies, we showed that the improvement in terms of mean square error (MSE) for the regression coefficient can be substantial even with finite sample sizes and our weighted method outperformed the existing methods such as penalized regression and James Steins approach. Also we provide theoretical guarantee that the proposed estimators will never lead to asymptotic MSE larger than the maximum likelihood estimator using small data only in general. We applied our proposed methods to the Asia Cohort Consortium China cohort data to estimate the relationships between age, BMI, smoking, alcohol use and mortality.
We analyze the complex networks associated with brain electrical activity. Multichannel EEG measurements are first processed to obtain 3D voxel activations using the tomographic algorithm LORETA. Then, the correlation of the current intensity activation between voxel pairs is computed to produce a voxel cross-correlation coefficient matrix. Using several correlation thresholds, the cross-correlation matrix is then transformed into a network connectivity matrix and analyzed. To study a specific example, we selected data from an earlier experiment focusing on the MMN brain wave. The resulting analysis highlights significant differences between the spatial activations associated with Standard and Deviant tones, with interesting physiological implications. When compared to random data networks, physiological networks are more connected, with longer links and shorter path lengths. Furthermore, as compared to the Deviant case, Standard data networks are more connected, with longer links and shorter path lengths--i.e., with a stronger ``small worlds character. The comparison between both networks shows that areas known to be activated in the MMN wave are connected. In particular, the analysis supports the idea that supra-temporal and inferior frontal data work together in the processing of the differences between sounds by highlighting an increased connectivity in the response to a novel sound.
Recently, the well known Liu estimator (Liu, 1993) is attracted researchers attention in regression parameter estimation for an ill conditioned linear model. It is also argued that imposing sub-space hypothesis restriction on parameters improves estimation by shrinking toward non-sample information. Chang (2015) proposed the almost unbiased Liu estimator (AULE) in the binary logistic regression. In this article, some improved unbiased Liu type estimators, namely, restricted AULE, preliminary test AULE, Stein-type shrinkage AULE and its positive part for estimating the regression parameters in the binary logistic regression model are proposed based on the work Chang (2015). The performances of the newly defined estimators are analysed through some numerical results. A real data example is also provided to support the findings.
We consider the setting of online logistic regression and consider the regret with respect to the 2-ball of radius B. It is known (see [Hazan et al., 2014]) that any proper algorithm which has logarithmic regret in the number of samples (denoted n) necessarily suffers an exponential multiplicative constant in B. In this work, we design an efficient improper algorithm that avoids this exponential constant while preserving a logarithmic regret. Indeed, [Foster et al., 2018] showed that the lower bound does not apply to improper algorithms and proposed a strategy based on exponential weights with prohibitive computational complexity. Our new algorithm based on regularized empirical risk minimization with surrogate losses satisfies a regret scaling as O(B log(Bn)) with a per-round time-complexity of order O(d^2).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
