基于序列挖掘的Web服务推荐研究

Research on Recommendation of Web Services Based on Sequence Mining

提出了一种全新的服务发现方法。其核心思想是通过从以往服务组合序列中发现高频率出现的组合序列集,然后利用该序列集进行服务推荐。给出了服务推荐系统框架;对序列模式算法进行了改进,以适应连续序列挖掘的需求,并描述了服务推荐的匹配算法;最后通过在一个原型系统的性能测试证明服务推荐方法是可行和有效的。

A novel services discovery method was brought forward. The core idea of the method was to seek frequently-used sets of services combination sequences from the preexistent ones, then used the frequent sequences to recommend the services. The framework of services recommendation was outlined firstly. Then, the sequence pattern algorithm was improved to fulfill the demand of concatenate sequence mining, and the matching algorithm of service recommendation was aslo described. Finally, the services recommendation method was proved to be feasible and effective by the capability testing runed on the prototype system.