【24h】

Algebra of Clusterizable Relations

机译:集群关系的代数

获取原文

摘要

Relations are usually represented in a space of attributes whose values differ only in names similar to algebra of sets. The order of the values or any other preference measures are not significant for such attributes. The paper proposes a mathematical model based on n-tuple algebra (NTA), for relations in which the values of attributes are ordered. For this case, a mathematical tool has been developed that can be used to perform not only the previously discussed methods and means of logical-semantic analysis on the basis of NTA, including analysis of defeasible reasoning and logic-probabilistic analysis, but also to analyze the order and connectivity of structures and implement clustering methods. The concept of granules is introduced, the power of connectivity between the granules is defined, and methods to calculate distances between the disconnected granules are proposed. The obtained dependencies make it possible to extend the scope of classification techniques.
机译:关系通常表示在一个属性的空间中,其值仅在类似于集成代数的名称中不同。值或任何其他偏好度量的顺序对于此类属性并不重要。本文提出了一种基于N组组代数(NTA)的数学模型,用于排序属性值的关系。对于这种情况,已经开发了一种数学工具,其不仅可以在NTA的基础上使用先前讨论的逻辑语义分析的方法和手段,包括分析缺陷的推理和逻辑概率分析,而且还可以分析结构与实现聚类方法的顺序和连接性。介绍了颗粒的概念,确定了颗粒之间的连接功率,提出了计算断开颗粒之间的距离的方法。所获得的依赖性使得可以扩展分类技术的范围。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号