【24h】

Merge-Based Computation of Minimal Generators

机译:最小生成器的基于合并的计算

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

摘要

Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for data mining but also for database design purposes. The volatility of many real-world datasets has motivated the study of the evolution in the concept set under various modifications of the initial context. We believe this should be extended to the evolution of mingens. In the present paper, we build up on previous work about the incremental maintenance of the mingen family of a context to investigate the case of lattice merge upon context subposition. We first recall the theory underlying the singleton increment and show how it generalizes to lattice merge. Then we present the design of an effective merge procedure for concepts and mingens together with some preliminary experimental results about its performance.
机译:概念意图的最小生成器(mingens)是形式概念分析(FCA)领域的宝贵元素,已在数据库领域广泛使用,既用于数据挖掘又用于数据库设计。许多现实世界数据集的易变性激发了在​​初始上下文的各种修改下概念集演变的研究。我们认为,这应该扩展到明根族的发展。在本文中,我们基于上下文的mingen族的增量维护的先前工作,以研究上下文子位置上的格合并的情况。我们首先回顾一下单例增量的基础理论,并说明它如何推广到晶格合并。然后,我们提出了一种有效的合并概念和混合程序的设计,以及有关其性能的一些初步实验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号