产生图的全部哈密顿回路

本文对完全图和非完全图分别给出了一个产生图中全部Hamilton回路的算法。与已有算法比较,本文提出的算法具有速度快、内存小的优点。该算法用于判别一个图是否Hamilton图效果良好。     

New Results for Computing Blaker’s Exact Confidence Interval for One Parameter Discrete Distributions

The authors state new general results for computing Blaker’s exact confidence interval limits for usual one-parameter discrete distributions. Specific results for implementing an accurate and fast algorithm are made explicit for the binomial, negative binomial, Poisson and hypergeometric model.     

Sequential voting by veto: Making the Mueller-Moulin algorithm more versatile

This paper shows that a relatively easy algorithm for computing the (unique) outcome of a sophisticated voting procedure called sequential voting by veto (SVV) applies to a more general situation than considered hitherto. According to this procedure a sequence of n voters must select s out of m + s options (s > 0, m 3 n 3 2). The ith voter, when his turn comes, vetoes k _i options (k _i 1, k _i = m). The s remaining non-vetoed options are selected. Every voter is assumed to be fully informed of all other voters total (linear) preference orderings among the competing options, as well as of the order in which the veto votes are cast. This algorithm was proposed by Mueller (1978) for the special case where s and the k _i are all equal to 1, and extended by Moulin (1983) to the somewhat more general case where the k _i are arbitrary but s is still 1. Some theoretical and practical issues of voting by veto are discussed.     

稳健高效的高维成分数据近似零值插补方法及应用

随着计算机技术的迅猛发展,高维成分数据不断涌现并伴有大量近似零值和缺失,数据的高维特性不仅给传统统计方法带来了巨大的挑战,其厚尾特征、复杂的协方差结构也使得理论分析难上加难。于是如何对高维成分数据的近似零值进行稳健的插补,挖掘潜在的内蕴结构成为当今学者研究的焦点。对此,本文结合修正的EM算法,提出基于R型聚类的Lasso-分位回归插补法(SubLQR)对高维成分数据的近似零值问题予以解决。与现有高维近似零值插补方法相比,本文所提出的SubLQR具有如下优势。①稳健全面性:利用Lasso-分位回归方法,不仅可以有效地探测到响应变量的整个条件分布,还能提供更加真实的高维稀疏模式;②有效准确性:采用基于R型聚类的思想进行插补,可以降低计算复杂度,极大提高插补的精度。模拟研究证实,本文提出的SubLQR高效灵活准确,特别在零值、异常值较多的情形更具优势。最后将SubLQR方法应用于罕见病代谢组学研究中,进一步表明本文所提出的方法具有广泛的适用性。     

Mixture of extreme-value distributions: identifiability and estimation

In this paper, the mixture model of k extreme value distributions is investigated. Using the Laplace transform of extreme value distributions given in terms of the Krätzel function, we first prove the identifiability of the class of arbitrary mixtures of extreme-value distributions of type 1 and type 2. We then find the estimates for the parameters of the mixture of two extreme-value distributions, including the three different types, via the EM algorithm. The performance of the estimates is tested by Monte Carlo simulation.     

Bayesian inference for random coefficient dynamic panel data models

We develop a hierarchical Bayesian approach for inference in random coefficient dynamic panel data models. Our approach allows for the initial values of each unit's process to be correlated with the unit-specific coefficients. We impose a stationarity assumption for each unit's process by assuming that the unit-specific autoregressive coefficient is drawn from a logitnormal distribution. Our method is shown to have favorable properties compared to the mean group estimator in a Monte Carlo study. We apply our approach to analyze energy and protein intakes among individuals from the Philippines.     

A hard clustering approach to the part family formation problem

The part family problem in group technology can be stated as the problem of finding the best grouping of parts into families such that the parts within each family are as similar to each other as possible. In this paper, the part family formation problem is considered. The problem is cast into a hard clustering model, and the k-means algorithm is proposed for solving it. Preliminary computational experience on the algorithm is very encouraging and it shows that real-life problems of large sizes can efficiently be handled by this approach.     

基于GASEN技术的选择性BagBoosting Trees集成学习研究

目前集成学习算法已经成为机器学习研究的一大热点,已有人提出许多改进的集成学习算法。本文提出了一种综合了Boosting和Bagging算法特点的选择性集成学习算法--SE-BagBoosting Trees算法。并将其与几种常用的机器学习算法比较研究得出,该算法往往比其它算法具有更小的模型推广误差和更高的预测精度的优点。     

Bayesian analysis of two overdispersed poisson regression models

Shookri and Consul (1989) and Scollnik (1995) have previously considered the Bayesian analysis of an overdispersed generalized Poisson model. Scollnik (1995) also considered the Bayesian analysis of an ordinary Poisson and over-dispersed generalized Poisson mixture model. In this paper, we discuss the Bayesian analysis of these models when they are utilised in a regression context. Markov chain Monte Carlo methods are utilised, and an illustrative analysis is provided.     

遗传算法在投资组合模型中的应用

均值-VaR模型是比较复杂的非线性规划问题，传统的算法不能保证得到全局最优值。鉴于此，引入遗传算法求解资产配置比例。对基于均值-VaR的单目标优化问题，设计了限定搜索空间和惩罚函数的遗传算法；而对多目标优化问题，应用并行选择遗传算法，并以沪深300行业分类指数构建投资组合，分析了行业资产配置的投资组合问题。结果表明，算法取得了良好的效果，解的结果既满足了投资的目标和约束条件，又反映了投资者之间不同的收益风险需求，且具有较好的实践性。