A Cost-Bounded Algorithm to Control Events Generalization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

A Cost-Bounded Algorithm to Control Events Generalization

Résumé

In order to build descriptions of prototypical situations, we first developed a system, MLK (Memorization for Learning Knowledge), allowing us to gather events related to similar situations starting from descriptions found in texts, these events being represented by conceptual graphs. One of the stages to build these prototypes consists of generalizing some similar graphs in order to produce a description. In this paper, we present a cost bounded algorithm of conceptual graph generalization, proceeding by ascending clustering. The use of costs on the operations of generalization allows us to control the growth of the search space.
Fichier principal
Vignette du fichier
ICCS2000GCOFBGFinal.pdf (145.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02458242 , version 1 (28-01-2020)

Identifiants

  • HAL Id : hal-02458242 , version 1

Citer

Gaël De Chalendar, Brigitte Grau, Olivier Ferret. A Cost-Bounded Algorithm to Control Events Generalization. Conceptual Structures: Logical, Linguistic, and Computational Issues, 8th International Conference on Conceptual Structures, ICCS 2000, 2000, Darmstadt, Germany. pp.555--568. ⟨hal-02458242⟩
24 Consultations
65 Téléchargements

Partager

Gmail Facebook X LinkedIn More