An ontology matching approach for semantic modeling: A case study in smart cities

This paper investigates the semantic modeling of smart cities and proposes two ontology matching frameworks, called Clustering for Ontology Matching-based Instances (COMI) and Pattern mining for Ontology Matching-based Instances (POMI). The goal is to discover the relevant knowledge by investigating the correlations among smart city data based on clustering and pattern mining approaches. The COMI method first groups the highly correlated ontologies of smart-city data into similar clusters using the generic k-means algorithm. The key idea of this method is that it clusters the instances of each ontology and then matches two ontologies by matching their clusters and the corresponding instances within the clusters. The POMI method studies the correlations among the data properties and selects the most relevant properties for the ontology matching process. To demonstrate the usefulness and accuracy of the COMI and POMI frameworks, several experiments on the DBpedia, Ontology Alignment Evaluation Initiative, and NOAA ontology databases were conducted. The results show that COMI and POMI outperform the state-of-the-art ontology matching models regarding computational cost without losing the quality during the matching process. Furthermore, these results confirm the ability of COMI and POMI to deal with heterogeneous large-scale data in smart-city environments.publishedVersio

An Algerian Corpus and an Annotation Platform for Opinion and Emotion Analysis

International audienceIn this paper, we address the lack of resources for opinion and emotion analysis related to North African dialects, targeting Algerian dialect. We present TWIFIL (TWItter proFILing) a collaborative annotation platform for crowdsourcing annotation of tweets at different levels of granularity. The plateform allowed the creation of the largest Algerian dialect dataset annotated for both sentiment (9,000 tweets), emotion (about 5,000 tweets) and extra-linguistic information including author profiling (age and gender). The annotation resulted also in the creation of the largest Algerien dialect subjectivity lexicon of about 9,000 entries which can constitute a valuable resources for the development of future NLP applications for Algerian dialect. To test the validity of the dataset, a set of deep learning experiments were conducted to classify a given tweet as positive, negative or neutral. We discuss our results and provide an error analysis to better identify classification errors

Le dialogue argumentatif pour la réconciliation d’ontologies: application au E-recrutement

Dans un système Multi-Agents (SMA), les agents sont hétérogènes. Ainsi, pour qu’ils exploitent les services disponibles, ils doivent être capables de communiquer entre eux. C’est dans ce contexte que les ontologies vont être étudiées dans un but d’améliorer l’interopérabilité. Chaque agent possède sa propre ontologie et l’utilise pour décrire formellement ses connaissances. Nous nous intéressons dans cet article à la réconciliation des ontologies entre agents dans le cadre du recrutement électronique. Notre contribution consiste à réaliser un système dialogique permettant d’assurer un rapprochement sémantique entre les offres et les demandes d’emploi. Une architecture, basée sur la négociation pour permettre aux agents d’aboutir à un consensus sur leurs représentations est adoptée.Mots clés: ontologies ; logique de description ; dialogue ; conflits ; argumentation ; agent

Exploring Pattern Mining for Solving the Ontology Matching Problem

This paper deals with the ontology matching problem, and proposes a pattern mining approach that exploits the different correlation and dependencies between the different properties to select the most appropriate features for the matching process. The proposed method first discovers the frequent patterns from the ontology database, and then find out the most relevant features using the patterns derived. To demonstrate the usefulness of the suggested method, several experiments have been carried out on the DBpedia ontology databases. The results show that our proposal outperforms the state-of-the-art ontology matching approaches in terms of both execution time and quality of the matching process

An ontology matching approach for semantic modeling: A case study in smart cities

This paper investigates the semantic modeling of smart cities and proposes two ontology matching frameworks, called Clustering for Ontology Matching-based Instances (COMI) and Pattern mining for Ontology Matching-based Instances (POMI). The goal is to discover the relevant knowledge by investigating the correlations among smart city data based on clustering and pattern mining approaches. The COMI method first groups the highly correlated ontologies of smart-city data into similar clusters using the generic k-means algorithm. The key idea of this method is that it clusters the instances of each ontology and then matches two ontologies by matching their clusters and the corresponding instances within the clusters. The POMI method studies the correlations among the data properties and selects the most relevant properties for the ontology matching process. To demonstrate the usefulness and accuracy of the COMI and POMI frameworks, several experiments on the DBpedia, Ontology Alignment Evaluation Initiative, and NOAA ontology databases were conducted. The results show that COMI and POMI outperform the state-of-the-art ontology matching models regarding computational cost without losing the quality during the matching process. Furthermore, these results confirm the ability of COMI and POMI to deal with heterogeneous large-scale data in smart-city environments

An ontology matching approach for semantic modeling: A case study in smart cities

This paper investigates the semantic modeling of smart cities and proposes two ontology matching frameworks, called Clustering for Ontology Matching-based Instances (COMI) and Pattern mining for Ontology Matching-based Instances (POMI). The goal is to discover the relevant knowledge by investigating the correlations among smart city data based on clustering and pattern mining approaches. The COMI method first groups the highly correlated ontologies of smart-city data into similar clusters using the generic k-means algorithm. The key idea of this method is that it clusters the instances of each ontology and then matches two ontologies by matching their clusters and the corresponding instances within the clusters. The POMI method studies the correlations among the data properties and selects the most relevant properties for the ontology matching process. To demonstrate the usefulness and accuracy of the COMI and POMI frameworks, several experiments on the DBpedia, Ontology Alignment Evaluation Initiative, and NOAA ontology databases were conducted. The results show that COMI and POMI outperform the state-of-the-art ontology matching models regarding computational cost without losing the quality during the matching process. Furthermore, these results confirm the ability of COMI and POMI to deal with heterogeneous large-scale data in smart-city environments

GFSOM: Genetic Feature Selection for Ontology Matching

This paper studies the ontology matching problem and proposes a genetic feature selection approach for ontology matching (GFSOM), which exploits the feature selection using the genetic approach to select the most appropriate properties for the matching process. Three strategies are further proposed to improve the performance of the designed approach. The genetic algorithm is first performed to select the most relevant properties, and the matching process is then applied to the selected properties instead of exploring all properties of the given ontology. To demonstrate the usefulness and accuracy of the GFSOM framework, several experiments on DBpedia ontology database are conducted. The results show that the ontology matching process benefits from the feature selection and the genetic algorithm, where GFSOM outperforms the state-of-the-art ontology matching approaches in terms of both the execution time and quality of the matching process