期刊文献+

Towards structural web services discovery

Towards structural web services discovery
下载PDF
导出
摘要 A syntactic and structural matching mechanism for service discovery was put forward, which tries to exploit the underlying semantics of web services to enhance tbe traditional syntactic service discovery. We commit WSDL (Web Service Description Language) as service description language. The syntactic matching mechanism is based on the textual similarity among WSDL documents using VSM ( Vector Space Model). The structural information is extracted from WSDL document tree or the invocation sequence of a series of services which can be viewed as the problem of graph isomorphism. Then we combine the syntactic and structural similarity linearly to calculate the service similarity. Finally we provide a novel web services discovery framework named SG^* to find the exact services meeting the users' goals based on service similarity. A syntactic and structural matching mechanism for service discovery was put forward, which tries to exploit the underlying semantics of web services to enhance the traditional syntactic service discovery. We commit WSDL (Web Service Description Language) as service description language. The syntactic matching mechanism is based on the textual similarity among WSDL documents using VSM (Vector Space Model). The structural information is extracted from WSDL document tree or the invocation sequence of a series of services which can be viewed as the problem of graph isomorphism. Then we combine the syntactic and structural similarity linearly to calculate the service similarity. Finally we provide a novel web services discovery framework named SG* to find the exact services meeting the users' goals based on service similarity.
作者 陈江锋
出处 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2008年第3期297-301,共5页 哈尔滨工业大学学报(英文版)
关键词 web services service discovery VSM web服务 前向结构 向量空间模型 互联网
  • 相关文献

参考文献12

  • 1Kamal Nigam,Andrew Kachites Mccallum,Sebastian Thrun,Tom Mitchell.Text Classification from Labeled and Unlabeled Documents using EM[J].Machine Learning (-).2000(2-3)
  • 2Scott Cost,Steven Salzberg.A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features[J].Machine Learning.1993(1)
  • 3Aumuller D,Do HH,Massmann S,et al.Schema and on- tology matching with COMA + +[].Proceedings of SIG- MOD.2005
  • 4Dong X,Halevy A,Madhavan J,et al.Similarity search for web services[].Proceedings of the th VLDB Confer- ence.2004
  • 5Flesca S,Manco G,Masciari E,et al.Detecting structural similarities between XML documents[].Proceedings of the International Workshop on The Web and Databases.2002
  • 6Ullmann J.An algorithm for subgraph isomorphism[].Jour- nal of the Association for Computing Machinery.1976
  • 7Cordella L,Foggia P,Sansone C,et al.Performance eval- uating of the VF graphmatching algorithm[].Proceedings ofth International Conference on Image Analysis and Pro- cessing.1999
  • 8Cordella L P,Foggia P,Sansone C,et al.A (sub)graph isomorphism algorithm for matching large graphs[].IEEE Transactions on Pattern Analysis and Machine Intelligence.2004
  • 9Melnik S,Garcia-Molina H,Rahm E.Similarity flooding: a versatile graph matching algorithm[].Proceedings of the In- ternational Conference on Data Engineering.2002
  • 10Nigam K,Mccallum A K,Thrun S,et al.Text classifica- tion from labeled and unlabeled documents using EM[].Machine Learning.2000

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部