基于改进的 Biterm 主题模型的智能网络服务发现框架

IF 3.4 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yuan Yuan;Yegang Du;Jun Pan
{"title":"基于改进的 Biterm 主题模型的智能网络服务发现框架","authors":"Yuan Yuan;Yegang Du;Jun Pan","doi":"10.1109/ACCESS.2024.3472692","DOIUrl":null,"url":null,"abstract":"Given the proliferation of Web services, effectively identifying the most suitable ones based on user queries poses a formidable challenge. In response to the challenges posed by the reduced efficiency of service discovery methods as the number of services continues to grow and the limited co-occurrence of word frequencies in service description documents, this study proposes an intelligent service discovery framework based on probabilistic topic distribution. The framework utilizes the Biterm Topic Model to extract the probabilistic topic distribution from both service description documents and user requirements. It then performs functional clustering and service matching based on this probabilistic topic distribution, resulting in a set of candidate services. To expedite the training process of the topic model, a topic model training algorithm employing sampling recombination is introduced, which reorganizes the topic sampling process and reduces training time. Additionally, a functional clustering algorithm based on weighted connected graphs is presented to enhance the quality of clustering. Experimental results validate the effectiveness of the proposed framework, which significantly reduces the training time required for the topic model and service discovery while improving the accuracy of service discovery and the normalized discounted cumulative gain.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"12 ","pages":"144437-144455"},"PeriodicalIF":3.4000,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10704723","citationCount":"0","resultStr":"{\"title\":\"An Intelligent Web Service Discovery Framework Based on Improved Biterm Topic Model\",\"authors\":\"Yuan Yuan;Yegang Du;Jun Pan\",\"doi\":\"10.1109/ACCESS.2024.3472692\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given the proliferation of Web services, effectively identifying the most suitable ones based on user queries poses a formidable challenge. In response to the challenges posed by the reduced efficiency of service discovery methods as the number of services continues to grow and the limited co-occurrence of word frequencies in service description documents, this study proposes an intelligent service discovery framework based on probabilistic topic distribution. The framework utilizes the Biterm Topic Model to extract the probabilistic topic distribution from both service description documents and user requirements. It then performs functional clustering and service matching based on this probabilistic topic distribution, resulting in a set of candidate services. To expedite the training process of the topic model, a topic model training algorithm employing sampling recombination is introduced, which reorganizes the topic sampling process and reduces training time. Additionally, a functional clustering algorithm based on weighted connected graphs is presented to enhance the quality of clustering. Experimental results validate the effectiveness of the proposed framework, which significantly reduces the training time required for the topic model and service discovery while improving the accuracy of service discovery and the normalized discounted cumulative gain.\",\"PeriodicalId\":13079,\"journal\":{\"name\":\"IEEE Access\",\"volume\":\"12 \",\"pages\":\"144437-144455\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10704723\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Access\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10704723/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10704723/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

鉴于网络服务的激增,根据用户查询有效识别最合适的服务是一项艰巨的挑战。随着服务数量的不断增长,服务发现方法的效率降低,而服务描述文档中的词频共现又有限,为了应对这些挑战,本研究提出了一种基于概率主题分布的智能服务发现框架。该框架利用 Biterm 主题模型从服务描述文档和用户需求中提取概率主题分布。然后,框架根据概率主题分布进行功能聚类和服务匹配,最终生成一组候选服务。为了加快主题模型的训练过程,引入了一种采用采样重组的主题模型训练算法,该算法重组了主题采样过程,缩短了训练时间。此外,还提出了一种基于加权连接图的功能聚类算法,以提高聚类质量。实验结果验证了所提框架的有效性,它大大缩短了主题模型和服务发现所需的训练时间,同时提高了服务发现的准确性和归一化折现累积增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Intelligent Web Service Discovery Framework Based on Improved Biterm Topic Model
Given the proliferation of Web services, effectively identifying the most suitable ones based on user queries poses a formidable challenge. In response to the challenges posed by the reduced efficiency of service discovery methods as the number of services continues to grow and the limited co-occurrence of word frequencies in service description documents, this study proposes an intelligent service discovery framework based on probabilistic topic distribution. The framework utilizes the Biterm Topic Model to extract the probabilistic topic distribution from both service description documents and user requirements. It then performs functional clustering and service matching based on this probabilistic topic distribution, resulting in a set of candidate services. To expedite the training process of the topic model, a topic model training algorithm employing sampling recombination is introduced, which reorganizes the topic sampling process and reduces training time. Additionally, a functional clustering algorithm based on weighted connected graphs is presented to enhance the quality of clustering. Experimental results validate the effectiveness of the proposed framework, which significantly reduces the training time required for the topic model and service discovery while improving the accuracy of service discovery and the normalized discounted cumulative gain.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信