缺失数据的插补调整

插补是另一类对缺失数据进行调整 ,以减小估计偏差的方法。本文介绍的插补方法有 :演绎估计 ,均值插补 ,随机插补 ,回归插补和多重插补     

调查问卷中含缺失数据的等级变量的补缺方法

讨论了调查问卷中等级变量缺失数据的补缺问题.基于多元统计学理论,并结合总体趋势和个体偏差,提出一种新的补缺方法,方法使得补缺值更加准确、真实,并且将此方法扩展到变量等级数不相等的调查问卷之中.     

个人住房抵押贷款模式及应用

提出了等比还贷,等差还贷,基于等额的灵活还贷和混合还贷4种模式,举例分析并指出了各模式适合的客户类型,最后对贷款利率调整时各模式的有关变化作了进一步的探讨,各种还贷模式可根据具体情况在实践中推广应用。     

基于数据挖掘的电力行业客户细分模型分析

社会经济的不断发展推动了电力行业的快速发展。随着客户细分理论与方法的发展,其已广泛应用于我国电力、电信、银行及零售业等行业的营销实践中。由于客户行为能有效、直接地反映出消费者的需求,在经济市场中的应用更为广泛,是市场细分中的最佳起点。主要以客户细分的概述为出发点,对电力客户细分现状、基于数据挖掘的客户细分及模型构建进行探讨。     

综合价值评估法在电力企业客户细分中的应用

对电力客户进行细分,有助于电力企业更好的了解客户,为电力客户制定差异化服务策略,最大程度满足客户需求,达到公司、客户双赢局面。因此文中运用客户综合价值评估方法建立了客户细分模型,构建了基于客户综合价值的细分指标体系,运用熵权法和专家经验相结合的方式得出指标的综合权重,最终得出细分结果,为供电局制定个性服务策略提供辅助支撑。     

联邦学习在移动通信网络智能化的应用

为解决移动通信网络智能化中因用户隐私保护、数据孤岛等因素导致数据无法集中训练等问题,网络可融入联邦学习技术,构建高效的分布式可信网络智能化架构。概述了联邦学习研究现状以及标准现状,介绍了基于联邦学习的网络智能化架构,并基于该架构验证了客户体验管理应用案例,为移动通信网络与联邦学习的融合提供了参考和借鉴,进一步推动了联邦学习技术在网络智能化的应用。     

A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience

In this paper, we study the problem of designing motion strategies for a team of mobile agents, required to fulfill request for on-site service in a given planar region. In our model, each service request is generated by a spatio-temporal stochastic process; once a service request has been generated, it remains active for a certain deterministic amount of time, and then expires. An active service request is fulfilled when one of the mobile agents visits the location of the request. Specific problems we investigate are the following: what is the minimum number of mobile agents needed to ensure that a certain fraction of service requests is fulfilled before expiration? What strategy should they use to ensure that this objective is attained? This problem can be viewed as the stochastic and dynamic version of the well-known vehicle routing problem with time windows. We also extend our analysis to the case in which the time service requests remain active is itself a random variable, describing customer impatience. The customers’ impatience is only known to the mobile agents via prior statistics. In this case, it is desired to minimize the fraction of service requests missed because of impatience. Finally, we show how the routing strategies presented in the paper can be executed in a distributed fashion.     

On almost sure max-limit theorems of complete and incomplete samples from stationary sequences

Let M _n denote the partial maximum of a strictly stationary sequence (X _n ). Suppose that some of the random variables of (X _n ) can be observed and let [(M)\tilde]_n\tilde M_n stand for the maximum of observed random variables from the set {X ₁, ..., X _n }. In this paper, the almost sure limit theorems related to random vector ([(M)\tilde]_n\tilde M_n , M _n ) are considered in terms of i.i.d. case. The related results are also extended to weakly dependent stationary Gaussian sequence as its covariance function satisfies some regular conditions.     

Linear restrictions and two step least squares with applications

In this paper we consider the full rank regression model with arbitrary covariance matrix: Y = Xß + ε. It is shown that the effect of restricting the information Y to T = A′Y may be analyzed through an associatedi regression problem which is amenable to solution by two step least squares. The results are applied to the important case of missing observations, where some classical results are rederived.     

基于概率加权平均的Mel子带特征重建算法

本文提出基于概率加权平均的Mel子带特征数据重建算法.该算法选择K个最优重建结果的概率加权平均作为被加性噪声掩蔽的语音特征分量的估计.实验结果表明,基于概率加权平均的语音特征数据重建算法降低了重建误差,减少了帧间突变现象,增强了Mel子带特征的帧间连续性,从而显著提高了语音识别系统对加性噪声的鲁棒性能.