Fr From a a Web eb Ser ervic vices es Catalo alog to a a Li - - PowerPoint PPT Presentation

fr from a a web eb ser ervic vices es catalo alog to a a
SMART_READER_LITE
LIVE PREVIEW

Fr From a a Web eb Ser ervic vices es Catalo alog to a a Li - - PowerPoint PPT Presentation

Fr From a a Web eb Ser ervic vices es Catalo alog to a a Li Linked Ecosystem of f Se Services F. SLAIMI, S. SELLAMI, O.BOUCELMA AIX-MARSEILLE UNIVERSITY, FRANCE 1 Outline o Context and motivation o Related work o Graph construction o


slide-1
SLIDE 1

Fr From a a Web eb Ser ervic vices es Catalo alog to a a Li Linked Ecosystem of f Se Services

  • F. SLAIMI, S. SELLAMI, O.BOUCELMA

AIX-MARSEILLE UNIVERSITY, FRANCE

1

slide-2
SLIDE 2

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluation
  • Conclusion and future work

2

slide-3
SLIDE 3

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluation
  • Conclusion and future work

3

slide-4
SLIDE 4

Context and Motivation

Increasing number of web services and mashups (> 18 K APIs @Pweb)

L Manual search of services and mashups is difficult

LServices ans mashups are sparse

à Tedious process of discovery and

recommendation

4

Track Track Track Track Track link services/ mashups and users à discovery and recommendation

slide-5
SLIDE 5

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluation
  • Conclusion and future work

5

slide-6
SLIDE 6

Discovery and recommendation

6

Approaches Graphs Discovery Criteria Selection and recommendation

  • f APIs [Guo 2015]

Operates on services, mashups, categories and social links between developers User profiles and preferences Linked Social Services [Maamar 2011] Based on Linked Data Principles Social links Trust based [Deng 2014] [Deng 2015] Based on common usage in mashups or by users

QoS evaluations

Trust Linked mashups [Bianchini 2014]

link between mashups of resources which is calculated based on the comparison of their terminological items Similarity

slide-7
SLIDE 7

Discovery and recommendation

7

àMost recommendations are based on common usages of services/mashups or result in “same” QoS properties L Ignore services’ properties and mashups

(documentation, functional and non functional)

L Ignore services and mashups’ similarities L QoS are not always available

slide-8
SLIDE 8

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluation
  • Conclusion and future work

8

slide-9
SLIDE 9

9

Category : social Name : facebook Tags: social, webhooks summary: Social networking Category: social Name: twitter Tags: social, microblogging summary : Social microblogging

Facebook Twitter simS(facebook, twitter)=0,72

facebok twitter

Similarities between categories, names, description and tags

Social

facebook twitter linkedin megaphone fonolo 0.7

0.72 0.6

0.72

Services relationships

slide-10
SLIDE 10

à common services in mashups SimMashups (M1,M2)=

|"#$⋂"#&| |"#$∪"#&|

Mashups relationships

facebook SMS filckr Google maps

M1

facebook LinkedIn Google maps

M2 SimMashups (M1,M2)= &

( = 0,4

How to create links between mashups?

10

slide-11
SLIDE 11

Users relationships

Links may have different semantics: follows, similarity

11

S1 S2

S3 S4

S5

u3

u4 u1 u2

u3

u4

Similar interests

Track relation

Sim (ui,uj)=

|-./⋂|-.0| |-./|

Where Hui and Huj are the recent histories

  • f users ui and uj respectively

How to create links between users?

slide-12
SLIDE 12

Categories

C1

Services

S1

Mashups

M1

u1 u4 u3 u2 u5 u6 u7

Users

M2 Mn S2 Sn S3 C2 C3 Cn

…. …. ….

Similar Track Belongs to

Global graph

12

slide-13
SLIDE 13

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluation
  • Conclusion and future work

13

slide-14
SLIDE 14

S3 S1 S4 S2 Sn S6 S5

C1 C2

Services relationships Users relationships

U1 U3 U2 U5 Un U6

M1

C1 C2

M2 M6 M7 M2

Mashups relationships

List of ranked services and mashups Services Discovery Services/mashups recommendation

User Request

U1

Sub graphs of services

User Watchlist

Recommendation process

14

slide-15
SLIDE 15

Recommendation process

15

User A Category: social Name: facebook User’s query

Service’s search

Recommended services Recommended mashups Services can be used with facebook

slide-16
SLIDE 16

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluation
  • Conclusion and future work

16

slide-17
SLIDE 17

System architecture

17

slide-18
SLIDE 18

Data set

Number of categories 116 Number of mashups 300 Number of services 700 Number of users (with wtachlists) 344

18

slide-19
SLIDE 19

Evaluation numbers

0,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 Top 5 Top 10 Precision Recall RMSE hit-rank

Recall, Precision, RMSE and Hit-rank numbers (w.r.t the number of recommended services)

0,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 Top 5 Top 10 Precision Recall RMSE hit-rank

Recall, Precision, RMSE and Hit-rank numbers (w.r.t the number of recommended mashups) 19

à it is relatively easier to recommend a subset of relevant services.

slide-20
SLIDE 20

Evaluations numbers

  • TrsutSVD: Trust based recommendation
  • Popular: Recommendation of popular services (ProgrammableWeb)

20

Approaches Precision @5 Precision @10 Recall @5 Recall @10 RMSE @5 RMSE @10 TrustSVD 0.73 0.75 0.61 0.63 0.211 0.2 WReG 0.80 0.85 0.70 0.74 0.2 0.185 Popular 0.41 0.39 0.34 0.61 0.31 0.3

slide-21
SLIDE 21

Evaluation numbers

21

  • WReG is based on users-services and users-mashups relationships

à recommendations are more precise.

  • TrustSVD considers trust relations between users and services

à gives good precision values à Not able to recommend services in absence of rating values

  • Popular

à lowest results compared to TrustSVD and WReG à does not take into account users’ interests (results are not personalized).

slide-22
SLIDE 22

Outline

  • Context and motivation
  • Related work
  • Graph construction
  • Recommendation process
  • Evaluations results
  • Conclusion and future work

22

slide-23
SLIDE 23

Conclusion

  • A new web services ecosystem catalog
  • Multigraph
  • service à service relations
  • user à user relations
  • user à service relations
  • Neo4J prototype
  • Recommendation process
  • Search
  • Recommendation

23

slide-24
SLIDE 24

Future work

  • Exploit the graph and links between services and mashups

to assist the mashups construction process

  • Extend this work to service management for IoT in order

to perform IoT services discovery.

24

slide-25
SLIDE 25

References

[Maamar 2011] Maamar, Z., Wives, L. K., Badr, Y., Elnaffar, S., Boukadi, K., Faci, N.: Linkedws: A novel web services discovery model based on the metaphor of Social networks. Simulation Modelling Practice and Theory, vol.19 (2011) 121-132 [Guo 2015] Guo, G., Zhang, J., Yorke-Smith., N.: TrustSVD: Collaborative filtering with both the explicit and implicit influence of user trust and of item ratings. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, (2015) 123-129 [Deng 2015] Deng, S., Huang, L., Yin, Y., Tang, W.: Trust-based service recommendation in social

  • network. Appl. Math, vol.9 (2015) 1567-1574

[Deng 2014] Deng, S., Huang, L. Xu, G.: Social network-based service recommendation with trust

  • enhancement. Expert Systems with Applications. vol.(41) (2014) 8075-8084

[Bianchini 2014] Bianchini,D., Antonellis, V. D., Melchiori, M.: Link-Based Viewing of Multiple Web API

  • Repositories. In Database and Expert Systems Applications - 25th International Conference, DEXA

2014, Munich, Germany, (2014) 362–376

25