Web service clustering using multidimensional angles as proximity measures
作者: Christian PlatzerFlorian RosenbergSchahram Dustdar
刊名: ACM Transactions on Internet Technology (TOIT), 2009, Vol.9 (3), pp.1-26
来源数据库: Association for Computing Machinery Journal
DOI: 10.1145/1552291.1552294
关键词: Web serviceclusteringdiscoverysearchsearch enginesservice discoveryvector space
原始语种摘要: Increasingly, application developers seek the ability to search for existing Web services within large Internet-based repositories. The goal is to retrieve services that match the user's requirements. With the growing number of services in the repositories and the challenges of quickly finding the right ones, the need for clustering related services becomes evident to enhance search engine results with a list of similar services for each hit. In this article, a statistical clustering approach is presented that enhances an existing distributed vector space search engine for Web services with the possibility of dynamically calculating clusters of similar services for each hit in the list found by the search engine. The focus is laid on a very efficient and scalable clustering implementation...
全文获取路径: ACM 

  • clustering 聚类
  • proximity 邻近
  • Web 
  • quickly 快速地
  • large 大的
  • scalable 修]可伸缩[缩放
  • finding 搜索寻线
  • existing 现行
  • engine 发动机
  • measures 层组