Automatic web services classification based on rough set theory

Abstract

With development of web services technology, the number of existing services in the internet is growing day by day. In order to achieve automatic and accurate services classification which can be beneficial for service related tasks, a rough set theory based method for services classification was proposed. First, the services descriptions were preprocessed and represented as vectors. Elicited by the discernibility matrices based attribute reduction in rough set theory and taking into account the characteristic of decision table of services classification, a method based on continuous discernibility matrices was proposed for dimensionality reduction. And finally, services classification was processed automatically. Through the experiment, the proposed method for services classification achieves approving classification result in all five testing categories. The experiment result shows that the proposed method is accurate and could be used in practical web services classification.

Keywords

web services / services classification / rough set theory / discernibility matrices

References

[1] Rinderle-MaS, ReichertM, JurischM. On utilizing web service equivalence for supporting the composition life cycle [J]. International Journal of Web Services Research, 2011, 8(1): 41-67

[2] ZulkernineF H, MartinP. An adaptive and intelligent SLA negotiation system for web services [J]. IEEE Transactions on Services Computing, 2011, 4(1): 31-43

[3] WuB, DengS-g, LiY, WuJ, YinJ-wei. AWSP: An automatic web service planner based on heuristic state space search [C]. Proceedings of IEEE International Conference on Web Services (ICWS’11), 2011Washington, DC, USAIEEE Press403-410

[4] CHINNICI R, MOREAU J, RYMAN A, WEERAWARANA S. Web services description language (WSDL) Version 2.0 Part 1: Core Language (W3C Recommendation) [EB/OL]. http://www.w3.org/TR/wsdl20. 2007-06-26.

[5] MITRA N, LAFON Y. SOAP Version 1.2 Part 0: Primer (Second Edition) (W3C Recommendation 2007-04-27) [EB/OL]. http://www.w3.org/TR/soap12-part0.

[6] Universal Description Discovery and Integration (UDDI) Technical White Paper [EB/OL]. [2011-06-08]. http://uddi.xml.org.

[7] UNSPSC (United Nations Standard Products and Services Code) [EB/OL]. [2011-10-20]. http://www.unspsc.org.

[8] NAICS (North American Industry Classification System) [EB/OL]. [2011-12-15]. http://www.census.gov/eos/www/naics.

[9] HeßA, KushmerickN. Automatically attaching semantic metadata to web services [C]. Proceedings of Workshop on Information Integration on the Web (IIWeb’03) at the 18th International Joint Conference on Artificial Intelligence (IJCAI’03). Acapulco, Mexico, 2003111-116

[10] HeßA, JohnstonE, KushmerickN. ASSAM: A tool for semi-automatically annotating semantic web services [C]. Proceedings of the 3rd International Semantic Web Conference (ISWC’04), Lecture Notes in Computer Science 3298. Hiroshima, Japan, 2004320-334

[11] BrunoM, CanforaG, Di PentaM, ScognamiglioR. An approach to support web service classification and annotation [C]. Proceedings of IEEE International Conference on e-Technology, e-Commerce and e-Services (EEE’05), 2005Hong Kong, ChinaIEEE Press138-143

[12] PatilA A, OundhakarS, ShethA, VermaK. METEOR-S Web service annotation framework [C]. Proceedings of the 13th International Conference on World Wide Web (www’04). Manhattan, NY, USA, 2004553-562

[13] OldhamN, ThomasC, ShethA P, VermaK. METEOR-S Web service annotation framework with machine learning classification [C]. Proceedings of the 1st International Workshop on Semantic Web Services and Web Process Composition (SWSWPC’04) at International Semantic Web Conference (ISWC’04). San Diego, CA, USA, 2004137-146

[14] HuaJ-p, TembeW D, DoughertyE R. Performance of feature-selection methods in the classification of high-dimension data [J]. Pattern Recognition, 2009, 42(3): 409-424

[15] YangJ-b, OngC-jin. Feature selection for support vector regression using probabilistic prediction [C]. Proceedings of ACM SIGKDD the 16th International Conference on Knowledge Discovery and Data Mining (KDD’10), 2010Washington, DC, USAACM343-352

[16] GheyasI A, SmithL S. Feature subset selection in large dimensionality domains [J]. Pattern Recognition, 2010, 43(1): 5-13

[17] PawlakZ, SkowronA. Rough sets: Some extensions [J]. Information Sciences, 2007, 177(1): 28-40

[18] PawlakZ, SkowronA. Rudiments of rough sets [J]. Information Sciences, 2007, 177(1): 3-27

[19] SkowronA, RauszerC. The discernibility matrices and functions in information system [M]. Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, 1992NetherlandsKluwer Academic Publishers331-362

[20] BuckleyC, SaltonG, AllanJ. The effect of adding relevance information in a relevance feedback environment [C]. Proceedings of ACM SIGIR the 17th Annual International Conference on Research and Development in Information Retrieval (SIGIR’94), 1994New York, NY, USAACM292-300

[21] KLUSCH M, KAPAHNKE P, FRIES B, KHALID M A, VASILESKI M. OWL-S Test Collection Version 4 [EB/OL]. [2012-03-03]. http://semwebcentral.org/projects/owls-tc.