运用基因表达式编程的自陈量表数据建模

探讨基因表达式编程对自陈量表测量数据的建模方法。运用威廉斯创造力测验和认知需求量表获得400位中学生的测量分数,通过数据清洗,保留383个被试的分数作为建模的数据集。运用哈曼单因素检验方法没有发现共同方法偏差。采用均匀设计方法对基因表达式编程中的5个参数进行优化配置,在测试拟合度最大的试验条件下,找到了测试误差最小的模型。比较基因表达式编程和BP神经网络、支持向量回归机、多元线性回归、二次多项式回归所建模型的预测精度。研究表明,基因表达式编程能用于自陈量表测量数据的建模,该模型比传统方法所建的模型具有更高的预测精度,而且模型是稳健的。     

An entropy approach to the scaling of ordinal categorical data

This paper studies the problem of scaling ordinal categorical data observed over two or more sets of categories measuring a single characteristic. Scaling is obtained by solving a constrained entropy model which finds the most probable values of the scales given the data. A Kullback-Leibler statistic is generated which operationalizes a measure for the strength of consistency among the sets of categories. A variety of data of two and three sets of categories are analyzed using the entropy approach.This research was partially supported by the Air Force Office of Scientific Research under grant AFOSR 83-0234. The support by the Air Force through grant AFOSR-83-0234 is gratefully acknowledged. The comments of the editor and referees have been most helpful in improving the paper, and in bringing several additional references to our attention.     

Choice functions in multistage optimization

This paper is devoted to the multistage optimization problem with a vector-valued gain function. The notion of optimality is determined here by the choice function. The conditions for the choice function that guarantee the applicability and efficiency of dynamic programming are found.     

Approximately Efficient Solutions in Vector Optimization

An approach to approximating solutions in vector optimization is developed for vector optimization problems with arbitrary ordering cones. This paper presents a study of approximately efficient points of a given set with respect to a convex cone in an ordered Banach space. Existence results for such approximately efficient points are obtained. A domination property related to these existence results is observed and then it is proved that each element of a given set is approximated by the sum of a point in a convex cone inducing the ordering and a point in a finite set consisting of such approximately efficient points of the set.