This paper deals with the problem of web service recommendation. We propose a new content-based recommendation system. Its originality comes from the combination of probabilistic topic models and pattern mining to capture the maximal common semantic of sets of services. We define the notion of semantic patterns which are maximal frequent itemsets of topics. In the off-line process, the computation of these patterns is performed by using frequent concept lattices in order to find also the sets of services associated to the semantic patterns. These sets of services are then used to recommend services in the on-line process. We compare the results of the proposed system in terms of precision and normalized discounted cumulative gain with Apache Lucene and SAWSDL-MX2 Matchmaker on real-world data. Our proposition outperforms these two systems.
Naïm et al. REF proposed a new content-based recommendation system by combining probabilistic topic models and pattern mining to capture the maximal common semantics of sets of services.
Semantic Pattern Mining Based Web Service Recommendation
ICSOC
Computer Science