Web服务搜索引擎的WSRank方法研究

摘要

Web service retrieval difficulties hampers the speed of its application and development.After realizing a web service search engine named WSSE, how to rank the services becomes the focus.The novel WSRank algorithm is advanced through analyzing the web services distribution structure and mutual relationship based on the crawling features, and learning from the famous PageRank Algorithm and its improved research achievements.The rank values are iteratively calculated, and then the web services are sorted by the values in a non-increasing order.The experiments show that the algorithm can improve the accuracy of Web service search.%Web服务检索的困难阻碍了其应用和发展的速度.在实现了一个Web服务搜索引擎WSSE后,服务的排序成为需要解决的问题.通过Web服务爬虫的爬行特点分析Web服务的分布结构和相互关系,借鉴著名的网页排序算法PageRank及其改进算法的研究成果,创新地提出WSRank算法.迭代计算各服务的排序值,按值进行非递增排序.实验表明,本算法能提高Web服务检索的准确性.