TY - GEN
T1 - Clustering and managing data providing services using machine learning technique
AU - Zhou, Zhangbing
AU - Sellami, Mohamed
AU - Gaaloul, Walid
AU - Defude, Bruno
PY - 2011/12/26
Y1 - 2011/12/26
N2 - In service-oriented computing, a user usually needs to locate a desired service for (i) fulfilling her requirements, or (ii) replacing a service, which disappears or is unavailable for some reasons, to perform an interaction. With the increasing number of services available within an enterprise and over the internet, locating a service online may not be appropriate from the performance perspective, especially in large internet-based service repositories. Instead, services usually need to be clustered offline according to their similarity. Thereafter, services in one or several clusters are necessary to be examined online during dynamic service discovery. In this paper we propose to cluster data providing (DP) services using a refined fuzzy C-means algorithm. We consider the composite relation between DP service elements (i.e., input, output, and semantic relation between them) when representing DP services in terms of vectors. A DP service vector is assigned to one or multiple clusters with certain degrees. When grouping similar services into one cluster, while partitioning different services into different clusters, the capability of service search engine is improved significantly.
AB - In service-oriented computing, a user usually needs to locate a desired service for (i) fulfilling her requirements, or (ii) replacing a service, which disappears or is unavailable for some reasons, to perform an interaction. With the increasing number of services available within an enterprise and over the internet, locating a service online may not be appropriate from the performance perspective, especially in large internet-based service repositories. Instead, services usually need to be clustered offline according to their similarity. Thereafter, services in one or several clusters are necessary to be examined online during dynamic service discovery. In this paper we propose to cluster data providing (DP) services using a refined fuzzy C-means algorithm. We consider the composite relation between DP service elements (i.e., input, output, and semantic relation between them) when representing DP services in terms of vectors. A DP service vector is assigned to one or multiple clusters with certain degrees. When grouping similar services into one cluster, while partitioning different services into different clusters, the capability of service search engine is improved significantly.
U2 - 10.1109/SKG.2011.9
DO - 10.1109/SKG.2011.9
M3 - Conference contribution
AN - SCOPUS:84055218975
SN - 9780769545158
T3 - Proceedings - 7th International Conference on Semantics, Knowledge, and Grids, SKG 2011
SP - 225
EP - 232
BT - Proceedings - 7th International Conference on Semantics, Knowledge, and Grids, SKG 2011
T2 - 7th International Conference on Semantics, Knowledge, and Grids, SKG 2011
Y2 - 24 October 2011 through 26 October 2011
ER -