Nowadays, in a world full of uncertainties and the threat of digital and cyber-attacks, blockchain technology is one of the major critical developments playing a vital role in the creative professional world. Along with energy, finance, governance, etc., the healthcare sector is one of the most prominent areas where blockchain technology is being used. We all are aware that data constitute our wealth and our currency; vulnerability and security become even more significant and a vital point of concern for healthcare. Recent cyberattacks have raised the questions of planning, requirement, and implementation to develop more cyber-secure models. This paper is based on a blockchain that classifies network participants into clusters and preserves a single copy of the blockchain for every cluster. The paper introduces a novel blockchain mechanism for secure healthcare sector data management, which reduces the communicational and computational overhead costs compared to the existing bitcoin network and the lightweight blockchain architecture. The paper also discusses how the proposed design can be utilized to address the recognized threats. The experimental results show that, as the number of nodes rises, the suggested architecture speeds up ledger updates by 63% and reduces network traffic by 10 times.

The most popular method collaborative filter approach is primarily used to handle the information overloading problem in E-Commerce. Traditionally, collaborative filtering uses ratings of similar users for predicting the target item. Similarity calculation in the sparse dataset greatly influences the predicted rating, as less count of co-rated items may degrade the performance of the collaborative filtering. However, consideration of item features to find the nearest neighbor can be a more judicious approach to increase the proportion of similar users. In this study, we offer a new paradigm for raising the rating prediction accuracy in collaborative filtering. The proposed framework uses rated items of the similar feature of the ’most’ similar individuals, instead of using the wisdom of the crowd. The reliability of the proposed framework is evaluated on the static MovieLens datasets and the experimental results corroborate our anticipations.