skip to main content
10.1145/2095536.2095575acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiiwasConference Proceedingsconference-collections
research-article

An implicit approach for building communities of web service registries

Published:05 December 2011Publication History

ABSTRACT

In a service oriented B2B context, companies aiming to cooperate and interact with others have to make their services available through private service registries. Since the number of registries can be as large as the number of companies, the resulting registry network has to be organized to assist and improve the service discovery process. In this paper, we propose to use communities as a means to organize Web services registries in such a context. First, we propose a semantic model for Web services registry description (WSRD). A WSRD description is a semantic model depicting the functionalities offered by services advertised by a given registry. Thereafter, we propose an implicit approach for building communities based on the registries WSRD descriptions using a fuzzy clustering technique. Eventually, this clustering will be helpful for selecting an adequate registry for service requesters. Provided experimental evaluations in this paper show that our approach is efficient in realistic situations.

References

  1. E. Ayorak and A. B. Bener. Super peer web service discovery architecture. In Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, April 15--20, 2007, Istanbul, Turkey, pages 1360--1364. IEEE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. Bentahar, Z. Maamar, D. Benslimane, and P. Thiran. An argumentation framework for communities of web services. IEEE Intelligent Systems, 22(6):75--83, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. O. Bouchaalaa, M. Sellami, W. Gaaloul, S. Tata, and M. Jmaiel. Graph-based management of communities of web service registries. In WEBIST 2011, Proceedings of the 7th International Conference on Web Information Systems and Technologies, Noordwijkerhout, The Netherlands, May 6--9, 2011. INSTICC Press, 2011.Google ScholarGoogle Scholar
  4. Y. Chabeb and S. Tata. Yet another semantic annotation for wsdl (yasa4wsdl). In IADIS WWW/Internet 2008 Conference, pages 462--467, October 2008.Google ScholarGoogle Scholar
  5. Y. Chabeb, S. Tata, and A. Ozanne. Yasa-m: A semantic web service matchmaker. In The IEEE 24rd International Conference on Advanced Information Networking and Applications, AINA 2010, April 20--23, Perth, Australia, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. De Bruijn et al. Web service modeling ontology (wsmo). Technical report, 2005.Google ScholarGoogle Scholar
  7. J. Dunn. A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. Journal of Cybernetics, 3:32--57, 1973.Google ScholarGoogle ScholarCross RefCross Ref
  8. J. J. Jiang and D. W. Conrath. Semantic similarity based on corpus statistics and lexical taxonomy. The Computing Research Repository, CoRR, cmp-lg/9709008, 1997.Google ScholarGoogle Scholar
  9. M. Jursic and N. Lavrac. Fuzzy clustering of documents. In Conference on Data Mining and Data Warehouses, SiKDD 2008, Ljubljana, Slovenia, 2008.Google ScholarGoogle Scholar
  10. H. Lausen and J. Farrell. Semantic annotations for WSDL and XML schema. W3C recommendation, W3C, Aug. 2007. http://www.w3.org/TR/2007/REC-sawsdl-20070828/.Google ScholarGoogle Scholar
  11. D. Lin. An information-theoretic definition of similarity. In The Fifteenth International Conference on Machine Learning (ICML), Madison, Wisconson, USA, July 24--27, pages 296--304, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Martin et al. Owl-s: Semantic markup for web services. Technical report, 2004.Google ScholarGoogle Scholar
  13. S.-C. Oh, H. Kil, D. Lee, and S. R. T. Kumara. WSBen: A Web Services Discovery and Composition Benchmark. In 2006 IEEE International Conference on Web Services (ICWS 2006), 18--22 September 2006, Chicago, Illinois, USA, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. Pilioura and A. Tsalgatidou. Unified publication and discovery of semantic web services. ACM Transactions on the Web (TWEB), 3(3), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Qian, S. Sural, Y. Gu, and S. Pramanik. Similarity between euclidean and cosine angle distance for nearest neighbor queries. In Proceedings of the 2004 ACM symposium on Applied computing, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM, pages 161--172, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. P. Resnik. Using information content to evaluate semantic similarity in a taxonomy. In The International Joint Conference on AI, IJCAI, 20--25 August, Montreal, Canada, pages 448--453, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. G. Salton and C. Buckley. Term weighting approaches in automatic text retrieval. Technical report, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Commun. ACM, 18(11):613--620, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Saraçoglu, K. Tutuncu, and N. Allahverdi. A fuzzy clustering approach for finding similar documents using a novel similarity measure. Expert Systems with Applications, 33(3):600--605, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Sellami, O. Bouchaala, W. Gaaloul, and S. Tata. WSRD: A Web Services Registry Description. In The 10th international conference on New Technologies of Distributed Systems, NOTERE 2010, May 31- June 2, Tozeur, Tunisia, pages 89--96, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  22. M. Sellami, W. Gaaloul, S. Tata, and M. Jmaiel. Using recommendation to limit search space in web services discovery. In 24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010, Perth, Australia, 20--13 April 2010, pages 974--981, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. K. Sivashanmugam, K. Verma, and A. P. Sheth. Discovery of web services in a federated registry environment. In Proceedings of the IEEE International Conference on Web Services (ICWS'04), San Diego, California, USA, pages 270--278. IEEE Computer Society, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. K. Verma, K. Sivashanmugam, A. Sheth, A. Patil, S. Oundhakar, and J. Miller. Meteor-s wsdi: A scalable p2p infrastructure of registries for semantic publication and discovery of web services. Inf. Technol. and Management, 6(1):17--39, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. B. Xu and D. Chen. Semantic web services discovery in p2p environment. In ICPPW '07: Proceedings of the 2007 International Conference on Parallel Processing Workshops, page 60. IEEE Computer Society, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Y. Xu, S. Tang, Y. Xu, R. Xiao, and L. Fang. Discovering web services based on match history. In Advances in Intelligent Web Mastering, Proceedings of the 5th Atlantic Web Intelligence Conference - AWIC, Fontainbleau, France, June 25--27, pages 363--368, 2007.Google ScholarGoogle Scholar

Index Terms

  1. An implicit approach for building communities of web service registries

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        iiWAS '11: Proceedings of the 13th International Conference on Information Integration and Web-based Applications and Services
        December 2011
        572 pages
        ISBN:9781450307840
        DOI:10.1145/2095536

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 5 December 2011

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader