首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 156 毫秒
1.
本文用PLS过程建立多因变量的偏最小二乘回归模型 ,并用具体例子对最小二乘回归(MLR)、主成分回归 (PCK)和偏最小二乘回归 (PLS)进行比较  相似文献   

2.
偏最小二乘回归的应用效果分析   总被引:2,自引:0,他引:2  
本文介绍了偏最小二乘回归 (PLS)的建模方法 ,比较了PLS与普通最小二乘回归 (OLS)及主成分回归的应用效果 ,并总结了PLS回归的基本特点 .  相似文献   

3.
偏最小二乘回归分析在均匀设计试验建模分析中的应用   总被引:14,自引:0,他引:14  
本文分析了目前应用一般的最小二乘法建立均匀试验数据的二次多项式回归模型时存在的局限性,提出了应用偏最小二乘法(Partial least-square,PLS)建立二次多项式回归模型的技术,并且进一步介绍了偏最小二乘回归(PLS回归)在均匀设计中的应用。作者认为,PLS回归分析建模技术将为均匀设计的更广泛应用提供有力的技术支持。  相似文献   

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

5.
偏最小二乘回归方法(PLS)在短期气候预测中的应用   总被引:3,自引:0,他引:3  
对广西88个站冬季(12月、1月和2月)各月平均气温距平场作自然正交展开(EOF分解),选取累积方差贡献超过90%的前3个主成分作为预报量.从前期平均大气环流场和海温场中查找预报因子,对这些初选因子用偏最小二乘回归方法(PLS)进行信息筛选和成分提取,用提取的新综合变量(又称成分)作预报因子,分别建立各月平均气温前3个主成分的回归预报方程.经独立样本预报试验证明,偏最小二乘回归方法具备良好的因子信息提取能力,其预报建模方法对冬季月平均气温预报具有较好的预测效果.  相似文献   

6.
航材备件是保障航空装备日常训练和作战正常使用的重要影响因素,针对部分航材备件样本数据量少,影响因素多且复杂多变,预测结果与装备系统完好性要求偏差较大等问题.建立基于灰色关联分析(GRA)与偏最小二乘(PLS)及最小二乘向量机(LSSVM)相结合的航材备件预测模型,采集某无人机航材备件数据,通过对统计数据进行灰色关联分析,提取航材备件需求的相关因素作为模型训练样本,确定关键因素,利用偏最小二乘对关键因素特征提取,然后将偏最小二乘特征提取后的数据作为最小二乘向量机输入,进行模型构建及分析.通过实验验证了该方法的可行性与适用性,能够满足无人机航材备件预测的实际需要.  相似文献   

7.
基于灰色组合模型的发动机研制费用估算研究   总被引:1,自引:0,他引:1  
参数估算法作为LCC的一种估算方法主要应用于武器装备研制费用的估算.由于样本数据较少,且变量之间的线性相关程度较高,如果使用传统的多元线性回归方程法估算,则会严重降低估计结果的有效性.为解决这一问题,研究了灰色组合模型在发动机研制费用估算中的应用.通过实例计算表明,本方法用较少的样本可以得到较高的估算精度.  相似文献   

8.
应用SAS解非线性回归问题   总被引:2,自引:0,他引:2  
.应用SAS/STAT估计非线性回归模型中的参数.首先,通过变量代换,把可以线性化的非线性回归模型化为线性回归模型,并用普通最小二乘法、主成分分析法和偏最小二乘法求模型中的参数和回归模型.其次,通过改良的高斯—牛顿迭代法来估计Logistic模型和Compertz模型中的参数.  相似文献   

9.
选矿效益对矿管理有着重要意义。影响选矿效益的因素之间存在严重的多重共线性,采用PLS方法建立了选矿效益的偏最小二乘回归模型,避免了普通多元回归模型的不合理性和岭回归模型选择岭参数的主观性。  相似文献   

10.
提出了一种基于性能特点和质量功能展开(QFD)技术的装备成本估算方法,可用于概念设计阶段进行准确的费用估算.应用QFD技术分析得出费用估算所需信息,并利用最小二乘法得出装备成本估算所需费用因子后结合预研装备的的性能值可计算出装备成本.最后通过实例对该方法进行了演示,并给出在不同预算下装备研制成功的概率.  相似文献   

11.
Influence maximization problems aim to identify key players in (social) networks and are typically motivated from viral marketing. In this work, we introduce and study the Generalized Least Cost Influence Problem (GLCIP) that generalizes many previously considered problem variants and allows to overcome some of their limitations. A formulation that is based on the concept of activation functions is proposed together with strengthening inequalities. Exact and heuristic solution methods are developed and compared for the new problem. Our computational results also show that our approaches outperform the state-of-the-art on relevant, special cases of the GLCIP.  相似文献   

12.
This paper proposes and estimates a globally flexible functional form for the cost function, which we call Neural Cost Function (NCF). The proposed specification imposes a priori and satisfies globally all the properties that economic theory dictates. The functional form can be estimated easily using Markov Chain Monte Carlo (MCMC) techniques or standard iterative SURE. We use a large panel of U.S. banks to illustrate our approach. The results are consistent with previous knowledge about the sector and in accordance with mathematical production theory.  相似文献   

13.
过去对复杂流动的三维数值模拟往往要采用许多简化处理方法,使得数值模型的适用性受到很大限制,所得结果也不能全面反应流场的特征.本文用有限容积法直接求解三维椭圆型流动控制方程,紊流模型采用有浮力修正的κ-ε模型.本文首先将该模型用于有横流情况下岸边等密度排放问题,以检验本数值模型和计算程序的正确性,所得结果正确预报了排放口下游的回流区,与文献[7]的计算和实验结果一致.然后进一步将其应用于有横流情况下的温排水、取水问题,所得结果合理,并精细地揭示了流场的内部特征.  相似文献   

14.
Cognitive/causal maps have been widely used as a powerful way of capturing decision-makers’ views about a problem, representing it as a cause–effect discourse. Several ways of making causal inferences from this type of model have been proposed in the Operational Research and Artificial Intelligence literatures, but none, as far as we are aware, has attempted to use a causal map structure to perform a multi-criteria evaluation of decision alternatives. Recently, we have proposed a new multi-criteria method, denominated as a Reasoning Map, which permits the use of decision-makers’ reasoning, structured as a network of means-and-ends (a particular type of causal map) to perform such an evaluation. In this manner, the model resembles the way that people talk and think about decisions in practice. The method also pays explicit attention to the cognitive limitations of decision-makers in providing preference information. Thus it employs qualitative assessment of preferences, utilises aggregation operators for qualitative data and provides also qualitative outputs. In this paper we discuss and evaluate possible ways of aggregating qualitative performance information in Reasoning Maps.  相似文献   

15.
周燕  林丽琼  任立英 《大学数学》2021,37(2):108-113
无穷小等价替换是计算极限一种常用且好用的方法,但要求替换项在极限点的某个邻域内没有零点,文章证明了函数在极限点的任意邻域都出现零点时,满足一定条件,等价替换仍可实施.另外利用极坐标计算二元函数极限时有诸多的限制,文章针对一类特殊函数给出了应用极坐标便于计算应用的若干结论.  相似文献   

16.
Both conjugate gradient and quasi-Newton methods are quite successful at minimizing smooth nonlinear functions of several variables, and each has its advantages. In particular, conjugate gradient methods require much less storage to implement than a quasi-Newton code and therefore find application when storage limitations occur. They are, however, slower, so there have recently been attempts to combine CG and QN algorithms so as to obtain an algorithm with good convergence properties and low storage requirements. One such method is the code CONMIN due to Shanno and Phua; it has proven quite successful but it has one limitation. It has no middle ground, in that it either operates as a quasi-Newton code using O(n 2) storage locations, or as a conjugate gradient code using 7n locations, but it cannot take advantage of the not unusual situation where more than 7n locations are available, but a quasi-Newton code requires an excessive amount of storage. In this paper we present a way of looking at conjugate gradient algorithms which was in fact given by Shanno and Phua but which we carry further, emphasize and clarify. This applies in particular to Beale's 3-term recurrence relation. Using this point of view, we develop a new combined CG-QN algorithm which can use whatever storage is available; CONMIN occurs as a special case. We present numerical results to demonstrate that the new algorithm is never worse than CONMIN and that it is almost always better if even a small amount of extra storage is provided.  相似文献   

17.
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the performance and cost of such networks. Generally, this complexity implies that it may not even be clear what constitutes a “good” network design for a particular specification. Different network owners or operators may view the same solution differently, depending on their unique needs and perspectives. Nevertheless, we have observed a core common issue arising in the early stages of network design efforts involving leading-edge broadband switched technologies such as ATM, Frame Relay, and SMDS; or even Internet IP router networks. This core issue can be stated as follows: Given a set of service demands for the various network nodes, where should switching or routing equipment be placed to minimize the Installed First Cost of the network? Note that the specified service demands are usually projections for a future scenario and generally entail significant uncertainty. Despite this uncertainty, we have found that network owners and operators generally feel it is worthwhile to obtain high-level advice on equipment placement with a goal of minimizing Installed First Cost. This paper reports on a heuristic approach we have implemented for this problem that has evolved out of real network design projects. A tool with both a Solution Engine and an intuitive Graphical User Interface has been developed. The approach is highly efficient; for example, the tool can often handle LATA-sized networks in seconds or less on a workstation processor. By using only nodal demands rather than the more complex point-to-point demands usually required in tools of this sort, we have created an approach that is not only highly efficient, but is also a better match to real design projects in which demand data is generally scant and highly uncertain.  相似文献   

18.
We provide a direct proof of a representation theorem for additive cost sharing methods as sums of path methods. Also, by directly considering the paths that generate some common additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) we show that they are consistent. These results follow directly from a simple sufficient condition for consistency: being generated by an associative path. We also introduce a new axiom, dummy consistency, which is quite mild. Using this, we also show that the Aumann-Shapley and Serial Cost methods are the unique (additive) consistent extension of their restriction on all two agent problems, while the Shapley-Shubik method has multiple consistent extensions but a unique anonymous scale invariant one.I would like to thank Rich Mclean for many detailed comments and suggestions, Ori Haimanko for pointing out an error in an earlier version of this paper, Hervé Moulin, Yves Sprumont, Yuntong Wang for helpful comments and an anonymous referee for many useful comments. This paper contains results from two previous working papers: Paths in Additive Cost Sharing and Weak and Strong Consistency in Additive Cost Sharing.Received: November 2001/Revised: January 2004  相似文献   

19.
AbstractThe motion of surface waves under the effect of bottom is a very interesting and challenging phenomenon in the nature, we use boundary integral method to compute and analyze this problem. In the linear analysis, the linearized equations have bounded error increase under some compatible conditions. This contributes to the cancellation of instable Kelvin-Helmholtz terms. Under the effect of bottom, the existence of equations is hard to determine, but given some limitations it proves true. These limitations are that the swing of interfaces should be small enough, and the distance between surface and bottom should be large enough. In order to maintain the stability of computation, some compatible relationship must be satisfied like that of [5]. In the numerical examples, the simulation of standing waves and breaking waves are calculated. And in the case of shallow bottom, we found that the behavior of waves are rather singular.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号