The goal of this technical report is to describe the theory and the specification of an algorithm for the semantic coordination of hierarchical classifications with attributes (ACH). ACH's are trees whose nodes are labeled with a mnemonic label and a set of attributes also labeled with mnemonic labels. ACH's can be used to classify items, (e.g., documents, pictures, etc.) by associating them to a node, and by specifying, for each attribute of the node a proper value. Many schemata used to organize and access data can be seen as a (set of) ACHs. Examples are relational and object database schemata, hierarchical catalogs with attributes. etc. A large amount of data, organized in heterogeneous hierarchical classifications, is now available through the web. The problem of matching such schemata has been recognized as one of the main challange of the semantic web in order to allow global access. The contribution of this technical report is in the direction of extending and restructuring the CtxMatch algorithm introduced in the last years for matching attribute free hierarchical classifications. The contribution is twofold. The first extension of CtxMatch concerns the interpretation of arcs in terms of relations between concepts, the second contribution concerns the semantic interpretation of attributes. In order to represent the semantics of ACH's we have adopted description logics (rather than propositional logic). The algorithm proposed in this paper is called ctxmatch2
Semantic coordination of hierarchical classifications with attributes
Serafini, Luciano;
2004-01-01
Abstract
The goal of this technical report is to describe the theory and the specification of an algorithm for the semantic coordination of hierarchical classifications with attributes (ACH). ACH's are trees whose nodes are labeled with a mnemonic label and a set of attributes also labeled with mnemonic labels. ACH's can be used to classify items, (e.g., documents, pictures, etc.) by associating them to a node, and by specifying, for each attribute of the node a proper value. Many schemata used to organize and access data can be seen as a (set of) ACHs. Examples are relational and object database schemata, hierarchical catalogs with attributes. etc. A large amount of data, organized in heterogeneous hierarchical classifications, is now available through the web. The problem of matching such schemata has been recognized as one of the main challange of the semantic web in order to allow global access. The contribution of this technical report is in the direction of extending and restructuring the CtxMatch algorithm introduced in the last years for matching attribute free hierarchical classifications. The contribution is twofold. The first extension of CtxMatch concerns the interpretation of arcs in terms of relations between concepts, the second contribution concerns the semantic interpretation of attributes. In order to represent the semantics of ACH's we have adopted description logics (rather than propositional logic). The algorithm proposed in this paper is called ctxmatch2I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
