جامعة المعرفة
المصدر المعتمد للمعلومات البحثية والمخرجات هو قاعدة بيانات سكوبس (Elsevier Scopus) مع تدقيق بيانات الباحثين من عمادة البحث العلمي.

Research outputs

المخرجات البحثية

مقالات ومراجعات وأوراق مؤتمرات وفصول كتب، مفهرسة برقم DOI ومربوطة بباحثي الجامعة.

7 مُخرَج نتائج البحث عن «Machine learning»

مقالوصول مفتوح202323استشهاد· Semantic Scholar

An Efficient Brain Tumor Segmentation Method Based on Adaptive Moving Self-Organizing Map and Fuzzy K-Mean Clustering

Sensors · مجلد 23 (18) · 7816-7816

Brain tumors in Magnetic resonance image segmentation is challenging research. With the advent of a new era and research into machine learning, tumor detection and segmentation generated significant interest in the research world. This research presents an efficient tumor detection and segmentation technique using an adaptive moving self-organizing map and Fuzzyk-mean clustering (AMSOM-FKM). The proposed method mainly focused on tumor segmentation using extraction of the tumor region. AMSOM is an artificial neural technique whose training is unsupervised. This research utilized the online Kaggle Brats-18 brain tumor dataset. This dataset consisted of 1691 images. The dataset was partitioned into 70% training, 20% testing, and 10% validation. The proposed model was based on various phases: (a) removal of noise, (b) selection of feature attributes, (c) image classification, and (d) tumor segmentation. At first, the MR images were normalized using the Wiener filtering method, and the Gray level co-occurrences matrix (GLCM) was used to extract the relevant feature attributes. The tumor images were separated from non-tumor images using the AMSOM classification approach. At last, the FKM was used to distinguish the tumor region from the surrounding tissue. The proposed AMSOM-FKM technique and existing methods, i.e., Fuzzy-C-means and K-mean (FMFCM), hybrid self-organization mapping-FKM, were implemented over MATLAB and compared based on comparison parameters, i.e., sensitivity, precision, accuracy, and similarity index values. The proposed technique achieved more than 10% better results than existing methods.

brain tumor segmentationfuzzy c-means clusteringmagnetic resonance imagingWiener filter
مقالوصول مفتوح202315استشهاد· Semantic Scholar

Adaptive Weighted Low-Rank Sparse Representation for Multi-View Clustering

IEEE Access · مجلد 11 · 60681-60692

Ongoing researches on multiple view data are showing competitive behavior in the machine learning field. Multi-view clustering has gained widespread acceptance for managing multi-view data and improves clustering efficiency. Large dimensionality in data from various views has recently drawn a lot of interest from researchers. How to efficiently learns the appropriate lower dimensional subspace which can manage the valuable information from the diverse views is challenging and considerable issue. To concentrate on the mentioned issue, we asserted a novel clustering approach for multiple view data through low-rank representation. We consider the importance of each view by assigning the weight control factor. We combine consensus representation with the degree of disagreement among lower rank matrices. The single objective function unifies all factors. Furthermore, we give the efficient solution to update the variable and to optimized the objective function through the Augmented Lagrange’s Multiplier strategy. Real-world datasets are utilized in this study to exemplify the efficiency of the introduced technique, and it is contemplated to preceding algorithms to demonstrate its superiority.

multi-view clusteringlow-rank representationsparse representationview weighting
مقالوصول مغلق202311استشهاد· Semantic Scholar

Self-Attention Mechanism-Based Federated Learning Model for Cross Context Recommendation System

IEEE Transactions on Consumer Electronics · مجلد 70 (1) · 2687-2695

The traditional single-context recommendation algorithm is constrained by the sparse connection between users and items and a user/item cold start problem. Based on the review, the text-based cross-context recommendation algorithm extracts user/item comment information in the auxiliary context to alleviate the target context’s data sparsity problem and improve recommendation accuracy. A cross-context recommendation strategy based on self-attention-based federated learning (SAFL) is suggested in this work. In contrast to current algorithms, SAFL fully mixes the target and auxiliary background information. Federated learning addresses crucial challenges including data privacy, data security, data access rights, and access to heterogeneous data by allowing several players to develop a single, strong machine learning model without sharing data. To begin, self-attention mechanism is introduced to model the user’s preference information; then, the information from one field is used to improve the recommendation accuracy of another area; and finally, the information from the two contexts is integrated into the knowledge fusion module and the score prediction module to predict the score. Experiments on the Amazon dataset indicate that MAE and MSE values of SAFL are higher when compared to the current cross-context recommendation model, MAE values rose by 8.4%, 13.2%, and 19.4% across three cross-context datasets.

federated learningself-attentioncold startdata sparsity
مقالوصول مفتوح202311استشهاد· Semantic Scholar

RETRACTED ARTICLE: Multi-stage biomedical feature selection extraction algorithm for cancer detection

SN Applied Sciences · مجلد 5 (5)

Abstract Cancer is a significant cause of death worldwide. Early cancer detection is greatly aided by machine learning and artificial intelligence (AI) to gene microarray data sets (microarray data). Despite this, there is a significant discrepancy between the number of gene features in the microarray data set and the number of samples. Because of this, it is crucial to identify markers for gene array data. Existing feature selection algorithms, however, generally use long-standing, are limited to single-condition feature selection and rarely take feature extraction into account. This work proposes a Multi-stage algorithm for Biomedical Deep Feature Selection (MBDFS) to address this issue. In the first, three feature selection techniques are combined for thorough feature selection, and feature subsets are obtained; in the second, an unsupervised neural network is used to create the best representation of the feature subset to enhance final classification accuracy. Using a variety of metrics, including a comparison of classification results before and after feature selection and the performance of alternative feature selection methods, we evaluate MBDFS's efficacy. The experiments demonstrate that although MBDFS uses fewer features, classification accuracy is either unchanged or enhanced.

cancer detectiongene microarray datafeature selectionfeature extraction
مقالوصول مفتوح202311استشهاد· Semantic Scholar

A collaborative prediction approach to defend against amplified reflection and exploitation attacks

Electronic Research Archive · مجلد 31 (10) · 6045-6070

An amplified reflection and exploitation-based distributed denial of service (DDoS) attack allows an attacker to launch a volumetric attack on the target server or network. These attacks exploit network protocols to generate amplified service responses through spoofed requests. Spoofing the source addresses allows attackers to redirect all of the service responses to the victim's device, overwhelming it and rendering it unresponsive to legitimate users. Mitigating amplified reflection and exploitation attacks requires robust defense mechanisms that are capable of promptly identifying and countering the attack traffic while maintaining the availability and integrity of the targeted systems. This paper presents a collaborative prediction approach based on machine learning to mitigate amplified reflection and exploitation attacks. The proposed approach introduces a novel feature selection technique called closeness index of features (CIF) calculation, which filters out less important features and ranks them to identify reduced feature sets. Further, by combining different machine learning classifiers, a voting-based collaborative prediction approach is employed to predict network traffic accurately. To evaluate the proposed technique's effectiveness, experiments were conducted on CICDDoS2019 datasets. The results showed impressive performance, achieving an average accuracy, precision, recall and F1 score of 99.99%, 99.65%, 99.28% and 99.46%, respectively. Furthermore, evaluations were conducted by using AUC-ROC curve analysis and the Matthews correlation coefficient (MCC) statistical rate to analyze the approach's effectiveness on class imbalance datasets. The findings demonstrated that the proposed approach outperforms recent approaches in terms of performance. Overall, the proposed approach presents a robust machine learning-based solution to defend against amplified reflection and exploitation attacks, showcasing significant improvements in prediction accuracy and effectiveness compared to existing approaches.

DDoS mitigationvolumetric attackscollaborative predictionvoting classifier
مقالوصول مفتوح20234استشهاد· Semantic Scholar

Adaptive Rectified Linear Unit (Arelu) for Classification Problems to Solve Dying Problem in Deep Learning

International Journal of Advanced Computer Science and Applications · مجلد 14 (2)

A convolutional neural network (CNN) is a subset of machine learning as well as one of the different types of artificial neural networks that are used for different applications and data types. Activation functions (AFs) are used in this type of network to determine whether or not its neurons are activated. One non-linear AF named as Rectified Linear Units (ReLU) which involves a simple mathematical operations and it gives better performance. It avoids rectifying vanishing gradient problem that inherents older AFs like tanh and sigmoid. Additionally, it has less computational cost. Despite these advantages, it suffers from a problem called Dying problem. Several modifications have been appeared to address this problem, for example; Leaky ReLU (LReLU). The main concept of our algorithm is to improve the current LReLU activation functions in mitigating the dying problem on deep learning by using the readjustment of values (changing and decreasing value) of the loss function or cost function while number of epochs are increased. The model was trained on the MNIST dataset with 20 epochs and achieved lowest misclassification rate by 1.2%. While optimizing our proposed methods, we received comparatively better results in terms of simplicity, low computational cost, and with no hyperparameters.

leaky ReLUactivation functionsconvolutional neural networksMNIST classification
مقالوصول مغلق20233استشهاد· Semantic Scholar

Tree Seed Algorithm-based Feature Selection with Optimal Deep Learning Model for Supply Chain Management

Fluctuation and Noise Letters · مجلد 23 (02)

In recent days, supply chain and logistic industries have been going through a transformational wave of automation and digitization. Supply chain management (SCM) can involve machine learning (ML) abilities and prediction models to ensure that the demands are satisfied at a minimum cost. Intelligent models can be developed to determine whether adequate inventory is accessible to encounter the predictable rise in demands, and if not, the system spontaneously begins to adjust the orders with suppliers to source the raw materials for resolving the predicted future high demand. The conventional ways of SCM can be replaced by the design of recent artificial intelligence (AI) and deep learning (DL) techniques. By this motivation, this research presents a tree seed algorithm-based feature selection with optimum DL technique for supply chain management (TSA-ODLSCM). The proposed TSA-ODLSCM model involves the design of a feature subset selection approach using a tree search algorithm (TSA) algorithm. Besides, a new convolutional neural network with fuzzy cognitive maps (CNN-FCM) technique is designed for the classification process. Moreover, optimal parameter tuning of the CNN-FCM model was performed using the Henry gas solubility optimization (HGSO) technique. To exhibit the improved performance of the TSA-ODLSCM approach, a huge range of simulations were executed and outcomes were examined below several aspects. The experimental validation reported an enhanced 96.52% outcome of the TSA-ODLSCM approach over other methods.

supply chain managementfeature selectiontree seed algorithmconvolutional neural networks