文本错误关联规则的层次化
Hiérarchisation des règles d'association en fouille de textes
摘要:
关联规则提取是一种广泛应用的数据采掘方法。然而,这种方法的限制之一来自于大量的提取规则和人类专家处理这些规则的全部的难度。我们建议解决这个问题的结构的规则成层次。因此,专家可以探索规则,从一个规则访问另一个更一般的规则,当我们在层次结构中提升时,另一方面,或更具体的规则。规则分为两个层次。全局级的目标是从提取的规则集合中构建层次结构。因此,我们定义了第一种类型的规则subsomption依赖于伽罗瓦格。第二个层次是对每一条规则进行局部和更详细的分析。它为给定的规则生成一组泛化规则,这些规则被构造成局部层次结构。这就引出了第二种类型的subsomption的定义。该子概念来源于归纳逻辑程序设计,并集成了一个术语模型。
英文摘要:
Extraction of association rules is widely used as a data mining method. However, one of the limit of this approach comes from the large number of extracted rules and the difficulty for a human expert to deal with the totality of these rules. We propose to solve this problem by structuring the set of rules into hierarchy. The expert can then therefore explore the rules, access from one rule to another one more general when we raise up in the hierarchy, and in other hand, or a more specific rules. Rules are structured at two levels. The global level aims at building a hierarchy from the set of rules extracted. Thus we define a first type of rule-subsomption relying on Galois lattices. The second level consists in a local and more detailed analysis of each rule. It generate for a given rule a set of generalization rules structured into a local hierarchy. This leads to the definition of a second type of subsomption. This subsomption comes from inductive logic programming and integrates a terminological model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。