作者: Zhangbing Zhou , Mohamed Sellami , Walid Gaaloul , Bruno Defude
DOI: 10.1109/SKG.2011.9
关键词:
摘要: In service-oriented computing, a user usually needs to locate desired service for (i) fulfilling her requirements, or (ii) replacing service, which disappears is unavailable some reasons, perform an interaction. With the increasing number of services available within enterprise and over internet, locating online may not be appropriate from performance perspective, especially in large internet-based repositories. Instead, need clustered offline according their similarity. Thereafter, one several clusters are necessary examined during dynamic discovery. this paper we propose cluster data providing (DP) using refined fuzzy C-means algorithm. We consider composite relation between DP elements (i.e., input, output, semantic them) when representing terms vectors. A vector assigned multiple with certain degrees. When grouping similar into cluster, while partitioning different clusters, capability search engine improved significantly.