Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-19T00:54:11.949Z Has data issue: false hasContentIssue false
  • English
  • Français

Context matching for electronic marketplaces: a case study

Published online by Cambridge University Press:  06 October 2004

MATTEO BONIFACIO ,
ANTONIA DONÀ ,
ALESSANDRA MOLANI  and
LUCIANO SERAFINI
MATTEO BONIFACIO
Affiliation:
ITC-IRST, Centro per la Ricerca Scientifica e Tecnologica, Panté di Povo, Trento, Italy. E-mail: antodona@itc.it, serafini@itc.it Department of Information Technology, University of Trento, Panté di Povo, Trento, Italy. E-mail: bonifacio@dit.unitn.it, molani@dit.unitn.it
ANTONIA DONÀ
Affiliation:
ITC-IRST, Centro per la Ricerca Scientifica e Tecnologica, Panté di Povo, Trento, Italy. E-mail: antodona@itc.it, serafini@itc.it
ALESSANDRA MOLANI
Affiliation:
ITC-IRST, Centro per la Ricerca Scientifica e Tecnologica, Panté di Povo, Trento, Italy. E-mail: antodona@itc.it, serafini@itc.it Department of Information Technology, University of Trento, Panté di Povo, Trento, Italy. E-mail: bonifacio@dit.unitn.it, molani@dit.unitn.it
LUCIANO SERAFINI
Affiliation:
ITC-IRST, Centro per la Ricerca Scientifica e Tecnologica, Panté di Povo, Trento, Italy. E-mail: antodona@itc.it, serafini@itc.it
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Knowledge Engineering Review , Volume 18 , Issue 4 , December 2003 , pp. 317 - 328
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)