不完全信息下损失风险的研究

在获得损失分布不完全信息情况下,提出用方差和熵共同度量损失风险的方法.在不完全信息条件下,通过最大熵原理在最不确定的情况下得到最大熵损失分布,并获得了损失分布的熵函数值.用熵值度量损失分布对于均匀分布的离散程度,从而度量概率波动带来的风险;用方差度量损失对于均值的离散程度,从而度量状态波动带来的风险.由于熵是与损失变量更高阶矩信息相联系的,所以新方法是从更全面的角度对损失风险的预测.通过算例,进一步看出在获得高阶矩信息下,熵参与风险度量的必要性.     

基于极大模糊熵原理的模糊推理三I算法

用模糊熵来度量模糊推理结果的模糊程度，并用本文给出的极大模糊熵原理对王国俊先生提出的模糊推理三Ⅰ算法做进一步的解释和改进，提出基于极大模糊熵原理的模糊推理三Ⅰ算法，证明这几种算法在一定条件下是关系再现算法。     

Stochastic Relations and the Problem of Prior in the Principle of Maximum Entropy

In this paper we discuss the problem of prior for the maximum entropy principle. We show that stochastic relations can be used to constrain priors and in some case uniquely determine them. The principle of maximum entropy turns stochastic relations into (over)determined systems of partial difference equations for the partition function. All statistical consequences of the stochastic relations are determined by the space of solutions of the system.     

基于广义最大熵的顾客满意度测评研究

本文提出了应用广义最大熵（Generalized Maximum Entropy,简称 GME）的方法对顾客满意度进行测评,该方法能够处理有限的或者不完全数据.采用了一个应用于美国顾客满意指数（ACSI）的简单模型生成仿真数据,比较GME和PLS两种方法的性能.仿真结果表明,与PLS方法相比,GME方法具有更高的拟合精度和较低的预测误差,在样本数据较少时,表现更为明显.     

信息熵公理及其在决策分析中的应用

针对信息量是消息发生前的不确定性给出一个直观测量信息量公式.为了克服Shannon熵的局限性和分析信息度量本质,借鉴距离空间理论中度量公理定义的思路,通过非负性、对称性、次可加和极大性给出信息熵的公理化新定义.将Shannon熵、直观信息熵和β-熵等不同形式的信息度量统一在同一公理化结构下.应用直观信息熵公式仅采用四则运算进行决策树分析,避免了利用Shannon熵公式的对数运算.     

基于极大熵准则的先验分布确定方法

借助于熵的概念，讨论了用极大熵的思想来确定先验分布的几种情形，给出了在各种情形下先验分布的形式和结论，从而提供了确定先验分布的一种有效的方法。     

参变极值问题的信息凝聚分布与Boltzmann极大熵函数

该文利用Ｂｏｌｔｚｍａｎｎ 熵概念给出了参变极值问题最优解的一种积分极限表达式和极值函数的极大熵函数,讨论了它们一致收敛性的要求并给出了极大熵函数一致收敛的一个充分条件,将之应用到全局最优解问题得到了全局最优解和最优值的一种显表示,最后还探讨了极大熵函数在一类双层规划问题求解中的应用．     

Some characterization results on generalized cumulative residual entropy measure

The cumulative residual entropy (CRE) has been found to be a new measure of information that parallels Shannon entropy, refer to Rao et al. (2004). In this paper we study a generalized cumulative residual information measure based on Verma’s entropy function and a dynamic version of it. The exponential, Pareto and finite range distributions, which are commonly used in reliability modeling, have been characterized using this generalized measure.     

Relative difference in diversity between populations

An entropy is conceived as a functional on the space of probability distributions. It is used as a measure of diversity (variability) of a population. Cross entropy leads to a measure of dissimilarity between populations. In this paper, we provide a new approach to the construction of a measure of dissimilarity between two populations, not depending on the choice of an entropy function, measuring diversity. The approach is based on the principle of majorization which provides an intrinsic method of comparing the diversities of two populations. We obtain a general class of measures of dissimilarity and show some interesting properties of the proposed index. In particular, it is shown that the measure provides a metric on a probability space. The proposed measure of dissimilarity is essentially a measure of relative difference in diversity between two populations. It satisfies an invariance property which is not shared by other measures of dissimilarity which are used in ecological studies. A statistical application of the new method is given.     

变分不等式的极大熵函数方法

利用极大熵函数方法将不等式组及变分不等式的求解问题转化为近似可微优化问题,给出了不等式组及变分不等式问题近似解的可微优化方法,得到了不等式组和变分不等式问题的解集合的示性函数.     

不等式组与变分不等式的极大熵函数方法

利用极大熵函数方法将不等式组及变分不等式的求解问题转化为近似可微优化问题，给出了不等式组及变分不等式问题近似解的可微优化方法，得到了不等式组和变分不等式问题的解集合的示性函数．     

模糊熵与距离测度的相互诱导及其应用

模糊信息论就是利用模糊数学这一工具来研究带有模糊不确定性的信息的．模糊熵和距离测度是模糊信息论中两个重要的度量方法．本文主要讨论模糊熵和距离测度之间的相互关系,由此得到几个由模糊熵诱导的距离测度公式和几个由距离测度诱导出的模糊熵公式,说明了模糊熵和距离测度是可以相互诱导的．最后,举例说明距离测度公式在模式识别中的应用．     

Deng entropy

Dempster Shafer evidence theory has been widely used in many applications due to its advantages to handle uncertainty. However, how to measure uncertainty in evidence theory is still an open issue. The main contribution of this paper is that a new entropy, named as Deng entropy, is presented to measure the uncertainty of a basic probability assignment (BPA). Deng entropy is the generalization of Shannon entropy since the value of Deng entropy is identical to that of Shannon entropy when the BPA defines a probability measure. Numerical examples are illustrated to show the efficiency of Deng entropy.     

Relative entropy between quantum ensembles

Relative entropy between two quantum states, which quantifies to what extent the quantum states can be distinguished via whatever methods allowed by quantum mechanics, is a central and fundamental quantity in quantum information theory. However, in both theoretical analysis (such as selective measurements) and practical situations (such as random experiments), one is often encountered with quantum ensembles, which are families of quantum states with certain prior probability distributions. How can we quantify the quantumness and distinguishability of quantum ensembles? In this paper, by use of a probabilistic coupling technique, we propose a notion of relative entropy between quantum ensembles, which is a natural generalization of the relative entropy between quantum states. This generalization enjoys most of the basic and important properties of the original relative entropy. As an application, we use the notion of relative entropy between quantum ensembles to define a measure for quantumness of quantum ensembles. This quantity may be useful in quantum cryptography since in certain circumstances it is desirable to encode messages in quantum ensembles which are the most quantum, thus the most sensitive to eavesdropping. By use of this measure of quantumness, we demonstrate that a set consisting of two pure states is the most quantum when the states are 45° apart.     

平衡规划问题的熵函数方法及其在混合交通流中的应用

将参变极值问题的极大熵函数方法应用到求解平衡规划问题中,通过先验分布信息和Kullback熵概念,给出了平衡规划问题基于Kullback熵表示的熵函数求解方法,并将平衡规划的极大熵函数方法应用于求解混合交通平衡分配问题．     

估计死亡率分布的一个最大熵模型

本文提出了一种估计死亡率分布的新模型一最大熵模型。该模型直接从样本信息出发，不需要对待估分布的概率密度函数或先验分布作任何假定，从而克服了极大似然估计和贝叶斯估计的不足。而且通过两个例子的计算结果，表明该方法与样本数据的拟合效果要好于其它两种方法。     

Generalized beta prior models on fraction defective in reliability test planning

In many reliability analyses, the probability of obtaining a defective unit in a production process should not be considered constant even though the process is stable and in control. Engineering experience or previous data of similar or related products may often be used in the proper selection of a prior model to describe the random fluctuations in the fraction defective. A generalized beta family of priors, several maximum entropy priors and other prior models are considered for this purpose. In order to determine the acceptability of a product based on the lifelengths of some test units, failure-censored reliability sampling plans for location-scale distributions using average producer and consumer risks are designed. Our procedure allows the practitioners to incorporate a restricted parameter space into the reliability analysis, and it is reasonably insensitive to small disturbances in the prior information. Impartial priors are used to reflect prior neutrality between the producer and the consumer when a consensus on the elicited prior model is required. Nonetheless, our approach also enables the producer and the consumer to assume their own prior distributions. The use of substantial prior information can, in many cases, significantly reduce the amount of testing required. However, the main advantage of utilizing a prior model for the fraction defective is not necessarily reduced sample size but improved assessment of the true sampling risks. An example involving shifted exponential lifetimes is considered to illustrate the results.     

区别度诱导的广义模糊熵

广义模糊熵是模糊熵在广义模糊补意义下的推广,本文从区别度的角度给出几个生成广义模糊熵的途径;通过一个具体的区别度公式得到了相应的一些广义模糊熵表达式,为实际使用广义模糊熵做了一些理论上的铺垫.     

Maximising entropy on the nonparametric predictive inference model for multinomial data

The combination of mathematical models and uncertainty measures can be applied in the area of data mining for diverse objectives with as final aim to support decision making. The maximum entropy function is an excellent measure of uncertainty when the information is represented by a mathematical model based on imprecise probabilities. In this paper, we present algorithms to obtain the maximum entropy value when the information available is represented by a new model based on imprecise probabilities: the nonparametric predictive inference model for multinomial data (NPI-M), which represents a type of entropy-linear program. To reduce the complexity of the model, we prove that the NPI-M lower and upper probabilities for any general event can be expressed as a combination of the lower and upper probabilities for the singleton events, and that this model can not be associated with a closed polyhedral set of probabilities. An algorithm to obtain the maximum entropy probability distribution on the set associated with NPI-M is presented. We also consider a model which uses the closed and convex set of probability distributions generated by the NPI-M singleton probabilities, a closed polyhedral set. We call this model A-NPI-M. A-NPI-M can be seen as an approximation of NPI-M, this approximation being simpler to use because it is not necessary to consider the set of constraints associated with the exact model.