The algorithm for the integration of classes/concepts which results in an ontology suitable for the preservation of database classes/concepts is described. It has been designed by means of original research at the boundary between mathematics, computer science and concept theory. The input conceptual graph of this algorithm is determined as a solution of a data mining problem, which has been approached as inverse mapping of conceptual database design. Similarities and differences are discussed between an algorithm formalized in concept theory, which is nor suitable for implementation, and the algorithm for the integration of classes/concepts, which exploits the benefits of database notations.
Preservation of database concepts: from data mining to concept theory
Locuratolo E I
2015
Abstract
The algorithm for the integration of classes/concepts which results in an ontology suitable for the preservation of database classes/concepts is described. It has been designed by means of original research at the boundary between mathematics, computer science and concept theory. The input conceptual graph of this algorithm is determined as a solution of a data mining problem, which has been approached as inverse mapping of conceptual database design. Similarities and differences are discussed between an algorithm formalized in concept theory, which is nor suitable for implementation, and the algorithm for the integration of classes/concepts, which exploits the benefits of database notations.| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_335912-doc_105014.pdf
solo utenti autorizzati
Descrizione: Preservation of database concepts: from data mining to concept theory
Dimensione
982.96 kB
Formato
Adobe PDF
|
982.96 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
