共查询到20条相似文献,搜索用时 46 毫秒
1.
《统计与信息论坛》2008,23(1):91-96
首次入选CSSCI来源期刊,标志着《统计与信息论坛》步入了新的发展阶段。面对新的机遇与挑战,《统计与信息论坛》编辑部组织了本次笔谈,对《统计与信息论坛》未来的办刊理念、期刊定位、办刊特色、栏目设置、稿件内容、编排规范等进行广泛讨论。本次笔谈得到了广大编委和部分作者的积极支持,收到了许多宝贵的意见和建议。这些宝贵的建议将对本刊今后的发展起到积极的推动作用。这里摘登部分内容,以期广大关心本刊发展的朋友们对期刊的发展进一步建言献策。此外,天津财经大学肖红叶教授、东北财经大学蒋萍教授、中国人民大学易丹辉教授、首都经济与贸易大学纪宏教授等也对本刊发展给予了充分肯定,在此表示衷心的感谢。 相似文献
2.
3.
4.
5.
6.
7.
8.
《统计与信息论坛》编辑部 《统计与信息论坛》2016,(12):29-29
<正>尊敬的审稿专家:各位好!一份好的学术期刊是主办单位、编委、审稿专家、编辑、作者、读者精诚合作、齐心协力、共同努力的结晶。学术质量与水平是期刊的生命之根,质量的好坏、水平的高低,关键在于审稿专家的工作质量。长期以来,你们以严谨的治学态度和无私的奉献精神,为《统计与信息论坛》鼓实劲、出实力,默默付出了许多心血和劳动,为《统计与信息论坛》的发展做出了巨大贡献。因为有你们保驾护航,《统计与信息论坛》由无名小草成长为参天大树,跻身于中国优秀学术期刊行列。在此,向各位专家表示崇高的敬意和衷心的感谢! 相似文献
9.
10.
11.
For measuring the goodness of 2
m
41 designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2
m
41 designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2
m
41 designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2
m
41 designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2
m
41 designs. In this case, we obtain lower bounds for A
30 and A
31, where A
30 and A
31 are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration
(WMA) 2
m
41 designs (A
30 and A
31 achieving the lower bounds) is demonstrated. Some MA or WMA 2
m
41 designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and
Shao (2001) and Mukerjee and Wu (2001). 相似文献
12.
Francesco Dalla Valle Fortunato Pesarin Luigi Salmaso 《Statistical Methods and Applications》2002,11(3):265-276
Exact permutation testing of effects in unreplicated two-level multifactorial designs is developed based on the notion of
realigning observations and on paired permutations. This approach preserves the exchangeability of error components for testing
up tok effects. Advantages and limitations of exact permutation procedures for unreplicated factorials are discussed and a simulation
study on paired permutation testing is presented. 相似文献
13.
In high-dimensional data, one often seeks a few interesting low-dimensional projections which reveal important aspects of
the data. Projection pursuit for classification finds projections that reveal differences between classes. Even though projection
pursuit is used to bypass the curse of dimensionality, most indexes will not work well when there are a small number of observations
relative to the number of variables, known as a large p (dimension) small n (sample size) problem. This paper discusses the relationship between the sample size and dimensionality on classification
and proposes a new projection pursuit index that overcomes the problem of small sample size for exploratory classification. 相似文献
14.
In the present paper the distribution theory of maximum and minimum of ther
th concomitants from k independent subgroups each of same size m from the Morgenstern family is investigated. Some applications
of the results in estimation of the scale parameter of a marginal variable in the bivariate uniform distribution and a selection
problem are discussed. 相似文献
15.
16.
Model-based clustering typically involves the development of a family of mixture models and the imposition of these models
upon data. The best member of the family is then chosen using some criterion and the associated parameter estimates lead to
predicted group memberships, or clusterings. This paper describes the extension of the mixtures of multivariate t-factor analyzers model to include constraints on the degrees of freedom, the factor loadings, and the error variance matrices.
The result is a family of six mixture models, including parsimonious models. Parameter estimates for this family of models
are derived using an alternating expectation-conditional maximization algorithm and convergence is determined based on Aitken’s
acceleration. Model selection is carried out using the Bayesian information criterion (BIC) and the integrated completed likelihood
(ICL). This novel family of mixture models is then applied to simulated and real data where clustering performance meets or
exceeds that of established model-based clustering methods. The simulation studies include a comparison of the BIC and the
ICL as model selection techniques for this novel family of models. Application to simulated data with larger dimensionality
is also explored. 相似文献
17.
18.
In the presence of multicollinearity, the r − k class estimator is proposed as an alternative to the ordinary least squares (OLS) estimator which is a general estimator
including the ordinary ridge regression (ORR), the principal components regression (PCR) and the OLS estimators. Comparison
of competing estimators of a parameter in the sense of mean square error (MSE) criterion is of central interest. An alternative
criterion to the MSE criterion is the Pitman’s (1937) closeness (PC) criterion. In this paper, we compare the r − k class estimator to the OLS estimator in terms of PC criterion so that we can get the comparison of the ORR estimator to the
OLS estimator under the PC criterion which was done by Mason et al. (1990) and also the comparison of the PCR estimator to
the OLS estimator by means of the PC criterion which was done by Lin and Wei (2002). 相似文献
19.
20.
A finite mixture model using the Student's t distribution has been recognized as a robust extension of normal mixtures. Recently, a mixture of skew normal distributions
has been found to be effective in the treatment of heterogeneous data involving asymmetric behaviors across subclasses. In
this article, we propose a robust mixture framework based on the skew t distribution to efficiently deal with heavy-tailedness, extra skewness and multimodality in a wide range of settings. Statistical
mixture modeling based on normal, Student's t and skew normal distributions can be viewed as special cases of the skew t mixture model. We present analytically simple EM-type algorithms for iteratively computing maximum likelihood estimates.
The proposed methodology is illustrated by analyzing a real data example. 相似文献