Using Association Rules as Semantics for Domain Ontologies

Oumar Sy ()
Additional contact information
Oumar Sy: Université Gaston BERGER/U.F.R Sciences Appliquées et de Technologie (Comp. Sc.), Saint-Louis, Sénégal

Conferences of the department Informatics, 2019, issue 1, 233-246

Abstract: Association rules and ontologies both are domain-based knowledge. How-ever, the first is an unexpected discovered knowledge from databases, while the second is a priori knowledge. In this paper, based on a generic meta-schema as common referential and theoretical foundation, we show how a set of computed and pruned association rules can be useful to enriching a domain ontology. To this end, the meta-schema is scanned with the itemsets appearing in each associ-ation rule. Then, according to the formal links between the concepts or the at-tributes involved, a semantic-based check constraint is built. As a result, the ontology and the database can continuously be monitored with a new semantics.

Keywords: Domain ontology; Association Rule; Semantics; Meta-Schema; Relational database; SQL (search for similar items in EconPapers)
JEL-codes: C8 (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://informatics.ue-varna.bg/conference19/Conf.p ... .years%20233-246.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vrn:katinf:y:2019:i:1:p:233-246

Access Statistics for this article

Conferences of the department Informatics is currently edited by Vladimir Sulov

More articles in Conferences of the department Informatics from Publishing house Science and Economics Varna Contact information at EDIRC.
Bibliographic data for series maintained by Vladimir Sulov ().