共查询到16条相似文献,搜索用时 140 毫秒
1.
2.
敏感问题问卷设计技术 总被引:4,自引:1,他引:3
巳有的随机化策略,都是通过设计某类特殊的随机化装置实现敏感问题抽样调查的.本文提出了敏感问题调查的简单、方便、实用的问卷调查方法,并讨论了敏感属性比例的估计及其方差.经过比较得出在相同的保护度下,已有的随机化策略与问卷调查方法在精度上各有得益. 相似文献
3.
双辅助信息敏感性问题问卷调查技术 总被引:3,自引:1,他引:2
对于敏感性问题调查,已有多种随机化策略.提出一类方便、实用的双辅助信息间接问卷调查方法,讨论了估计量及其方差以及精度与保护度之间的关系.通过比较得出,在相同的保护度下,随机化方法与问卷方法在精度上各有得益. 相似文献
4.
《数学的实践与认识》2015,(11)
对于多项选择敏感问题抽样调查,为了避开以往使用随机化调查时使用随机化装置带来的不便,提出一种间接问卷调查策略.结合问卷设计对个体隐私的保护度,对辅助信息的选择提出了的建议,并得到了敏感属性比例的极大似然估计和Bayes估计.数据模拟的结果显示,相比于极大似然估计,小样本时Bayes估计便有较高的精度.随着样本量的增加,两种估计结果趋于一致.提出的间接问卷调查策略,相比于以往的随机化调查技术,具有方便、省时等特点,可在实践中应用. 相似文献
5.
为了估计一个人群总体中具有敏感属性个体的未知比例,本文提出了一种简便易行的随机化回答技术.提出的方法不需要对样本个体直接询问敏感问题.每个响应者要求根据抽自两个卡片包的两张卡片的颜色和响应者是否具有敏感属性作出一个序对的回答.通过设计参数的适当选择,说明提出的方案比已有的一些随机化策略具有更高的效率.另外,这一策略对个体隐私具有很好的保护性且容易实施. 相似文献
6.
一种可供选择的随机化调查方法 总被引:2,自引:0,他引:2
本文提出了一种新的随机化调查方法,Warner(1965)和Horvitz,Simmons(1967)随机化回答方法是本文方法的特殊情形.这一方法比Warner(1965)方法和Mangat(1990)方法更有效. 当考虑存在不真实回答时,在一定的条件下并且不损失对个体保护度和不增加调查成本的前提下,提出的方法优于Simmons(1967)方法和Sarjinder Singh(2000)方法.对简单随机不放回抽样,在总体非敏感属性个体比例未知的情况下,给出了两个子样本容量的最优配置. 相似文献
7.
随机化均匀设计遗传算法 总被引:1,自引:0,他引:1
众所周知,遗传算法的运行机理及特点是具有定向制导的随机搜索技术,其定向制导的原则是:导向以高适应度模式为祖先的"家族"方向.以此结论为基础.利用随机化均匀设计的理论和方法,对遗传算法中的交叉操作进行了重新设计,给出了一个新的GA算法,称之为随机化均匀设计遗传算法.最后将随机化均匀设计遗传算法应用于求解函数优化问题,并与简单遗传算法和佳点集遗传算法进行比较.通过模拟比较,可以看出新的算法不但提高了算法的速度和精度,而且避免了其它方法常有的早期收敛现象, 相似文献
8.
9.
属性选择是数据挖掘领域用于降低数据特征维度的预处理方法.针对大数据环境下高维数据的属性约简问题,提出了融合基于MapReduce并行改进二元蚁群算法与分形维数的属性选择方法.首先,引入了参数控制的位置更新策略、对蚂蚁个体与种群进行交叉变异、重新定义阻塞机制的信息素更新,提出了并行改进的二元蚁群算法MRIBACO.其次,以并行二元蚁群算法作为离散解空间的搜索策略,结合分形维数提出了属性选择模型.在6个UCI数据集上的实验结果表明,较其他方法计算效率更优,同时表明了其有效性与稳定性. 相似文献
10.
11.
Michael P. Carter 《The Journal of the Operational Research Society》1988,39(7):643-652
This paper is the first of two to present the detailed findings of a survey carried out on the membership of the OR Society. Preliminary findings were given in an earlier paper. The survey consisted of sending a questionnaire to all members of the OR Society (42% response rate). Reported in detail in this paper are the structure of the respondents, their educational background, functional involvement, skill requirements and use of time division. Also reported is their involvement with computers, decision support systems and expert systems. 相似文献
12.
A new approximation method is presented for directly minimizing a composite nonsmooth function that is locally Lipschitzian. This method approximates only the generalized gradient vector, enabling us to use directly well-developed smooth optimization algorithms for solving composite nonsmooth optimization problems. This generalized gradient vector is approximated on each design variable coordinate by using only the active components of the subgradient vectors; then, its usability is validated numerically by the Pareto optimum concept. In order to show the performance of the proposed method, we solve four academic composite nonsmooth optimization problems and two dynamic response optimization problems with multicriteria. Specifically, the optimization results of the two dynamic response optimization problems are compared with those obtained by three typical multicriteria optimization strategies such as the weighting method, distance method, and min–max method, which introduces an artificial design variable in order to replace the max-value cost function with additional inequality constraints. The comparisons show that the proposed approximation method gives more accurate and efficient results than the other methods. 相似文献
13.
D.P. Solomatine 《Journal of Global Optimization》1999,14(1):55-78
Two strategies of randomized search, namely adaptive cluster covering (ACCO), and adaptive cluster covering with descent (ACD), are introduced and positioned in the group of the global optimization techniques. Several algorithms based on these new strategies are compared with other techniques of global randomized search in terms of effectiveness, efficiency and reliability. The other techniques include two versions of multistart, two versions of the controlled random search (CRS2 and CRS4) and the canonical genetic algorithm. Thirteen minimization problems including two parameter identification problems (for a flexible membrane mirror model and a hydrologic model) are solved. The algorithm ACCO, and a version of CRS4 algorithm (Ali and Storey 1994) show the highest efficiency, effectiveness and reliability. The second new algorithm, ACD, is in some runs very efficient and effective, but its reliability needs further improvement. 相似文献
14.
Multisource uncertainties, including property dispersibility of materials and fluctuating service environments, complicate structural design and reliability assessment. In this paper, a novel method named the adaptive alternating Lipschitz search method for structural analysis with unknown-but-bounded uncertainties (or interval uncertainties) is proposed. In contrast to traditional optimization methods that search twice to obtain response bounds, an adaptive alternate iteration strategy is proposed. By sampling step by step, two acquisition functions—named the Lipschitz upper bound and the Lipschitz lower bound—are defined. Structural response bounds can be simultaneously obtained by alternately optimizing the two acquisition functions. The parameter settings do not require adjustments for different types of problems. Additionally, the Bayesian Adaptive Direct Search method is adopted to improve the performance of the strategy. Numerical and experimental cases are presented to demonstrate the validity, accuracy, and efficiency of the proposed methodology. Detailed comparisons indicate that the proposed method is competitive when addressing complicated structural systems with different ranges of uncertainty. 相似文献
15.