首页> 外文OA文献 >Probabilities, Intervals, What Next? Optimization Problems Related to Extension Interval Computations to Situations with Partial Information about Probabilities
【2h】

Probabilities, Intervals, What Next? Optimization Problems Related to Extension Interval Computations to Situations with Partial Information about Probabilities

机译:概率,间隔,下一步是什么?与概率部分信息情形的扩展区间计算相关的优化问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

When we have only interval ranges [xi-,xi+] of sample values x1,...,xn, what is the interval [V-,V+] of possible values for the variance V of these values? We prove that the problem of computing the upper bound V+ is NP-hard. We provide a feasible (quadratic time) algorithm for computing the exact lower bound V- on the variance of interval data. We also provide feasible algorithms that computes V+ under reasonable easily verifiable conditions, in particular, in case interval uncertainty is introduced to maintain privacy in a statistical database.We also extend the main formulas of interval arithmetic for different arithmetic operations x1 op x2 to the case when, for each input xi, in addition to the interval [xi]=[xi-,xi+] of possible values, we also know its mean Ei (or an interval [Ei] of possible values of the mean), and we want to find the corresponding bounds for y = x1 op x2 and its mean. In this case, we are interested not only in the bounds for y, but also in the bounds for the mean of y. We formulate and solve the corresponding optimization problems, and describe remaining open problems.
机译:当我们只有样本值x1,...,xn的区间范围[xi-,xi +]时,这些值的方差V的可能值的区间[V-,V +]是多少?我们证明了计算上限V +的问题是NP-难的。我们提供了一种可行的(二次时间)算法,用于计算区间数据方差的确切下界V-。我们还提供了在合理且易于验证的条件下计算V +的可行算法,尤其是在引入间隔不确定性以维护统计数据库中的隐私的情况下。我们还针对不同的算术运算x1 op x2扩展了区间算术的主要公式当对于每个输入xi,除了可能的值间隔[xi] = [xi-,xi +]之外,我们还知道其平均值Ei(或平均值的可能值的间隔[Ei])时,我们想要查找y = x1 op x2的相应范围及其平均值。在这种情况下,我们不仅对y的范围感兴趣,而且对y均值的范围感兴趣。我们制定并解决相应的优化问题,并描述尚待解决的问题。

著录项

  • 作者

    Kreinovich Vladik;

  • 作者单位
  • 年度 2003
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号