首页> 外文会议>International Conference on Conceptual Structures(ICCS 2007); 20070722-27; Sheffield(GB) >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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号