Combining information from related meta-analyses of genetic association studies

Summary.  When synthesizing data from genetic association studies researchers frequently perform several related meta-analyses, perhaps on different polymorphisms of the same gene, or on different outcomes, or they might define subgroups of studies by factors such as ethnicity, gender or study design. Current practice is to perform a totally separate meta-analysis of each set of studies; however, when the meta-analyses investigate related questions, it is possible that the estimates in one meta-analysis could be improved by using information from another. The meta-analytic model for a genetic association study can be parameterized in terms of four meaningful parameters: the size of the genetic effect, the genetic model, the allele frequency in controls and the degree of departure from Hardy–Weinberg equilibrium in controls. Even when the size of the genetic effect differs across meta-analyses, it may be possible to assume that some of the other parameters are common. The models are applied to a meta-analysis of the same gene–disease relationship in three different ethnic groups.     

Dual Objective Segmentation to Improve Targetability: An Evolutionary Algorithm Approach**

Cluster‐based segmentation usually involves two sets of variables: (i) the needs‐based variables (referred to as the bases variables), which are used in developing the original segments to identify the value, and (ii) the classification or background variables, which are used to profile or target the customers. The managers’ goal is to utilize these two sets of variables in the most efficient manner. Pragmatic managerial interests recognize the underlying need to start shifting from methodologies that obtain highly precise value‐based segments but may be of limited practical use as they provide less targetable segments. Consequently, the imperative is to shift toward newer segmentation approaches that provide greater focus on targetable segments while maintaining homogeneity. This requires dual objective segmentation, which is a combinatorially difficult problem. Hence, we propose and examine a new evolutionary methodology based on genetic algorithms to address this problem. We show, based on a large‐scale Monte Carlo simulation and a case study, that the proposed approach consistently outperforms the existing methods for a wide variety of problem instances. We are able to obtain statistically significant and managerially important improvements in targetability with little diminution in the identifiability of value‐based segments. Moreover, the proposed methodology provides a set of good solutions, unlike existing methodologies that provide a single solution. We also show how these good solutions can be used to plot an efficient Pareto frontier. Finally, we present useful insights that would help managers in implementing the proposed solution approach effectively.     

Sample size algorithm for randomized response model with dichotomized response

The sample size calculation plays an important role in many areas, particularly for applications in the biomedical and social sciences. Large-sample size is wasting of time and resources. Small-sample provides unreliable answer. In the literature, the aim of sample size calculation is to either detecting the difference among groups statistically or assessing the precision of estimate. Other than these two main goals of sample size determination, the objective of this article is to provide the sample size formulae for randomized/nonrandomized response models such that the estimates of sensitive probabilities falling inside the normal interval [0, 1] are guaranteed under a certain confidence. The sample size algorithm is introduced because of no closed form solution for sample size. A higher confidence probability, a greater sample size should be included into the study. Vice versa, larger sample sizes generally lead to increase the chance of the estimated probability falling in [0, 1]. An example is given to illustrate the use of the proposed algorithm.     

Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona

Reverse logistics problems arising in municipal waste management are both wide-ranging and varied. The usual collection system in UE countries is composed of two phases. First, citizens leave their refuse at special collection areas where different types of waste (glass, paper, plastic, organic material) are stored in special refuse bins. Subsequently, each type of waste is collected separately and moved to its final destination (a recycling plant or refuse dump). The present study focuses on the problem of locating these collection areas. We establish the relationship between the problem, the set covering problem and the MAX-SAT problem and then go on to develop a genetic algorithm and a GRASP heuristic to, respectively, solve each formulation. Finally, the quality of the algorithms is tested in a computational experience with real instances from the metropolitan area of Barcelona, as well as a reduced set of set covering instances from the literature.     

A SEQUENTIAL METHOD OF CONSTRUCTING OPTIMAL BLOCK DESIGNS

An algorithm for the construction of a wide class of block designs including Balanced Incomplete Blocks (BIB) is described. The algorithm which allows the experimenter to give weights for a set of treatment contrasts uses an initial starting design to generate an optimal block design sequentially. The performance of the algorithm is illustrated by examples, and designs constructed by the algorithm compare favourably with designs generated by other methods.     

旅行商问题的一个精确算法

本文对经典的旅行商问题给出一种精确式算法,计算结果表明,它具有一定的优越性和实用性。     

高维数据的稳健二分类方法

对于实证研究中经常遇到变量维数高和存在异常值的二分类问题,探索稳健的高维二分类方法显得尤为重要。本文提出基于Lasso惩罚的光滑0-1损失函数二分类法,并利用Fabs 算法高效地解决了变量选择和参数估计问题。数值模拟的结果表明,在不同异常值比例下该方法均具有良好的稳健性。基于CHIP 2013年度数据,利用该方法对农民工子女高中入学决定的影响因素进行了实证研究。分析发现,农民工父母的教育水平、教育水平与家庭经济状况的交互作用、农民工子女性别、性别与民族的交互作用均对农民工子女的入学决定有重要影响。     

Estimation of a Discriminant Function from a Mixture of Two Burr Type III Distributions

In this article, we propose the finite mixture of two Burr Type-III distributions (MTBIIID). First, we formulate the proposed model with some properties and prove the identifiability property. Next, we obtain the maximum likelihood estimates (MLEs) of the unknown parameters of MTBIIID under classified and unclassified observations. Also, we estimate the nonlinear discriminant function of the underlying model. In addition, we calculate the total probabilities of misclassification as well as the percentage bias. Further, we investigate the performance of the all results through series of the simulation experiments by the means of the relative efficiencies.     

模拟遗传算法在热电厂运行优化中的应用

本文介绍遗传算法在热电厂运行优化中的应用方法,与一般的遗传算法不同的是,我们算法的三种遗传算子与个体的适应值有关。     

利用上凸函数对决策树算法的改进

针对决策树分类方法的计算效率进行深入研究,根据信息增益计算的特点,引入了上凸函数的概念,用于提高决策树分类过程中信息增益的计算效率。利用我们所提出的“一致性定理”和“特殊一致性定理”,从理论上证明了利用上凸函数对信息增益计算进行改进后,构造的决策树与原决策树具有相同的分类准确率。同时我们通过对大数据集的实验,发现在相同规模的数据集下,改进后的决策树算法比原算法有更高的计算效率,并且这种计算效率的提高有随着数据集规模的增加而增加的趋势。