|
Matchmaking for Structured Objects
Eiter, Thomas
;
Veit, Daniel J.
;
Müller, Jörg P.
;
Schneider, Martin
|
DOI:
|
https://doi.org/10.1007/3-540-44801-2_19
|
|
Document Type:
|
Conference or workshop publication
|
|
Year of publication:
|
2001
|
|
Book title:
|
Data Warehousing and Knowledge Discovery : Third International Conference, DaWaK 2001 Munich, Germany, September 5–7, 2001; proceeding
|
|
The title of a journal, publication series:
|
Lecture Notes in Computer Science
|
|
Volume:
|
2114
|
|
Page range:
|
186-194
|
|
Date of the conference:
|
September 5 - 9, 2001
|
|
Publisher:
|
Kambayashi, Yahiko
|
|
Place of publication:
|
Berlin [u.a.]
|
|
Publishing house:
|
Springer
|
|
ISBN:
|
3-540-42553-5 , 978-3-540-42553-3 , 978-3-540-44801-3
|
|
Publication language:
|
English
|
|
Institution:
|
Business School > Dieter-Schwarz-Stiftungslehrstuhl für ABWL, E-Business u. E-Government (Veit -2013)
|
|
Subject:
|
330 Economics
|
|
Keywords (English):
|
Emerging trends , data warehouses , systems and applications , E-Business
|
|
Abstract:
|
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approaches to matchmaking have been proposed so far, which involve computation of distances between service offers and service requests that are both provided as aggregates of the same set of attributes which have atomic values. In this paper, we consider the problem of matchmaking in the setting where both service offers and requests are described in a richer language, which has complex types built from basic types using constructors such as sets, lists, or record aggregation. We investigate methods for computing distance values of complex objects, based on a generic combination of distance values of the object components, as well as domain-dependent distance functions. The methods have been implemented in Grappa, the Generic Request Architecture for Passive Provider Agents, which is a framework for developing open matchmaking facilities that can handle complex objects described in XML. Using Grappa, a large scale application has been built in the Human Resource Network project of the Office for Labor Exchange of the German government, in which job offerings have to be matched against a large database of unemployed persons and qualified candidates should be retrieved.
|
 | Dieser Datensatz wurde nicht während einer Tätigkeit an der Universität Mannheim veröffentlicht, dies ist eine Externe Publikation. |
 Search Authors in
You have found an error? Please let us know about your desired correction here: E-Mail
Actions (login required)
 |
Show item |
|
