【24h】

Matching Hierarchical Classifications with Attributes

机译:将分层分类与属性匹配

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

摘要

Hierarchical Classifications with Attributes are tree-like structures used for organizing/classifying data. Due to the exponential growth and distribution of information across the network, and to the fact that such information is usually clustered by means of this kind of structures, we assist nowadays to an increasing interest in finding techniques to define mappings among such structures. In this paper, we propose a new algorithm for discovering mappings across hierarchical classifications, which faces the matching problem as a problem of deducing relations between sets of logical terms representing the meaning of hierarchical classification nodes.
机译:具有属性的分层分类是用于组织/分类数据的树状结构。由于信息在网络中呈指数级增长和分布,并且由于此类信息通常是通过这种结构进行聚类的事实,因此,当今我们对寻找在这些结构之间定义映射的技术的兴趣日益浓厚。在本文中,我们提出了一种用于发现跨层次分类的映射的新算法,该算法面临匹配问题,即推导代表层次分类节点含义的逻辑项集之间的关系的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号