scholarly journals Time-Aware Cross-Platform IoT Service Recommendation with Privacy Preservation

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Can Zhang ◽  
Junhua Wu ◽  
Chao Yan ◽  
Guangshun Li
Keyword(s):  
Real World ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Locality Sensitive Hashing ◽  
Service Recommendation ◽  
Cross Platform ◽  
Time Aware ◽  
Temporal Feature

IoT service recommendation techniques can help a user select appropriate IoT services efficiently. Aiming at improving the recommendation efficiency and preserving the data privacy, the locality-sensitive hashing (LSH) technique is adopted in service recommendation. However, existing LSH-based service recommendation methods ignore the intrinsic temporal feature of IoT services. In light of this challenge, we integrate the temporal feature into the conventional LSH-based method and present a time-aware approach with the capability of privacy preservation for IoT service recommendation across multiple platforms. Experiments on a real-world dataset are conducted to validate the advantage of our proposed approach in terms of accuracy and efficiency in recommendation.

scholarly journals Robust and Privacy-Preserving Service Recommendation over Sparse Data in Education

2019 ◽  
Vol 2019 ◽  
pp. 1-13
Author(s):  
Xuening Chen ◽  
Hanwen Liu ◽  
Yanwei Xu ◽  
Chao Yan
Keyword(s):  
Service Quality ◽  
Privacy Preservation ◽  
False Negative ◽  
Locality Sensitive Hashing ◽  
Quality Data ◽  
Service Recommendation ◽  
User Privacy ◽  
Target User ◽  
Cross Platform ◽  
Hybrid Collaborative Filtering

Service recommendation has become one of the most effective approaches to quickly extract insightful information from big educational data. However, the sparsity of educational service quality data (from multiple platforms or parties) used to make service recommendations often leads to few even null recommended results. Moreover, to protect sensitive business information and obey laws, preserving user privacy during the abovementioned multisource data integration process is a very important but challenging requirement. Considering the above challenges, this paper integrates Locality-Sensitive Hashing (LSH) with hybrid Collaborative Filtering (HCF) techniques for robust and privacy-aware data sharing between different platforms involved in the cross-platform service recommendation process. Furthermore, to minimize the “False negative” recommended results incurred by LSH and enhance the success of recommended results, we propose two optimization strategies to reduce the probability that similar neighbours of a target user or similar services of a target service are overlooked by mistake. Finally, we conduct a set of experiments based on a real distributed service quality dataset, i.e., WS-DREAM, to validate the feasibility and advantages of our proposed recommendation approach. The extensive experimental results show that our proposal performs better than three competitive methods in terms of efficiency, accuracy, and successful rate while guaranteeing privacy-preservation.

scholarly journals Privacy-Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Wenwen Gong ◽  
Lianyong Qi ◽  
Yanwei Xu
Keyword(s):  
Service Selection ◽  
Locality Sensitive Hashing ◽  
Mobile Service ◽  
Service Recommendation ◽  
User Privacy ◽  
Service Usage ◽  
Selection Decisions ◽  
Wide Range ◽  
Cross Platform ◽  
Computational Resources

With the ever-increasing popularity of mobile computing technology, a wide range of computational resources or services (e.g., movies, food, and places of interest) are migrating to the mobile infrastructure or devices (e.g., mobile phones, PDA, and smart watches), imposing heavy burdens on the service selection decisions of users. In this situation, service recommendation has become one of the promising ways to alleviate such burdens. In general, the service usage data used to make service recommendation are produced by various mobile devices and collected by distributed edge platforms, which leads to potential leakage of user privacy during the subsequent cross-platform data collaboration and service recommendation process. Locality-Sensitive Hashing (LSH) technique has recently been introduced to realize the privacy-preserving distributed service recommendation. However, existing LSH-based recommendation approaches often consider only one quality dimension of services, without considering the multidimensional recommendation scenarios that are more complex but more common. In view of this drawback, we improve the traditional LSH and put forward a novel LSH-based service recommendation approach named SerRecmulti-qos, to protect users’ privacy over multiple quality dimensions during the distributed mobile service recommendation process.

Time-aware distributed service recommendation with privacy-preservation

2019 ◽  
Vol 480 ◽  
pp. 354-364 ◽  
Author(s):  
Lianyong Qi ◽  
Ruili Wang ◽  
Chunhua Hu ◽  
Shancang Li ◽  
Qiang He ◽  
...  
Keyword(s):  
Privacy Preservation ◽  
Service Recommendation ◽  
Distributed Service ◽  
Time Aware

Big Data Privacy Preservation Using Two Phase Top-Down Specialization Algorithm with Multidimensional Map Reduce Framework on Hadoop

2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Shalin Eliabeth S. ◽  
Sarju S.
Keyword(s):  
Big Data ◽  
Data Privacy ◽  
Privacy Preservation ◽  
Experimental Result ◽  
Map Reduce ◽  
Distributed Environment ◽  
Top Down ◽  
Two Phase ◽  
Data Anonymization ◽  
Big Data Privacy

Big data privacy preservation is one of the most disturbed issues in current industry. Sometimes the data privacy problems never identified when input data is published on cloud environment. Data privacy preservation in hadoop deals in hiding and publishing input dataset to the distributed environment. In this paper investigate the problem of big data anonymization for privacy preservation from the perspectives of scalability and time factor etc. At present, many cloud applications with big data anonymization faces the same kind of problems. For recovering this kind of problems, here introduced a data anonymization algorithm called Two Phase Top-Down Specialization (TPTDS) algorithm that is implemented in hadoop. For the data anonymization-45,222 records of adults information with 15 attribute values was taken as the input big data. With the help of multidimensional anonymization in map reduce framework, here implemented proposed Two-Phase Top-Down Specialization anonymization algorithm in hadoop and it will increases the efficiency on the big data processing system. By conducting experiment in both one dimensional and multidimensional map reduce framework with Two Phase Top-Down Specialization algorithm on hadoop, the better result shown in multidimensional anonymization on input adult dataset. Data sets is generalized in a top-down manner and the better result was shown in multidimensional map reduce framework by the better IGPL values generated by the algorithm. The anonymization was performed with specialization operation on taxonomy tree. The experiment shows that the solutions improves the IGPL values, anonymity parameter and decreases the execution time of big data privacy preservation by compared to the existing algorithm. This experimental result will leads to great application to the distributed environment.

Subspace k-anonymity algorithm for location-privacy preservation based on locality-sensitive hashing

2019 ◽  
Vol 23 (5) ◽  
pp. 1167-1185
Author(s):  
Xiaohan Wang ◽  
Yonglong Luo ◽  
Shiyang Liu ◽  
Taochun Wang ◽  
Huihui Han
Keyword(s):  
Privacy Preservation ◽  
Location Privacy ◽  
Locality Sensitive Hashing
Sign in / Sign up

Export Citation Format

Share Document