Finding Semi-Automatically a Greatest Common Model Thanks to Formal Concept Analysis - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2013

Finding Semi-Automatically a Greatest Common Model Thanks to Formal Concept Analysis

Abstract

Data integration and knowledge capitalization combine data and information coming from different data sources designed by different experts having different purposes. In this paper, we propose to assist the underlying model merging activity. For close models made by experts of various specialities on the same system, we partially automate the identification of a Greatest Common Model (GCM) which is composed of the common concepts (core-concepts) of the different models. Our methodology is based on Formal Concept Analysis which is a method of data analysis based on lattice theory. A decision tree allows to semiautomatically classify concepts from the concept lattices and assist the GCM extraction. We apply our approach on the EIS-Pesticide project, an environmental information system which aims at centralizing knowledge and information produced by different research teams.
No file

Dates and versions

lirmm-01319858 , version 1 (23-05-2016)

Identifiers

Cite

Bastien Amar, Abdoulkader Osman Guédi, André Miralles, Marianne Huchard, Thérèse Libourel Rouge, et al.. Finding Semi-Automatically a Greatest Common Model Thanks to Formal Concept Analysis. ICEIS: International Conference on Enterprise Information Systems, Jun 2012, Wroclaw, Poland. pp.72-91, ⟨10.1007/978-3-642-40654-6_5⟩. ⟨lirmm-01319858⟩
347 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More