Probabilistic Matchmaking Methods for Automated Service Discovery

被引:44
|
作者
Cassar, Gilbert [1 ]
Barnaghi, Payam [1 ]
Moessner, Klaus [1 ]
机构
[1] Univ Surrey, Ctr Commun Syst Res, Guildford GU2 7XH, Surrey, England
关键词
Computer web services; discovery; machine-learning; probabilistic methods; LDA; WEB SERVICES;
D O I
10.1109/TSC.2013.28
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Automated service discovery enables human users or software agents to form queries and to search and discover the services based on different requirements. This enables implementation of high-level functionalities such as service recommendation, composition, and provisioning. The current service search and discovery on the Web is mainly supported by text and keyword-based solutions which offer very limited semantic expressiveness to service developers and consumers. This paper presents a method using probabilistic machine-learning techniques to extract latent factors from semantically enriched service descriptions. The latent factors are used to construct a model to represent different types of service descriptions in a vector form. With this transformation, heterogeneous service descriptions can be represented, discovered, and compared on the same homogeneous plane. The proposed solution is scalable to large service datasets and provides an efficient mechanism that enables publishing and adding new services to the registry and representing them using latent factors after deployment of the system. We have evaluated our solution against logic-based and keyword-based service search and discovery solutions. The results show that the proposed method performs better than other solutions in terms of precision and normalized discounted cumulative gain values.
引用
收藏
页码:654 / 666
页数:13
相关论文
共 50 条
  • [41] Semantics based enterprise modeling for automated service discovery and service composition
    Chu, Wang
    Qian, Depei
    2ND IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE, PROCEEDINGS, 2007, : 439 - 445
  • [42] Service-oriented matchmaking and brokerage
    Goodale, Tom
    Ludwig, Simone A.
    Naylor, William
    Padget, Julian
    Rana, Omer F.
    PROCEEDINGS OF THE UK E-SCIENCE ALL HANDS MEETING 2006, 2006, : 289 - +
  • [43] Enhanced Web Service Matchmaking A Quality of Service Approach
    Alnahdi, Amany
    Liu, Shih-Hsi
    Melton, Austin
    2015 IEEE WORLD CONGRESS ON SERVICES, 2015, : 341 - 348
  • [44] Towards Extending Service Discovery with Automated Composition Capabilities
    Vaculin, Roman
    Neruda, Roman
    Sycara, Katia
    PROCEEDINGS OF THE SIXTH IEEE EUROPEAN CONFERENCE ON WEB SERVICES, 2008, : 3 - +
  • [45] Automated Summarization of Service Workflows to Facilitate Discovery and Composition
    Kotsikoris, Panagiotis
    Chaikalis, Theodore
    Ampatzoglou, Apostolos
    Chatzigeorgiou, Alexander
    ENASE: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON EVALUATION OF NOVEL APPROACHES TO SOFTWARE ENGINEERING, 2022, : 317 - 326
  • [46] Matchmaking: Identifying and evaluating drug discovery partners
    Arnold, R
    Grindley, J
    DRUG DISCOVERY TODAY, 1996, 1 (02) : 79 - 81
  • [47] Private and secure service discovery via progressive and Probabilistic exposure
    Zhu, Feng
    Zhu, Wei
    Mutka, Matt W.
    Ni, Lionel M.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (11) : 1565 - 1577
  • [48] Service discovery for internet of things based on probabilistic topic model
    Wei, Qiang
    Jin, Zhi
    Xu, Yan
    Ruan Jian Xue Bao/Journal of Software, 2014, 25 (08): : 1640 - 1658
  • [49] BlueSight: Automated Discovery Service for Cloud Migration of Enterprises
    Wu, Dannver
    Hwang, Jinho
    Vukovic, Maja
    Anerousis, Nikos
    SERVICE-ORIENTED COMPUTING - ICSOC 2016 WORKSHOPS, 2017, 10380 : 211 - 215
  • [50] Web Service Matchmaking by Subgraph Matching
    Seba, Hamida
    Lagraa, Sofiane
    Kheddouci, Hamamache
    WEB INFORMATION SYSTEMS AND TECHNOLOGIES, 2012, 101 : 43 - +