Proceedings of the 10th international conference on World Wide Web
Learning to map between ontologies on the semantic web
Proceedings of the 11th international conference on World Wide Web
Call for Participants: The E-Commerce Product Classification Challenge
IEEE Intelligent Systems
Product Classification Integration for E-Commerce
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Representing and reasoning about mappings between domain models
Eighteenth national conference on Artificial intelligence
MITRE: description of the Alembic system used for MUC-6
MUC6 '95 Proceedings of the 6th conference on Message understanding
Phrase parsing with rule sequence processors: an application to the shared CoNLL task
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
A SAT-based algorithm for context matching
CONTEXT'03 Proceedings of the 4th international and interdisciplinary conference on Modeling and using context
| Hi-index | 0.00 |
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.