On some consistent tests of mutual independence among several random vectors of arbitrary dimensions

Statistics and Computing - Testing for mutual independence among several random vectors is a challenging problem, and in recent years, it has gained significant attention in statistics and machine...     

Robust inference for generalized partially linear mixed models that account for censored responses and missing covariates – an application to Arctic data analysis

In this article, we propose a family of bounded influence robust estimates for the parametric and non-parametric components of a generalized partially linear mixed model that are subject to censored responses and missing covariates. The asymptotic properties of the proposed estimates have been looked into. The estimates are obtained by using Monte Carlo expectation–maximization algorithm. An approximate method which reduces the computational time to a great extent is also proposed. A simulation study shows that performances of the two approaches are similar in terms of bias and mean square error. The analysis is illustrated through a study on the effect of environmental factors on the phytoplankton cell count.     

An MEP.2 plan in 3 factorial experiment and its probability of correct identification

The present work consider the problem of constructing search designs for searching at most two active hidden two-factor interactions in 3ⁿ factorial setup under the assumption that the three-factor and higher-order interactions are negligible. The designs presented here are also capable of estimating all the main effects, general mean and the effects of identified active two-factor interactions. The performance of the designs has been studied in the noisy case by computing probability of correct identification.     

A Method of Finding Predictor Genes for a Particular Disease Using a Clustering Algorithm

Clustering Algorithms are nowadays really important tools in microarray data analysis. The different clustering algorithm generally used in biological science does not take into consideration the underlying probability distribution of the data. In this sense, they are heuristic in nature. In this work we proposed a clustering algorithm based on EM Algorithm. It gives 28% less misclassification than the K-means algorithm (which is mostly use in Bio science). We have also shown on a real data set that this algorithm can be efficiently used for detecting the genes which are responsible for a particular disease.     

Supersaturated designs with high searching probability

A supersaturated design is essentially a fractional factorial design whose number of experimental variables is greater than or equal to its number of experimental runs. Under the effect sparsity assumption, a supersaturated design can be very cost-effective. In this paper, our prime objective is to compare the existing two-level supersaturated designs for the noisy case through the probability of correct searching—a powerful criterion proposed by Shirakura et al. [1996. Searching probabilities for nonzeroeffects in search designs for the noisy case. Ann. Statist. 24, 2560–2568]. An algorithm is proposed to construct supersaturated designs with high probability of correct searching. Examples are given for illustration.