一类小样本的统计方法建模及其可视化

针对一类高维小样本数据,利用统计方法的非参数检验与偏最小二乘回归(PLS)构造小样本预测模型,实现基于Wilcoxon秩和检验的变量选择与基于PLS的变量压缩降维.并通过DNA序列分类问题实现基于统计方法的小样本数据建模与可视化,计算结果表明方法对小样本具有可行性、有效性.     

Exploring interactions in high-dimensional genomic data: an overview of Logic Regression, with applications

Logic Regression is an adaptive regression methodology mainly developed to explore high-order interactions in genomic data. Logic Regression is intended for situations where most of the covariates in the data to be analyzed are binary. The goal of Logic Regression is to find predictors that are Boolean (logical) combinations of the original predictors. In this article, we give an overview of the methodology and discuss some applications. We also describe the software for Logic Regression, which is available as an R and S-Plus package.     

分层回归与经典回归模型比较研究:以顾客资产驱动因素与忠诚意向的关系为例

对我国六大银行688条顾客数据,分别运用两种方法(分层回归模型和经典回归模型)在两种软件(MLwiN 2.10 Beta和SPSS 15.0),进行了数学建模.结果显示,经典回归模型进行参数估计的结果不会产生严重偏差;没有足够的证据证明经典回归模型会因为低估标准误从而使得不显著的变量变得显著.结论表明收集数据时,无论采用分层抽样还是随机抽样,建模者都可以先从建立简单模型着手,获得对数据的初步认知.     

Simple consistent cluster methods based on redescending M-estimators with an application to edge identification in images

We use the local maxima of a redescending M-estimator to identify cluster, a method proposed already by Morgenthaler (in: H.D. Lawrence, S. Arthur (Eds.), Robust Regression, Dekker, New York, 1990, pp. 105–128) for finding regression clusters. We work out the method not only for classical regression but also for orthogonal regression and multivariate location and show that all three approaches are special cases of a general approach which includes also other cluster problems. For the general case we show consistency for an asymptotic objective function which generalizes the density in the multivariate case. The approach of orthogonal regression is applied to the identification of edges in noisy images.     

Ellipsoidal classification via semidefinite programming

We propose a classification approach exploiting relationships between ellipsoidal separation and Support-vector Machine (SVM) with quadratic kernel. By adding a (Semidefinite Programming) SDP constraint to SVM model we ensure that the chosen hyperplane in feature space represents a non-degenerate ellipsoid in input space. This allows us to exploit SDP techniques within Support-vector Regression (SVR) approaches, yielding better results in case ellipsoid-shaped separators are appropriate for classification tasks. We compare our approach with spherical separation and SVM on some classification problems.     

Bayesian Analysis for Random Coefficient Regression Models Using Noninformative Priors

We apply Bayesian approach, through noninformative priors, to analyze a Random Coefficient Regression (RCR) model. The Fisher information matrix, the Jeffreys prior and reference priors are derived for this model. Then, we prove that the corresponding posteriors are proper when the number of full rank design matrices are greater than or equal to twice the number of regression coefficient parameters plus 1 and that the posterior means for all parameters exist if one more additional full rank design matrix is available. A hybrid Markov chain sampling scheme is developed for computing the Bayesian estimators for parameters of interest. A small-scale simulation study is conducted for comparing the performance of different noninformative priors. A real data example is also provided and the data are analyzed by a non-Bayesian method as well as Bayesian methods with noninformative priors.     

General linear methods: connection to one step methods and invariant curves

Summary We generalize a result of Kirchgraber (1986) on multistep methods. We show that every strictly stable general linear method is essentially conjugate to a one step method of the same order. This result may be used to show that general properties of one step methods carry over to general linear methods. As examples we treat the existence of invariant curves and the construction of attracting sets.     

Projection methods for the linear split feasibility problems

Some optimization problems can be reduced to finding a solution of a system of linear inequalities which belongs to a closed convex subset. In some optimization methods such a solution (or at least a better approximation of such a solution than the current one) should be found in each iteration. In the article, we present various projection methods to solve this problem. Furthermore, we show the relationship between these methods. We show that all presented methods can be reduced to the surrogate constraints method.     

The generalized residual cutting method and its convergence characteristics

Iterative methods and especially Krylov subspace methods (KSM) are a very useful numerical tool in solving for large and sparse linear systems problems arising in science and engineering modeling. More recently, the nested loop KSM have been proposed that improve the convergence of the traditional KSM. In this article, we review the residual cutting (RC) and the generalized residual cutting (GRC) that are nested loop methods for large and sparse linear systems problems. We also show that GRC is a KSM that is equivalent to Orthomin with a variable preconditioning. We use the modified Gram–Schmidt method to derive a stable GRC algorithm. We show that GRC presents a general framework for constructing a class of “hybrid” (nested) KSM based on inner loop method selection. We conduct numerical experiments using nonsymmetric indefinite matrices from a widely used library of sparse matrices that validate the efficiency and the robustness of the proposed methods.     

股票投资中一种新的技术分析方法

现有许多种关于股票投资的技术分析方法,如移动平均线,PE值,相对强弱指数等等。文章提出一种基于回归的新的技术分析方法———回归直线分析法。通过比较,作者认为回归直线分析法在香港股市较其它几种技术分析方法不仅具有盈利大,而且盈利概率也明显占优的特点     

教育收益率估计方法的比较

本文对教育经济学中个人教育投资明瑟收益率的估计方法进行了比较研究,特别是引入了部分线性回归模型对明瑟收益率进行估计的方法,并且通过广义似然比检验对常规明瑟模型中的参数形式进行了检验。     

Robust multi-criteria ranking with additive value models and holistic pair-wise preference statements

We consider a problem of ranking alternatives based on their deterministic performance evaluations on multiple criteria. We apply additive value theory and assume the Decision Maker’s (DM) preferences to be representable with general additive monotone value functions. The DM provides indirect preference information in form of pair-wise comparisons of reference alternatives, and we use this to derive the set of compatible value functions. Then, this set is analyzed to describe (1) the possible and necessary preference relations, (2) probabilities of the possible relations, (3) ranges of ranks the alternatives may obtain, and (4) the distributions of these ranks. Our work combines previous results from Robust Ordinal Regression, Extreme Ranking Analysis and Stochastic Multicriteria Acceptability Analysis under a unified decision support framework. We show how the four different results complement each other, discuss extensions of the main proposal, and demonstrate practical use of the approach by considering a problem of ranking 20 European countries in terms of 4 criteria reflecting the quality of their universities.     

Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints

We adapt the convergence analysis of the smoothing (Ref. 1) and regularization (Ref. 2) methods to a penalty framework for mathematical programs with complementarity constraints (MPCC); we show that the penalty framework shares convergence properties similar to those of these methods. Moreover, we give sufficient conditions for a sequence generated by the penalty framework to be attracted to a B-stationary point of the MPCC.     

The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves

In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed. We study the effect of the use of transformations on the approximation of univariate (convex) functions. In this paper, we show that these transformations can be used to construct upper and lower bounds for nonconvex functions. Moreover, we show that by using such transformations of the input variable or the output variable, we obtain tighter upper and lower bounds for the approximation of convex functions than without these approximations. We show that these transformations can be applied to the approximation of a (convex) Pareto curve that is associated with a (convex) bi-objective optimization problem.     

一类多元回归模型参数的优于BLUE的估计

本文考虑多元线性回归模型i=1,2,B_i 未知在一定的条件下,得到参数的优于 BLUE 的估计。     

PPA BASED PREDICTION-CORRECTION METHODS FOR MONOTONE VARIATIONAL INEQUALITIES

In this paper we study the proximal point algorithm (PPA) based prediction-correction (PC) methods for monotone variational inequalities. Each iteration of these methods consists of a prediction and a correction. The predictors are produced by inexact PPA steps. The new iterates are then updated by a correction using the PPA formula. We present two profit functions which serve two purposes: First we show that the profit functions are tight lower bounds of the improvements obtained in each iteration. Based on this conclusion we obtain the convergence inexactness restrictions for the prediction step. Second we show that the profit functions are quadratically dependent upon the step lengths, thus the optimal step lengths are obtained in the correction step. In the last part of the paper we compare the strengths of different methods based on their inexactness restrictions.     

Exponentially-fitted methods and their stability functions

We investigate the properties of stability functions of exponentially-fitted Runge–Kutta methods, and we show that it is possible (to some extent) to determine the stability function of a method without actually constructing the method itself. To focus attention, examples are given for the case of one-stage methods. We also make the connection with so-called integrating factor methods and exponential collocation methods. Various approaches are given to construct these methods.     

Dealing with interaction between bipolar multiple criteria preferences in PROMETHEE methods

In this paper we extend the PROMETHEE methods to the case of interacting criteria on a bipolar scale, introducing the bipolar PROMETHEE method based on the bipolar Choquet integral. In order to elicit parameters compatible with preference information provided by the Decision Maker (DM), we propose to apply the Robust Ordinal Regression (ROR). ROR takes into account simultaneously all the sets of parameters compatible with the preference information provided by the DM considering a necessary and a possible preference relation.     

关于辛算法稳定性的若干注记

我们讨论辛算法的线性稳定性和非线性稳定性,从动力系统和计算的角度论述了研究辛算法的这两类稳定性问题的重要性,分析总结了相关重要结果.我们给出了解析方法的明确定义,证明了稳定函数是亚纯函数的解析辛方法是绝对线性稳定的.绝对线性稳定的辛方法既有解析方法（如Runge-Kutta辛方法）,也有非解析方法（如基于常数变易公式对线性部分进行指数积分而对非线性部分使用其它数值积分的方法）.我们特别回顾并讨论了R.I.McLachlan,S.K.Gray和S.Blanes,F.Casas,A.Murua等关于分裂算法的线性稳定性结果,如通过选取适当的稳定多项式函数构造具有最优线性稳定性的任意高阶分裂辛算法和高效共轭校正辛算法,这类经优化后的方法应用于诸如高振荡系统和波动方程等线性方程或者线性主导的弱非线性方程具有良好的数值稳定性.我们通过分析辛算法在保持椭圆平衡点的稳定性,能量面的指数长时间慢扩散和KAM不变环面的保持等三个方面阐述了辛算法的非线性稳定性,总结了相关已有结果.最后在向后误差分析基础上,基于一个自由度的非线性振子和同宿轨分析法讨论了辛算法的非线性稳定性,提出了一个新的非线性稳定性概念,目的是为辛算法提供一个实际可用的非线性稳定性判别法.