According to the WHO, Cancer is a prominent cause of mortality worldwide, accounting for ~ 10 million fatalities at the end of 2020. The most common types of cancers include Lung, Breast, CNS, Leukemia, Colon, and Cervical Cancer. Early detection of cancer can decrease the death toll. According to the study, if the cancer is identified at its early stage, the death rate can be reduced to ~85%. In order to reduce the death toll, machine learning (ML) emerges as a significant solution. When it comes to cancer research with ML, biopsy and microarray data come into the front. The biopsy data is less useful as it excludes a patient’s genetic information. However, due to the genetic information, the microarray data emerges as a solution to detecting cancer disease. Dealing with microarray data also has some consequences, and high dimensionality is one of them. This article reports an ML-based ensemble model to tackle microarray data issues and provide an effective model for cancer detection. The reported model uses Minimum Redundancy Maximum Relevance (MRMR) as the feature selection algorithm. The Whale Optimization Algorithm (WOA) is implemented for the featured dataset to select the optimistic number of features without affecting microarray data relevance. Then, four ML-based classification models, including Support Vector Machine, Decision Tree, Multi-Layer Perceptron, and Random Forest, are applied as the base learners to make initial predictions. Finally, the voting ensemble technique is applied to the initial prediction to develop an ensemble model for cancer prediction. The proposed En-MinWhale model is evaluated over six different types of cancer microarray datasets, including Lung, Leukemia, Ovarian, CNS, Breast, and Colon Cancer. Finally, the performance of the proposed model is evaluated using 11 various evaluative parameters, including accuracy, precision, specificity, sensitivity, F-β score, etc. The En-MinWhale model shows 94.09%, 95.83%, 94.86%, 95.00%, 94.85%, and 96.77% accuracy for Lung, Leukemia, Ovarian, CNS, Breast, and Colon Cancer datasets, respectively, that outperforms other considered hybrid models and can help out the physicians in Cancer diagnosis.

The decentralization feature of public and private blockchain-based applications is achieved by selecting different nodes as validator or Certificate Authority ( CA ) for each transaction. Public blockchain uses Proof of Work (PoW) to search for the validator. PoW causes an enormous amount of energy. Therefore, Proof of Stake ( PoS ), and Proof of Authority ( PoA ) emerged as alternate solutions. Selection of a new CA using PoS or PoA algorithms for each transaction may improve transaction security. However, a network may have a large number of transactions, and selecting a CA for each transaction using PoS or PoA may cause a significant amount of block propagation delay. Moreover, an increase in the number of participant nodes may increase the block propagation delay even further. Therefore, higher block propagation delay reduces network efficiency drastically. This paper proposes a different approach to increase the efficiency of Blockchain-based Public Key Infrastructure ( BC – PKI ). The proposed approach creates clusters of participant nodes based on their validation time, response time, and trust. This method selects a cluster based on the budget of response time and validation time given by the node that intends to start a transaction. Thereafter, the node which has the highest trust in that cluster is chosen as a CA for the next transaction. Instead of searching on all participant nodes, our approach searches on the nodes of the chosen cluster which reduces the searching space of the CA selection process. This research work adopts a trust evaluation approach where the trust factor is quantified based on its experience and reputation. The node trust is reevaluated after every successful and unsuccessful transaction. A node that performs more successful transactions has more trust value. The node that has a higher trust value has a higher probability to be selected as a CA for a transaction. The trust reevaluation process is followed by the clustering process. The result shows the proposed approach can reduce ~38.5% response time and ~2.2% validation time as compared to infrastructure which does not implement clustering. Additionally, the proposed CTB – PKI can be used in Blockchain 2.0 and Blockchain 3.0-related applications.

Objective: The cancer death rate has accelerated at an alarming rate, making accurate diagnosis at the primary stages crucial to enhance prognosis. This has deepened the issue of cancer mortality, which is already at an exponential scale. It has been observed that concentration on datasets drawn from supporting primary sources using machine learning algorithms brings the accuracy expected for cancer diagnosis. Methods: This research presents an innovative cancer classification technique that combines fast minimum redundancy-maximum relevance-based feature selection with Binary Portia Spider Optimization Algorithm to optimize features. The features selected, with the aid of fast mRMR and tested with a range of classifiers, Support Vector Machine, Weighted Support Vector Machine, Extreme Gradient Boosting, Adaptive Boosting, and Random Forest classifier, are tested for comprehensively proofed performance. Results: The classification efficiency of the advanced model is tested on six different cancer datasets that exhibit classification challenges. The empirical analysis confirms that the proposed methodology FmRMR-BPSOA is effective since it reached the highest accuracy of 99.79%. The result is of utmost significance as the proposed model emphasizes the need for alternative and highly efficient greater precision cancer diagnosis. The classification accuracy concludes that the model holds great promise for real-life medical implementations.

DNA microarray data analysis is notorious because it contains a large number of characteristics, asymmetrical class distribution, and it is restricted with less number of samples. We emphasize high-dimensional multi-class unbalanced issues in this work. The high dimensional, multi-class unbalanced problem has found it challenging for traditional classifiers to execute classification assignments effectively on both minority and majority classes. Numerous approaches have been made to handle either high dimensionality datasets or difficulties with class imbalance. Despite this, because of their complex relationships, few techniques have been presented to address the intersection of multi-class unbalanced and high-dimensional issues at the same time. Using multiple filter-based rankers (MF) and a hybrid political optimizer (PO), this study proposes unique hybrid algorithms for feature selection with the high-dimensional multi-class imbalanced issue. To evaluate the performance of the model, we have used four different classifiers named Support vector machine (SVM), Naive Bayes(NB), Decision Tree(DT), and K Nearest Neighbour(KNN). The experimental results show that the proposed methods are more effective than other well-known methods in the case of classification performance improvisation. Performance metrics accuracy indicates that the proposed methods are capable of searching the feature space and identifying very robust and discriminative features that best predict the minority class.