Abstract

To reduce the user's cognitive load and make sense of complex interlinked service data for realizing advanced service application, an approach to Service Semantic Link Network (S-SLN) navigation was proposed. S emantic based g raph m ining t echnology was employed as an effective solution for automatic service navigation . As one of the most important navigation tools, related service nodes recommendation was mapped as a basic graph mining problem. The closely related service nodes linked by different relations to form a sub-graph of S-SLN, which service nodes and links with different type and weight represent different service scenarios and relationship to the maximum extent such that sub-graph of S-SLN can improve or speed up user’s navigation decisions by providing the most probable related Web service and links which are most likely to be of interest. The experimental results and analysis shows that the proposed approach is efficient, feasible and practical.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call