Matching algorithms automatically discover semantic relations between two autonomously developed conceptual representations of two overlapping domains. Typical examples of such conceptualisations are electronic market catalogues (e.g., unspsc and eCl@ss) and Web directories (e.g., google and yahoo). The objective of this paper is the description of a use case in which the matching algorithm CtxMatch, developed at ITC-IRST and the University of Trento, has been used to re-classify into the Universal Standard Products and Services Classification (unspsc) the catalogue of office equipment and accessories used by a worldwide telecommunication company to classify its suppliers. On the basis of this experience we are envisaging new applications of the algorithm in the area of demand aggregation. We conclude the paper by briefly describing a future application in this area.
Abstract: Matching algorithms automatically discover semantic relations between two autonomously developed conceptual representations of two overlapping domains. Typical examples of such conceptualisations are electronic market catalogues (e.g., unspsc and eCl@ss) and Web directories (e.g., google and yahoo). The objective of this paper is the description of a use case in which the matching algorithm CtxMatch, developed at ITC-IRST and the University of Trento, has been used to re-classify into the Universal Standard Products and Services Classification (unspsc) the catalogue of office equipment and accessories used by a worldwide telecommunication company to classify its suppliers. On the basis of this experience we are envisaging new applications of the algorithm in the area of demand aggregation. We conclude the paper by briefly describing a future application in this area.
