首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到14条相似文献,搜索用时 31 毫秒
1.
对室内终端进行基于无线通信基站的三维定位时,由于无线电在传播过程中,存在建筑物或树木遮挡、反射、折射等物理现象,导致基站到终端传播时间的测量值与精确值之间存在误差.为了减少上述误差对定位精度的影响,运用无线定位原理建立了一种基于校正无线电传播时间的改进的室内三维定位模型.通过对2016年全国研究生数学建模问题C题所提供的不同场景的数据分析,发现基站与终端无线电传播时间的测量值与其精确值之间存在线性关系,而且同一场景下近似有相同的线性关系,场景不同线性关系一般不同.基于这一现象,对基本的定位模型进行了合理的修正形成了改进的定位模型,数值实验表明改进的定位模型有很好的定位精度和鲁棒性.  相似文献   

2.
采用牛津大学Angeliki Xifara使用Ecotect系统模拟的768个不同建筑物数据,尝试将半参数中的部分线性单指标模型(PLSIM)用于住房建筑物负荷的预测研究中。同时采用BP神经网络以及迭代加权最小二乘法分别建立热负荷、冷负荷预测模型,将3种方法所得结果进行比较。研究结果表明部分线性单指标模型在建筑物负荷预测中相对误差均在0.00104以内且更直观,可以为国家调整住房结构、节约能源提供有力的模型支持。  相似文献   

3.
目的 从代谢组学角度分析并寻找2型糖尿病(T2DM)患者可能的代谢标记物。方法 选取30例初诊、或有糖尿病史经药物治疗控制不理想且无并发症的T2DM 患者,另选取30例性别、年龄匹配的健康者为正常对照。收集清晨空腹中段尿,以气相色谱- 质谱联用(GC-MS)技术对尿液样本进行代谢图谱分析,正交偏最小二乘法判别研究尿液内源性化合物在两组间的差异。结果 T2DM 组和正常对照组尿液代谢谱明显分离。与正常对照组比较,T2DM 组尿液2,3,4- 三羟基丁酸、肌醇、D- 葡萄糖、D- 葡萄糖酸及尿素含量升高(P<0.05 或0.01),马尿酸含量减少(P<0.01)。结论 代谢组学检查提示T2DM 患者尿液中代谢标志物为2,3,4- 三羟基丁酸、肌醇、马尿酸、D-葡萄糖、D- 葡萄糖酸及尿素,观察这些标志物含量的变化有助于T2DM 的临床诊断及发病机制研究。  相似文献   

4.
基于无线通信基站的室内三维定位问题主要是在已知TOA和基站三维信息的情况计算出终端的位置信息,实际上就是求解方程组中的未知数.首先建立通用模型和算法求解出终端的定位,接着通过优化得到使用尽量少的基站数目实现近似最优精度的定位,然后利用提出的算法实现终端移动轨迹的二维定位,最后结合实际情况,考虑了基站的有效测量距离并设计了有效基站识别算法对问题进行了分析.  相似文献   

5.
The zeta distribution with regression parameters has been rarely used in statistics because of the difficulty of estimating the parameters by traditional maximum likelihood. We propose an alternative method for estimating the parameters based on an iteratively reweighted least-squares algorithm. The quadratic distance estimator (QDE) obtained is consistent, asymptotically unbiased and normally distributed; the estimate can also serve as the initial value required by an algorithm to maximize the likelihood function. We illustrate the method with a numerical example from the insurance literature; we compare the values of the estimates obtained by the quadratic distance and maximum likelihood methods and their approximate variance–covariance matrix. Finally, we calculate the bias, variance and the asymptotic efficiency of the QDE compared to the maximum likelihood estimator (MLE) for some values of the parameters.  相似文献   

6.
    
Considering a parameter estimation and variable selection problem in logistic regression, we propose Smooth LASSO and Spline LASSO. When the variables is continuous, using Smooth LASSO can select local constant coefficient in each group. However, in some case, the coefficient might be different and change smoothly. Using Spline Lasso to estimate parameter is more appropriate. In this article, we prove the reliability of the model by theory. Finally using coordinatedescent algorithm to solve the model. Simulations show that the model works very effectively both in feature selection and prediction accuracy.  相似文献   

7.
??Considering a parameter estimation and variable selection problem in logistic regression, we propose Smooth LASSO and Spline LASSO. When the variables is continuous, using Smooth LASSO can select local constant coefficient in each group. However, in some case, the coefficient might be different and change smoothly. Using Spline Lasso to estimate parameter is more appropriate. In this article, we prove the reliability of the model by theory. Finally using coordinatedescent algorithm to solve the model. Simulations show that the model works very effectively both in feature selection and prediction accuracy.  相似文献   

8.
A new implementation of the Marquardt method for the nonlinear least-squares problem is presented. The algorithm is very simple but its performance with nine test functions is at least comparable with either Davidon-Fletcher-Powell's method or Moré's adaptive Marquardt method.  相似文献   

9.
    
Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering scenario, where the data contains a large number of features and many of them carry no information about the clustering structure. In this article, we demonstrate that the performance of convex clustering could be distorted when the uninformative features are included in the clustering. To overcome it, we introduce a new clustering method, referred to as Sparse Convex Clustering, to simultaneously cluster observations and conduct feature selection. The key idea is to formulate convex clustering in a form of regularization, with an adaptive group-lasso penalty term on cluster centers. To optimally balance the trade-off between the cluster fitting and sparsity, a tuning criterion based on clustering stability is developed. Theoretically, we obtain a finite sample error bound for our estimator and further establish its variable selection consistency. The effectiveness of the proposed method is examined through a variety of numerical experiments and a real data application. Supplementary material for this article is available online.  相似文献   

10.
基于指数Laplace损失函数的回归估计鲁棒超限学习机   总被引:1,自引:0,他引:1       下载免费PDF全文
实际问题的数据集通常受到各种噪声的影响,超限学习机(extreme learning machine, ELM)对这类数据集进行学习时,表现出预测精度低、预测结果波动大.为了克服该缺陷,采用了能够削弱噪声影响的指数Laplace损失函数.该损失函数是建立在Gauss核函数基础上,具有可微、非凸、有界且能够趋近于Laplace函数的特点.将其引入到超限学习机中,提出了鲁棒超限学习机回归估计(exponential Laplace loss function based robust ELM for regression, ELRELM)模型.利用迭代重赋权算法求解模型的优化问题.在每次迭代中,噪声样本点被赋予较小的权值,能够有效地提高预测精度.真实数据集实验验证了所提出的模型相比较于对比算法具有更优的学习性能和鲁棒性.  相似文献   

11.
求解欠定线性方程组稀疏解的算法   总被引:2,自引:0,他引:2  
针对欠定线性方程组稀疏解的求解问题,文中提出两个改进的迭代重加权最小范数解算法(IRMNS)及一个光滑的0函数算法.其中,第一个算法基于 q(q∈(0,1])范数提出的,当q较小的时候,算法可以增强恢复稀疏解的能力;第二个算法是直接由0范数最小化问题提出的,它可以看做是第一个算法在q =0时的拓展;第三个算法是通过用一个光滑函数来近似0范数从而将原问题进行转化求解的.数值例子表明这三种算法都是快速有效的.  相似文献   

12.
We investigate the problem of model selection for learning algorithms depending on a continuous parameter. We propose a model selection procedure based on a worst-case analysis and on a data-independent choice of the parameter. For the regularized least-squares algorithm we bound the generalization error of the solution by a quantity depending on a few known constants and we show that the corresponding model selection procedure reduces to solving a bias-variance problem. Under suitable smoothness conditions on the regression function, we estimate the optimal parameter as a function of the number of data and we prove that this choice ensures consistency of the algorithm.  相似文献   

13.
14.
集团分布式制造模式下生产调配优化模型研究及算法设计   总被引:1,自引:0,他引:1  
基于分布式概念的集团分布式制造生产管理模式在市场中占据着越来越重要的地位,此种运营模式由制造型企业向服务型企业蔓延的趋势也越来越明显,然而针对这一具有自身特点的集团分布式概念下的生产管理模型的调度研究却很少。研究针对此生产管理模式下集团级的生产调配问题建立数学模型,综合考虑客户订单的分散情况、各分厂日生产能力限制和产品品种多样性的特点,采用改进的遗传算法求解该模型,提出一种基于订单和工厂的两段式非负整数染色体编码方法,保证了生产能力约束和订单约束,采用PMX交叉算法避免不合法染色体的出现。选取W集团一定计划期内的客户订单数据进行实例分析,验证了该生产调配模型和算法的有效性。  相似文献   

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

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