Efficient Web APIs Recommendation With Privacy-Preservation for Mobile App Development in Industry 4.0

被引:25
作者
Gong, Wenwen [1 ]
Zhang, Wei [2 ]
Bilal, Muhammad [3 ]
Chen, Yifei [1 ]
Xu, Xiaolong [4 ]
Wang, Weizheng [5 ]
机构
[1] China Agr Univ, Coll Informat & Elect Engn, Beijing 100083, Peoples R China
[2] Weifang Univ Sci & Technol, Weifang Key Lab Blockchain Agr Vegetables, Weifang 262700, Peoples R China
[3] Hankuk Univ Foreign Studies, Dept Comp Engn, Yongin 17035, South Korea
[4] Nanjing Univ Informat Sci & Technol, Sch Comp & Software, Nanjing 210044, Peoples R China
[5] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Industrial Internet of Things; Mobile applications; Privacy; Informatics; Indexes; Fourth Industrial Revolution; Steiner trees; App development; efficiency; Industry; 4; 0; privacy; web APIs recommendation;
D O I
10.1109/TII.2021.3133614
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Integrating lightweight web application programming interfaces (APIs) into mobile Apps is a promising way for quick and cost-effective development of mobile Apps with desired functions. Web APIs, on the other hand, are created by distinct enterprises or organizations, making it challenging to develop compatible and diverse mobile Apps by combining existing web APIs. It has been demonstrated that this process is an NP-hard problem. In mobile Apps development, it is often necessary to read confidential information, leading to the business privacy leakage of enterprises. Thus, we devise a novel efficient web APIs recommendation (E-WAR) approach based on locality-sensitive hashing for recommending desirable web APIs to developers. Through analyzing industrial enterprises' expected needs, E-WAR efficiently makes compatible and diverse web APIs recommendations while guaranteeing privacy protection. Finally, extensive experiments on real-world web APIs datasets are conducted. The results show that E-WAR can achieve significant performance improvements over the existing approaches.
引用
收藏
页码:6379 / 6387
页数:9
相关论文
共 35 条
[1]   Web service API recommendation for automated mashup creation using multi-objective evolutionary search [J].
Almarimi, Nuri ;
Ouni, Ali ;
Bouktif, Salah ;
Mkaouer, Mohamed Wiem ;
Kula, Raula Gaikovina ;
Saied, Mohamed Aymen .
APPLIED SOFT COMPUTING, 2019, 85
[2]   Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates [J].
Borodin, Allan ;
Jain, Aadhar ;
Lee, Hyun Chul ;
Ye, Yuli .
ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (03)
[3]   A Private and Efficient Mechanism for Data Uploading in Smart Cyber-Physical Systems [J].
Cai, Zhipeng ;
Zheng, Xu .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (02) :766-775
[4]   Collective Data-Sanitization for Preventing Sensitive Information Inference Attacks in Social Networks [J].
Cai, Zhipeng ;
He, Zaobo ;
Guan, Xin ;
Li, Yingshu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2018, 15 (04) :577-590
[5]  
Carbonell J., 1998, Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P335, DOI 10.1145/290941.291025
[6]   A k-anonymous approach to privacy preserving collaborative filtering [J].
Casino, Fran ;
Domingo-Ferrer, Josep ;
Patsakis, Constantinos ;
Puig, Domenec ;
Solanas, Agusti .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (06) :1000-1011
[7]   Diversified keyword search based web service composition [J].
Cheng, Huanyu ;
Zhong, Ming ;
Wang, Jian .
JOURNAL OF SYSTEMS AND SOFTWARE, 2020, 163
[8]   Enhancing Recommendation Diversity using Determinantal Point Processes on Knowledge Graphs [J].
Gan, Lu ;
Nurbakova, Diana ;
Laporte, Lea ;
Calabretto, Sylvie .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :2001-2004
[9]   A Novel Framework for Service Set Recommendation in Mashup Creation [J].
Gao, Wei ;
Wu, Jian .
2017 IEEE 24TH INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS 2017), 2017, :65-72
[10]  
Gionis A, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P518