IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Dynamic Service Matchmaking Model and Algorithm

Dynamic Service Matchmaking Model and Algorithm
View Sample PDF
Author(s): Haixia Pan (Beihang University, China), Jing Wang (Beihang University, China)and Michitaka Kosaka (Japan Advanced Institute of Science and Technology, Japan)
Copyright: 2014
Pages: 15
Source title: Progressive Trends in Knowledge and System-Based Science for Service Innovation
Source Author(s)/Editor(s): Michitaka Kosaka (Japan Advanced Institute of Science and Technology, Japan)and Kunio Shirahada (Japan Advanced Institute of Science and Technology, Japan)
DOI: 10.4018/978-1-4666-4663-6.ch011

Purchase

View Dynamic Service Matchmaking Model and Algorithm on the publisher's website for pricing and purchasing information.

Abstract

In the service industry, individual customer service requirements are different from the market demands. The requirements determined by the market demand are called static requirements, and those determined by individual customers in specific service processes are dynamic requirements. The service system is constructed according to the static requirements, to meet the market demand, and then, in each service process, the service system must combine its capabilities with the dynamic requirements of the specified customer to provide customized services. Using the dynamic requirements as input, the service system realizes its value in co-creation with the customers more efficiently. Dynamic service matchmaking is the process of matching the dynamic requirements of a specific customer to the service system’s capabilities, giving the most suitable service recommendation or customization. By using the theory of Ontology, the authors present a dynamic requirement description model. In this model, they first decompose services and requirements into sub-items. They then map these items to requirement ontology trees to calculate the similarity between service and requirement items. Finally, the authors calculate the weighted average of those similarities as the result of matchmaking. A dynamic service matchmaking problem is presented as an example for further explanation. The multi-stage dynamic matchmaking model takes this issue for a more complex situation and tries to compose a service bundle for a series of dynamic requirements.

Related Content

Muhammad Faisal Sultan, Muhammad Nawaz Tunio, Imamuddin. © 2026. 10 pages.
Muhammad Faisal Sultan, Aamir Firoz Shamsi, Kashif Mehmood. © 2026. 10 pages.
R. Arunachalam, R. Amudha. © 2026. 28 pages.
Muhammad Faisal Sultan, Abdul Kabeer Kazi, Muhammad Asim Rafique. © 2026. 12 pages.
Bushra Qamar. © 2026. 22 pages.
Rija Anwar. © 2026. 20 pages.
Choi-Meng Leong. © 2026. 20 pages.
Body Bottom