Hybrid Context Aware Recommendation System for E-Health Care by merkle hash tree from cloud using evolutionary algorithm
出版年份 2019 全文链接
标题
Hybrid Context Aware Recommendation System for E-Health Care by merkle hash tree from cloud using evolutionary algorithm
作者
关键词
Privacy, Recommendation system, Collaborative filtering, Communication complexity, Computation complexity
出版物
SOFT COMPUTING
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2019-09-09
DOI
10.1007/s00500-019-04322-7
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Prediction of availability and integrity of cloud data using soft computing technique
- (2019) R. Pitchai et al. SOFT COMPUTING
- Privacy-Preserving Indexing and Query Processing for Secure Dynamic Cloud Storage
- (2018) Minxin Du et al. IEEE Transactions on Information Forensics and Security
- Scalable Content-Aware Collaborative Filtering for Location Recommendation
- (2018) Defu Lian et al. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
- Privacy-preserving and Dynamic Multi-attribute Conjunctive Keyword Search over Encrypted Cloud Data
- (2018) Lili Zhang et al. IEEE Access
- Privacy-Preserving Multikeyword Similarity Search Over Outsourced Cloud Data
- (2017) Chia-Mu Yu et al. IEEE Systems Journal
- Optimization of Tree Modes for Parallel Hash Functions: A Case Study
- (2017) Kevin Atighehchi et al. IEEE TRANSACTIONS ON COMPUTERS
- Towards Privacy-Preserving Storage and Retrieval in Multiple Clouds
- (2017) Jingwei Li et al. IEEE Transactions on Cloud Computing
- Privacy Preserving Ranked Multi-Keyword Search for Multiple Data Owners in Cloud Computing
- (2016) Wei Zhang et al. IEEE TRANSACTIONS ON COMPUTERS
- An Efficient Privacy-Preserving Ranked Keyword Search Method
- (2016) Chi Chen et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- Searchable Encrypted Data File Sharing Method Using Public Cloud Service for Secure Storage in Cloud Computing
- (2016) R. Pitchai et al. WIRELESS PERSONAL COMMUNICATIONS
- A Parallel Patient Treatment Time Prediction Algorithm and Its Applications in Hospital Queuing-Recommendation in a Big Data Environment
- (2016) Jianguo Chen et al. IEEE Access
- MuR-DPA: Top-Down Levelled Multi-Replica Merkle Hash Tree Based Secure Public Auditing for Dynamic Big Data Storage on Cloud
- (2015) Chang Liu et al. IEEE TRANSACTIONS ON COMPUTERS
- Time Aware and Data Sparsity Tolerant Web Service Recommendation Based on Improved Collaborative Filtering
- (2015) Yan Hu et al. IEEE Transactions on Services Computing
- Smart cloud search services: verifiable keyword-based semantic search over encrypted cloud data
- (2015) Zhangjie Fu et al. IEEE TRANSACTIONS ON CONSUMER ELECTRONICS
- An Efficient Merkle-Tree-Based Authentication Scheme for Smart Grid
- (2013) Hongwei Li et al. IEEE Systems Journal
- Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking
- (2013) Wenhai Sun et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
- (2013) Ning Cao et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- Smart Grid Mesh Network Security Using Dynamic Key Distribution With Merkle Tree 4-Way Handshaking
- (2013) Bin Hu et al. IEEE Transactions on Smart Grid
- Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
- (2011) Cong Wang et al. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
- Analysis of Factors Causing Long Patient Waiting Time and Clinic Overtime in Outpatient Clinics
- (2010) Zhecheng Zhu et al. JOURNAL OF MEDICAL SYSTEMS
- Models of Emergency Departments for Reducing Patient Waiting Times
- (2009) Marek Laskowski et al. PLoS One
- Simulation study of the optimal appointment number for outpatient clinics
- (2009) Z. C. Zhu et al. International Journal of Simulation Modelling
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started