A Graph Matching Algorithm to extend Wise Systems with Semantic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Graph Matching Algorithm to extend Wise Systems with Semantic

Résumé

Software technology has exponentially evolved lead- ing to the development of intelligent applications using artificial intelligence models and techniques. Such development impacts all scientific and social fields: home automation, medicine, com- munication, etc. To make those new applications useful to a larger number of people, researchers are working on how to integrate artificial intelligence into real world while respecting the notion of calm technology. This paper fits in the context of the development of intelligent systems termed “wise systems” that aim at satisfying the calm technology requirement. Those systems are based on the concept of “Wise Object”: a software entity – object, service, component, application, etc. – able to learn by itself how it is expected to behave and how it is used by a human or another software entity. During its learning process, a Wise Object constructs a graph that represents its behavior and the way it is used. A major weakness of Wise Objects is that the numerical information that they generate is mostly meaningless to humans. Therefore the objective of the work presented in this paper is to extend Wise Objects with semantic that enable them communicate with humans whose attention will consequently be less involved. In this paper, we address the issue of how to relate two different views using two state-based formalisms: State Transition Graph for views generated by the Wise Objects and Input Output Symbolic Transition System for conceptual views. Our proposal extends previous work done to extend the generated information with the conceptual knowledge using a matching algorithm founded on graph morphism. The first version of the algorithm has several limitations and constraints on the graphs that make it difficult to use in realistic cases. In this paper, we propose to generalize the algorithm and raise those restrictions. To illustrate the complete process, the construction of a sample graph matching on a home-automation system is considered.
Fichier principal
Vignette du fichier
4672.pdf (473.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04419947 , version 1 (31-01-2024)

Identifiants

Citer

Abdelhafid Dahhani, Ilham Alloui, Sébastien Monnet, Flavien Vernier. A Graph Matching Algorithm to extend Wise Systems with Semantic. 18th Conference on Computer Science and Intelligence Systems, Sep 2023, Warsaw (POLAND), Poland. pp.411-420, ⟨10.15439/2023f4672⟩. ⟨hal-04419947⟩

Collections

UNIV-SAVOIE LISTIC
12 Consultations
12 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More