首页> 外文会议>International Conference on Conceptual Structures >Reducing the Representation Complexity of Lattice-Based Taxonomies
【24h】

Reducing the Representation Complexity of Lattice-Based Taxonomies

机译:减少基于格子分类的表示复杂性

获取原文

摘要

Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of. In this respect, many concepts could allegedly be dropped from the lattice without impairing its relevance towards a taxonomy description task at a certain level of detail. We propose a method where the notion of stability is introduced to select potentially more pertinent concepts. We present some theoretical properties of stability and discuss several use cases where taxonomy building is an issue.
机译:代表从大脑构成的概念格子经常导致沉重的复杂图表,可以是处理的,并且最终是为了理解。在这方面,据称,许多概念可以从格子从格子丢失,而不会在一定程度的细节水平的分类任务中损害其与分类学描述任务的相关性。我们提出了一种方法,其中引入了稳定性的概念来选择潜在的更相关的概念。我们展示了一些稳定性的理论属性,并讨论了分类管理是一个问题的几种用例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号