2017 IEEE International Conference on Web Services (ICWS) 2017
DOI: 10.1109/icws.2017.15
|View full text |Cite
|
Sign up to set email alerts
|

Privacy-Preserving Distributed Service Recommendation Based on Locality-Sensitive Hashing

Abstract: This version is available at http://eprints.hud.ac.uk/id/eprint/31929/ The University Repository is a digital collection of the research output of the University, available on Open Access. Copyright and Moral Rights for the items on this site are retained by the individual author and/or other copyright owners. Users may access full items free of charge; copies of full text items generally can be reproduced, displayed or performed and given to third parties in any format or medium for personal research or study… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 36 publications
(20 citation statements)
references
References 19 publications
(23 reference statements)
0
19
0
1
Order By: Relevance
“…We extract the Boolean (user, service) pairs from these QoS data for experiment purpose. To show the advantages of our solution, we compare Rec MPS method with three state-of-the-art methods, e.g., DistSR LSH [27], WSRec [28], and ICF (item-based CF). We compare the performances of the four methods in terms of recommendation accuracy (via RMSE) and efficiency.…”
Section: Experiments Configurationsmentioning
confidence: 99%
“…We extract the Boolean (user, service) pairs from these QoS data for experiment purpose. To show the advantages of our solution, we compare Rec MPS method with three state-of-the-art methods, e.g., DistSR LSH [27], WSRec [28], and ICF (item-based CF). We compare the performances of the four methods in terms of recommendation accuracy (via RMSE) and efficiency.…”
Section: Experiments Configurationsmentioning
confidence: 99%
“…However, in order to ensure the functionality of the QSP, it is impossible to find an all-sided protection scheme purely based on coordinate transformation because the service provider has to be able to determine the relative position of objects and areas to each other [17]. In addition, to preserve the trajectory of user, a great deal of spatiotemporal location obfuscation schemes are also proposed, which also took the temporal information associated with positions into account [18][19][20][21][22][23][24][25]. [26] who split up the location information into shares of strictly limited precision.…”
Section: Obfuscationmentioning
confidence: 99%
“…However, the work in [12] fails to protect some important privacy information appropriately, e.g., the information of the service intersection commonly invoked by two users. A privacy-preserving recommendation approach is proposed in our previous work [16]; however, this approach cannot handle the service recommendation scenario where the service quality data observed by a user are distributed in multiple platforms.…”
Section: B Privacy Preservationmentioning
confidence: 99%
“…Due to its domain-independent and easy-to-explain characteristics, collaborative filtering (CF) has become one of the most effective techniques in various service recommendation systems [4]- [16]. We briefly review the CF-based service recommendation approaches from three perspectives: recommendation accuracy, capability of privacy preservation and scalability.…”
Section: Related Workmentioning
confidence: 99%