Automatic web services classification based on rough set theory
来源期刊：中南大学学报(英文版)2013年第10期
论文作者：CHEN Li(陈立) ZHANG Ying(张英) SONG Zi-lin(宋自林) MIAO Zhuang(苗壮)
文章页码：2708 - 2714
Key words：web services; services classification; rough set theory; discernibility matrices
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.
CHEN Li(陈立)1, 2, ZHANG Ying(张英)1, 3, SONG Zi-lin(宋自林)1, MIAO Zhuang(苗壮)1
(1. Institute of Command Automation, PLA University of Science and Technology, Nanjing 210007, China;
2. Unit 61539 of PLA, Beijing 100091, China;
3. Unit 61672 of PLA, Beijing 100091, China)
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.
Key words:web services; services classification; rough set theory; discernibility matrices
