首页> 外文期刊>Mathematics in Computer Science >Thinning Out Redundant Empirical Data
【24h】

Thinning Out Redundant Empirical Data

机译:细化冗余经验数据

获取原文
获取原文并翻译 | 示例
       

摘要

Given a set ${mathbb{X}}$ of “empirical” points, whose coordinates are perturbed by errors, we analyze whether it contains redundant information, that is whether some of its elements could be represented by a single equivalent point. If this is the case, the empirical information associated to ${mathbb{X}}$ could be described by fewer points, chosen in a suitable way. We present two different methods to reduce the cardinality of ${mathbb{X}}$ which compute a new set of points equivalent to the original one, that is representing the same empirical information. Though our algorithms use basic notions of Cluster Analysis they are specifically designed for “thinning out” redundant data. We include some experimental results which illustrate the practical effectiveness of our methods.
机译:给定一组$ {mathbb {X}} $的“经验”点,其坐标会受到误差的干扰,我们将分析其是否包含冗余信息,也就是说,其某些元素是否可以由单个等效点表示。在这种情况下,可以通过较少的点(以适当的方式选择)来描述与$ {mathbb {X}} $相关的经验信息。我们提出了两种不同的方法来减少$ {mathbb {X}} $的基数,它们计算出了一组与原始点等效的新点,这些点表示相同的经验信息。尽管我们的算法使用了聚类分析的基本概念,但它们是专为“稀疏”冗余数据而设计的。我们包括一些实验结果,这些结果说明了我们方法的实际有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号