Dynamic service match-making model and algorithm

Author

Pan, Haixia ; Wang, Jing ; Kosaka, Michitaka

Author_Institution

Sch. of Econ. & Manage., BeiHang Univ., Beijing, China

fYear

2012

fDate

2-4 July 2012

Firstpage

744

Lastpage

748

Abstract

The model and algorithm to determine appropriate services for dynamic requirements are developed. Customer requirements are classified into static and dynamic requirements, then the services and dynamic requirements are decomposed within the same dimensions into specialized sub items. By mapping these decomposed sub items to the same ontology concept tree, the similarity between a service and the corresponding dynamic requirement can be calculated. The weighted average of theses similarities are calculated for eventually determining the matching value of the service and dynamic requirements. Comparing different service and dynamic requirements matching values helps service providers to make better service match-making choice.

Keywords

customer services; ontologies (artificial intelligence); pattern matching; trees (mathematics); customer requirements; decomposed subitems; dynamic requirements; dynamic service match-making model; ontology concept tree; service providers; static requirements; Collaboration; Dynamic scheduling; Educational institutions; Heuristic algorithms; Ontologies; Vegetation; Dynamic Requirements; Dynamic Service Match-making; Static Requirements;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Systems and Service Management (ICSSSM), 2012 9th International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4577-2024-6

Type

conf

DOI

10.1109/ICSSSM.2012.6252339

Filename

6252339