F-measure Values Research Articles

A Novel Methodology for Classifying Wikipedia Articles: Insights into Digital Forensics and Content Integrity

Well-written articles shape readers interaction with information, as top-ranked articles are more likely to be seen than those further down the ranks. We present a new approach to classifying Wikipedia articles across various quality dimensions, harnessing knowledge gained from expert assessments. The study also includes an attempt to develop a solid framework that meets the evaluation of the quality of an article for the sole purpose to ensure the integrity of the content in the multipoint structure of the Internet, and to have input for the applications of Digital Forensics. The suggested method: the article details is gathered using the Wikipedia API and a set of metrics is well-defined to store and analyze this information. The methodology then explores the relationship between independent variables (metrics of the articles) and the dependent variable (quality level as rated by the experts). Three machine learning algorithms (RF, J48, and NB) are then used to classify the articles. The classification is dragged along with the expert reviews to determine whether quality level of Wikipedia articles. The empirical evidence illustrates the effectiveness of the proposed approach, with average accuracies greater than 70% for the J48 algorithm. The precision, recall and F-measure values corresponding to the classification models’ accuracy exceed 0.7, representing a strong performance model. Overall, these findings indicate that the method uses reliable criteria, which classifies Wikipedia articles in accordance with experts' opinions, making it a reliable tool for quality assessment. In addition, the study underscores the significance of the combined focus on precision and recall for assessing the quality of a model, thereby demonstrating how useful this method is in ensuring that content can be trusted and as part of digital forensics.

A fingerprinting structure model for Arabic document plagiarism detection

Plagiarism, which is a significant problem in the academic world worldwide, is particularly challenging to detect in Arabic due to the language's complex structure. Methodology: The ADPDM model and framework for detecting plagiarism in Arabic documents are presented in this dissertation. It is designed to detect plagiarism within academic contexts. By organizing documents logically into paragraphs, sentences, and words, the model seeks to establish a robust system that can identify duplicated content and search for similar documents within identifying corresponding sets. In particular, the study examines preprocessing techniques such as stop word removal, stemming, and rootage processing, followed by content-based methods utilizing fingerprinting and heuristic algorithms that are tailored to Arabic language features. To aid in efficient detection, the BKDR hash function is used for chunk having. To optimize computation time, heuristic algorithms are implemented at different levels of document representation, using metrics such as Longest Common Substring (LCS). To evaluate the ADPDM system, a corpus of 100 documents is utilized, which includes datasets from AraPlagDet and the Decision Support System (DSS). The performance of ADPDM is compared with other plagiarism detection methods using WCopyFind, but the latter has a higher computational speed than ADBDM. Its recall, precision, and F-measure values of 0. 78035, 0. 994264, and 0. 865688 respectively (ADPDM) are particularly notable for its ability to detect plagiarized content in Arabic documents. ADPDM is a successful anti-pluralist solution for Arabic text, even though it requires a longer processing time than WCopyFind.

DeepmiRNATar: A deep learning-based model for miRNA targets prediction

MicroRNAs (miRNAs) play a crucial role in regulating fundamental biological processes such as the cell cycle, differentiation, and apoptosis by directly interacting with multiple genes (mRNAs). This regulatory mechanism has a profound impact on cellular function and the overall physiological condition of an organism. However, the prediction of miRNA-mRNA interactions encounters computational challenges in the field of biology due to the diverse sequences and complex data patterns. To overcome these obstacles, this research effort introduced DeepmiRNATar, a tool designed to precisely pinpoint miRNA targets, offering essential assistance in the realm of disease management. DeepmiRNATar leverages the Word2vec-based DeepLncLoc approach for encoding miRNA sequence characteristics and utilizes the DNABERT pre-trained model for in-depth semantic comprehension of target sequences. Through the integration of TextCNN, BiLSTM, and SpatialConv Attention mechanisms, the model scrutinizes structural features, temporal relationships, and overall interactions within the sequences. Following a series of experimental assessments, DeepmiRNATar attained an impressive AUC of 99.15% on the evaluation dataset, on par with the current leading prediction methodologies. Notably, the precision-recall curve, sensitivity, and F-measure values reached 99.18%, 97.43%, and 95.47%, respectively. Compared to existing miRNA target prediction models, DeepmiRNATar demonstrates a notable enhancement in overall predictive accuracy. The successful creation and experimental validation of the DeepmiRNATar model signify a significant advancement in miRNA target identification technology.

Visual software defect prediction method based on improved recurrent criss-cross residual network

PurposeThis study aims to solve the problems of large training sample size, low data sample quality, low efficiency of the currently used classical model, high computational complexity of the existing concern mechanism, and high graphics processing unit (GPU) occupancy in the current visualization software defect prediction, proposing a method for software defect prediction termed recurrent criss-cross attention for weighted activation functions of recurrent SE-ResNet (RCCA-WRSR). First, following code visualization, the activation functions of the SE-ResNet model are replaced with a weighted combination of Relu and Elu to enhance model convergence. Additionally, an SE module is added before it to filter feature information, eliminating low-weight features to generate an improved residual network model, WRSR. To focus more on contextual information and establish connections between a pixel and those not in the same cross-path, the visualized red as integer, green as integer, blue as integer images are inputted into a model incorporating a fused RCCA module for defect prediction.Design/methodology/approachSoftware defect prediction based on code visualization is a new software defect prediction technology, which mainly realizes the defect prediction of code by visualizing code as image, and then applying attention mechanism to extract the features of image. However, the challenges of current visualization software defect prediction mainly include the large training sample size and low sample quality of the data, and the classical models used today are not efficient, and the existing attention mechanisms have high computational complexity and high GPU occupancy.FindingsExperimental evaluation using ten open-source Java data sets from PROMISE and five existing methods demonstrates that the proposed approach achieves an F-measure value of 0.637 in predicting 16 cross-version projects, representing a 6.1% improvement.Originality/valueRCCA-WRSR is a new visual software defect prediction based on recurrent criss-cross attention and improved residual network. This method effectively enhances the performance of software defect prediction.

An enhanced machine learning algorithm for type 2 diabetes prognosis with a detailed examination of Key correlates

This study aimed to construct a high-performance prediction and diagnosis model for type 2 diabetic retinopathy (DR) and identify key correlates of DR. This study utilized a cross-sectional dataset of 3,000 patients from the People’s Liberation Army General Hospital in 2021. Logistic regression was used as the baseline model to compare the prediction performance of the machine learning model and the related factors. The recursive feature elimination cross-validation (RFECV) algorithm was used to select features. Four machine learning models, support vector machine (SVM), decision tree (DT), random forest (RF), and gradient boost decision tree (GBDT), were developed to predict DR. The models were optimized using grid search to determine hyperparameters, and the model with superior performance was selected. Shapley-additive explanations (SHAP) were used to analyze the important correlation factors of DR. Among the four machine learning models, the optimal model was GBDT, with predicted accuracy, precision, recall, F1-measure, and AUC values of 0.7883, 0.8299, 0.7539, 0.7901, and 0.8672, respectively. Six key correlates of DR were identified, including rapid micronutrient protein/creatinine measurement, 24-h micronutrient protein, fasting C-peptide, glycosylated hemoglobin, blood urea, and creatinine. The logistic model had 27 risk factors, with an AUC value of 0.8341. A superior prediction model was constructed that identified easily explainable key factors. The number of correlation factors was significantly lower compared to traditional statistical methods, leading to a more accurate prediction performance than the latter.

Automated Diagnosing of Melanoma Based on the Stolz Algorithm

The article discusses an algorithm for automating melanoma diagnosing using computer vision and a neural classifier. The aim of the study is to develop an algorithm for efficient classification of melanoma in images, as well as the influence of dermoscopic features on diagnosing. New growths in the image are highlighted. Calculation of parameters for the Stolz formula and calculation of TDS (calculation of diagnosis) were carried out. Based on the calculations performed, the optimization problem was solved to clarify the boundaries of the neoplasm differentiation areas, and the Stolz formula coefficients adjustment, and a set for neural network training was generated; MLP was selected as a classifier. The average accuracy of the algorithm on two independent data sets is 86%. Classification by a neural network of two sets of images according to Stolz parameters is given. Based on the results, a diagnosing was made. Based on the Stolz algorithm, a set of images with skin neoplasms is pre-processed: the neoplasm is isolated, ABCD signs and the overall dermoscopic score are calculated from the image. The proposed algorithm for automated melanoma diagnosing based on the Stolz dermoscopic method showed good results on real sets of images. The reduced accuracy of the model on the HAM10000 set is due to the class imbalance (ratio of classes 1 to 9). A high F-measure value indicated a good balance between sensitivity and specificity of the model, with the model tending to be better at detecting melanoma true positive (TP) cases. High sensitivity is desirable for problems, where reducing false negatives (missing positive cases) is critical, even at the expense of increasing Type I errors. The completeness of the model was 88.54% and 95% and suggests that the model minimizes cases of missing diseases. It is concluded that the more accurately the ABCD parameters are calculated, the more accurately the model will be able to classify the disease; in the future, refining and dividing parameter D into several components can provide the model with additional features for classification.

An innovative attention infused- BiRecurrenTwin network assisted hybrid segmentation technique for accurate heart disease prediction

Heart disease is a noteworthy global health concern, profoundly affecting public health and individual well-being. Early prediction and diagnosis are crucial for reducing its negative impact. This work focuses on developing an effectual heart disease detection employing advanced optimization approaches and data processing. The proposed system incorporates a hybrid segmentation algorithm, Hybrid K-means-Fuzzy-C-means (HKMFCM) clustering, which assigns membership degrees to data points, enabling soft clustering and accommodating data uncertainty. Additionally, the Artificial Bee Colony (ABC) Optimization method is applied for feature selection, mimicking the foraging behavior of honeybees to identify the most discriminative attributes from the dataset. This optimization algorithm iteratively explores the feature space to select features that enhance the model's predictive accuracy. Furthermore, a novel classification architecture, termed the Attention-infused BiRecurrenTwin Network, is introduced to accurately predict heart disease based on segmented and extracted patient data profiles. This classifier leverages both Bidirectional Gated Recurrent Unit (BiGRU) and Bidirectional Long Short-Term Memory (BiLSTM) networks, with their bidirectional nature capturing both past and future contexts, thus increasing the classifier's capability to detect subtle temporal patterns in patient data. In addition, the proposed system addresses traditional approaches limitations through its advanced components like HKMFCM (effectively manages data uncertainty by enabling soft clustering), ABC Optimization technique (enabling an iterative, global search for the most discriminative attributes) Attention-infused BiRecurrenTwin Network (surpasses conventional classifiers by capturing both past and future temporal patterns in patient data). The simulation outcomes demonstrate that the developed system attains improved performance, with accuracy, ROC, F-measure, precision, recall, sensitivity, and specificity values of 96.09%, 97%, 95%, 96.6%, 94.3%, 95.14%, and 97.05%, respectively which is higher than the baseline models with an average of 7.75 % increase in accuracy. These results indicate that the developed predictive models show promise in accurately classifying individuals based on their extracted features, thereby facilitating the early recognition of heart disease.

PyPLIF HIPPOS-aided Construction and Retrospective Validation of Structure-Based Virtual Screening Protocol Targeting VEGFR2

Recently, the discovery of small molecules as inhibitors for vascular endothelial growth factor receptor 2 (VEGFR2) is of timely interest, especially in the area of ocular neovascular diseases. On the other hand, PyPLIF HIPPOS in combination with machine learning techniques has been reported to increase the prediction quality of structure-based virtual screening (SBVS) protocols. The original version of PyPLIF has served in the development of an SBVS protocol that successfully identified novel chalcone derivatives and short peptides as potent inhibitors for acetylcholinesterase. In this short communication, construction and retrospective validation of an SBVS protocol employing PyPLIF HIPPOS targeting VEGFR2 are presented to make it publicly available. The retrospective validation employed 409 active compounds and 24,950 decoys from the enhanced version of the directory of useful decoys. All compounds were docked independently 3 times using AutoDock Vina followed by the identification of the protein-ligand interaction fingerprints (PLIF) employing PyPLIF HIPPOS. The derived ensemble PLIF descriptors were then used in the decision tree construction using a machine-learning technique called recursive partitioning and regression trees. The best decision was then incorporated in the SBVS protocol. The F-measure and enrichment factor values of the SBVS protocol were 0.387 and 76.879, respectively. Hence, the SBVS protocol is readily available to screen small molecules or short peptides.

Privacy Preserving Evaluation of Sensitive Population Record Linkage in the Absence of Ground Truth Data

ObjectivesLinkage of data containing personal information allows extensive studies in the health and social sciences for population level studies. However, real-world linkage applications often lack ground truth (GT) data, generally due to privacy concerns, which hinders linkage quality assessment. We propose a method to assess the linkage of sensitive population data in the absence of GT data. ApproachOur method takes as input a set of sensitive and public population clusters. The sensitive clusters are generated with some record linkage algorithm, whereas the public population dataset, which is considered an approximation for the GT, is assumed to have a group identifier allowing generation of known clusters, such as households or families. We encode clusters as bit vectors and conduct cluster matching across the sensitive and public datasets using vector comparisons. Based on matched clusters, the population linkage quality of sensitive data is estimated. ResultsWe conducted experiments on a sensitive Scottish birth data set containing 17,613 records from 1861 to 1901, and four successive publicly available Scottish census datasets from 1871 to 1901. Using the quality measures precision, recall and the F-measure, we show that our estimations are close to GT quality, with a high correlation in F-measure values ranging from 88% to 99%. ConclusionWe proposed a method to estimate the linkage quality of sensitive population data for situations where public data with similar characteristics are available for approximating the GT. Our experimental evaluation showed that our method was effective in estimating true linkage quality with high accuracy.

Machine learning and computer vision technology to analyze and discriminate soil samples

Soil texture is one of the most important elements to consider before planting and tillage. These features affect the product selection and regulate its water permeability. Discrimination of soils by determining soil texture features requires an intense workload and is time-consuming. Therefore, having a powerful tool and knowledge for texture-based soil discrimination could enable rapid and accurate discrimination of soils. This study focuses on presenting new models for 6 different soil sample groups (Soil_1 to Soil_6) based on 12 different machine learning algorithms that can be utilized for various problems. As a result, overall accuracy values were determined as greater than 99.2% (Trilayered Neural Network). The greatest accuracy value was found in Bayes Net (99.83%) and followed by Subspace Discriminant (99.80%). In the Bayes Net algorithm, MCC (Matthews Correlation Coefficient) and F-measure values were obtained as 0.994 and 0.995 for Soil_4 and Soil_6 sample groups while these values were 1.000 for other soil groups. Soil types can visually vary based on their texture, mineral composition, and moisture levels. The variability of this can be influenced by fertilization, precipitation levels, and soil cultivation. It is important to capture the images in soil conditions that are more stable. In conclusion, the present study has proven the feasibility of rapid, non-destructive, and accurate discrimination of soils by image processing-based machine learning.

Mobile Web Application for Durian Orchard Management and Geospatial Data Visualization Using Deep Learning

Durian, a globally popular fruit, is primarily exported by Thailand, making it the foremost contributor to the world market. Nevertheless, there remains a notable absence of a comprehensive platform or application catering to both consumer tourists and businesses seeking domestic purchases. Prior research has highlighted several shortcomings, notably the inability of existing applications to provide location-based search functionality or automatically identify durian plantation plots from digital photographs. Consequently, this study proposes the development of a mobile web application aimed at managing, processing, and visualizing geospatial data pertaining to orchards and durian plantations. Through the integration of mobile technology, geospatial technology, and machine learning, the research endeavours to address these deficiencies. The findings indicate promising results, particularly in the accurate classification of durian plantations using four machine learning algorithms: convolutional neural network (CNN), support vector machine (SVM), random forest, and k-nearest neighbor (KNN). Among these algorithms, CNN exhibited the highest accuracy, achieving a value of 95%, with precision, recall, and f-measure values of 95.55%, 94.44%, and 94.97%, respectively.

Liver Cancer Diagnosis: Enhanced Deep Maxout Model with Improved Feature Set

This work proposed a liver cancer classification scheme that includes Preprocessing, Feature extraction, and classification stages. The source images are pre-processed using Gaussian filtering. For segmentation, this work proposes a LUV transformation-based adaptive thresholding-based segmentation process. After the segmentation, certain features are extracted that include multi-texon based features, Improved Local Ternary Pattern (LTP-based features), and GLCM features during this phase. In the Classification phase, an improved Deep Maxout model is proposed for liver cancer detection. The adopted scheme is evaluated over other schemes based on various metrics. While the learning rate is 60%, an improved deep maxout model achieved a higher F-measure value (0.94) for classifying liver cancer; however, the previous method like Support Vector Machine (SVM), Random Forest (RF), Recurrent Neural Network (RNN), Long Short Term Memory (LSTM), K-Nearest Neighbor (KNN), Deep maxout, Convolutional Neural Network (CNN), and DL model holds less F-measure value. An improved deep maxout model achieved minimal False Positive Rate (FPR), and False Negative Rate (FNR) values with the best outcomes compared to other existing models for liver cancer classification.

An enhanced AlexNet-Based model for femoral bone tumor classification and diagnosis using magnetic resonance imaging

ObjectiveBone tumors, known for their infrequent occurrence and diverse imaging characteristics, require precise differentiation into benign and malignant categories. Existing diagnostic approaches heavily depend on the laborious and variable manual delineation of tumor regions. Deep learning methods, particularly convolutional neural networks (CNNs), have emerged as a promising solution to tackle these issues. This paper introduces an enhanced deep-learning model based on AlexNet to classify femoral bone tumors accurately. MethodsThis study involved 500 femoral tumor patients from July 2020 to January 2023, with 500 imaging cases (335 benign and 165 malignant). A CNN was employed for automated classification. The model framework encompassed training and testing stages, with 8 layers (5 Conv and 3 FC) and ReLU activation. Essential architectural modifications included Batch Normalization (BN) after the first and second convolutional filters. Comparative experiments with various existing methods were conducted to assess algorithm performance in tumor staging. Evaluation metrics encompassed accuracy, precision, sensitivity, specificity, F-measure, ROC curves, and AUC values. ResultsThe analysis of precision, sensitivity, specificity, and F1 score from the results demonstrates that the method introduced in this paper offers several advantages, including a low feature dimension and robust generalization (with an accuracy of 98.34 %, sensitivity of 97.26 %, specificity of 95.74 %, and an F1 score of 96.37). These findings underscore its exceptional overall detection capabilities. Notably, when comparing various algorithms, they generally exhibit similar classification performance. However, the algorithm presented in this paper stands out with a higher AUC value (AUC=0.848), signifying enhanced sensitivity and more robust specificity. ConclusionThis study presents an optimized AlexNet model for classifying femoral bone tumor images based on convolutional neural networks. This algorithm demonstrates higher accuracy, precision, sensitivity, specificity, and F1-score than other methods. Furthermore, the AUC value further confirms the outstanding performance of this algorithm in terms of sensitivity and specificity. This research makes a significant contribution to the field of medical image classification, offering an efficient automated classification solution, and holds the potential to advance the application of artificial intelligence in bone tumor classification.

Proposed threshold-based and rule-based approaches to detecting duplicates in bibliographic database

Bibliographic databases are used to measure the performance of researchers, universities and research institutions. Thus, high data quality is required and data duplication is avoided. One of the weaknesses of the threshold-based approach in duplication detection is the low accuracy level. Therefore, another approach is required to improve duplication detection. This study proposes a method that combines threshold-based and rule-based approaches to perform duplication detection. These two approaches are implemented in the comparison stage. The cosine similarity function is used to create weight vectors from the features. Then, the comparison operator is used to determine whether the pair of records are grouped as duplication or not. Three research databases: Web of Science (WoS), Scopus, and Google Scholar (GS) on the Science and Technology Index (SINTA) database are investigated. Rule 4 and Rule 5 provide the best performance. For WoS dataset, the accuracy, precision, recall, and F1-measure values were 100.00%. For Scopus dataset, the accuracy and precision values were 100.00%, recall: 98.00%, and the F1-measure value is 98.00%. For GS dataset, the accuracy value was 100.00%, precision: 99.00%, recall: 97.00%, and the F1-measure value is 98.00%. The proposed method is potential tool for accurate detection on duplication records in publication databases.

Improving and comparing performance of machine learning classifiers optimized by swarm intelligent algorithms for code smell detection

In complex systems, the maintenance phase engenders the emergence of code smells due to incessant shifts in requirements and designs, stringent timelines, and the developer's relative inexperience. While not conventionally classified as errors, code smells inherently signify flawed design structures that lead to future bugs and errors. It increases the software budget and eventually makes the system hard to maintain or completely obsolete. To mitigate these challenges, practitioners must detect and refactor code smells. However, the theoretical interpretation of smell definitions and intelligent establishment of threshold values pose a significant conundrum. Supervised machine learning emerges as a potent strategy to address these problems and alleviate the dependence on expert intervention. The learning mechanism of these algorithms can be refined through data pre-processing and hyperparameter tuning. Selecting the best values for hyperparameters can be tedious and requires an expert. This study introduces an innovative paradigm that fuses twelve swarm-based, meta-heuristic algorithms with two machine learning classifiers, optimizing their hyperparameters, eliminating the need for an expert, and automating the entire code smell detection process. Through this synergistic approach, the highest post-optimization accuracy, precision, recall, F-measure, and ROC-AUC values are 99.09%, 99.20%, 99.09%, 98.06%, and 100%, respectively. The most remarkable upsurge is 35.9% in accuracy, 53.79% in precision, 35.90% in recall, 44.73% in F-measure, and 36.28% in ROC-AUC. Artificial Bee Colony, Grey Wolf, and Salp Swarm Optimizer are the top-performing swarm-intelligent algorithms. God and Data Class are the most readily detectable smells with optimized classifiers. Statistical tests underscore the profound impact of employing swarm-based algorithms to optimize machine learning classifiers, corroborated by statistical tests. This seamless integration enhances classifier performance, automates code smell detection, and offers a robust solution to a persistent software engineering challenge.

Cost Analysis and Prediction of Railroad Level Crossing Accidents for Indian Railways

With the tremendous increase in the number of vehicles, the dense traffic created can lead to accidents and fatalities. In a traffic system, the costs for accidents are immeasurable. Numerous studies have been carried out to predict the cost of fatal accidents but have provided the actual values. Therefore, in this study, a monkey-based modular neural system (MbMNS) is developed to identify accident cost. The accident cases and cost data were collected and preprocessed to remove the noise, and the required features were extracted using the spider monkey function. Based on the extracted features, the accidents and the costs were identified. For rail engineering, this will support evaluating the number of railroad crossing accidents with different time intervals. The impact of every accident was also measured with different cost analysis constraints, including insurance, medical, and legal and administrative costs. Therefore, the present study contributes to the field by collecting and organizing the present railroad level crossing accident data from crossing inventory dashboards. Then, the introduction of a novel MbMNS for the cost analysis is the primary contribution of this study to further enrich the railroad level crossing protection system. The third contribution is the tuning of the prediction layer of a modular neural network to the desired level to achieve the highest predictive exactness score. Hence, the designed MbMNS was tested in the Python environment, and the results were validated with regard to recall, accuracy, F-measure, precision, and error values; a comparative analysis was also conducted to confirm the improvement. The novel MbMNS recorded high accuracy of 96.29% for accident and cost analysis, which is better than that reported for other traditional methods.

HUMAN STRESS LEVEL IDENTIFICATION USING MACHINE LEARNING ALGORITHMS BASED ON SLEEPING PATTERNS

Stress is a mental or emotional state brought on by demanding or unavoidable circumstances, also referred to as stressors. In order to prevent any unfavorable occurrences in life, it is crucial to understand human stress levels. Sleep disturbances are related to a number of physical, mental, and social problems. This study's main objective is to investigate how human stress might be detected using machine learning algorithms based on sleep-related behaviors. The obtained dataset includes various sleep habits and stress levels. Six machine learning techniques, including Multilayer Perception (MLP), Random Forest, Support Vector Machine (SVM), Decision Trees, Naïve Bayes and Logistic Regression were utilized in the classification level after the data had been preprocessed in order to compare and obtain the most accurate results. Based on the experiment results, it can be concluded that the Decision tree algorithm, when used to classify the data, can do so with 93.27% accuracy, high precision, recall, and f1measure values, as well as the lowest mean absolute error (MAE) and root mean squared error rates (RMSE). We can estimate human stress levels using the study's findings, and we can address pertinent problems as soon as possible.

Optimizing an English text reading recommendation model by integrating collaborative filtering algorithm and FastText classification method

To comprehend the genuine reading habits and preferences of diverse user cohorts and furnish tailored reading recommendations, this study introduces an English text reading recommendation model designed specifically for long-tail users. This model integrates collaborative filtering algorithms with the FastText classification method. Initially, the integrated collaborative filtering algorithm is explicated, followed by the calculation of the user's interest distribution across various types of English texts, achieved through an enhanced Ebbinghaus forgetting curve and analysis of user reading behaviors. Subsequently, an intelligent English text reading recommendation is generated by amalgamating collaborative filtering algorithms with association rule-based recommendation algorithms. Through optimization of the recommendation generation process, the model's recommendation accuracy is enhanced, thereby augmenting the performance and user satisfaction of the recommendation system. Finally, a comparative analysis is conducted with respect to the Top-N algorithm model, matrix factorization-based algorithm model, and FastText classification model, illustrating the superior recommendation accuracy and F-Measure value of the proposed model. The study findings indicate that when the recommendation list contains 10, 30, 50, and 70 texts, the recommendation accuracy of the proposed algorithm model is 0.75, 0.79, 0.8, and 0.74, respectively, outperforming other algorithms. Furthermore, as the number of texts increases, the F-Measure of all four models gradually improves, with the final F-Measure of the proposed model reaching 0.81. Notably, the F-Measure of the English text reading recommendation model proposed in this study significantly surpasses that of the other three recommendation methods. Demonstrating commendable performance in recall rate, root mean square error, normalized cumulative gain, precision, and accuracy, the model adeptly reflects user reading interests, thereby enhancing the accuracy of text recommendations and the overall system performance. The study findings offer crucial insights and guidance for enhancing the accuracy and overall efficacy of English text recommendation systems.

Extractive Arabic Text Summarization Using PageRank and Word Embedding

Research on graph-based automatic text summarization for Arabic, the official language of 26 nations with over 200 million speakers, as well as other prevalent languages, has recently increased due to the ability of these approaches to handle linguistic peculiarities such as complex morphological linkages. The present paper proposes a graph-based extractive Arabic text summarization (GEATS) technique that employs word embedding and PageRank algorithms for feature extraction and sentence ordering. The efficiency of the GEATS approach versus the state-of-the-art methods is analyzed based on the quality of the produced summaries over the F-measure values. The findings indicated that it outperformed the nearest alternative by an advantage of over 7.5%.

Sentiment Analysis on Suicidal Tendency Affected by the COVID-19 Pandemic: A Comparison of Different Algorithms Using Twitter Data

Background: Unintentional behavioral changes brought on by the COVID-19 outbreak may have contributed to the increase in reported suicidal attempts. The coronavirus pandemic era has contributed to modifying existing domestic violence, mental health, conflict, and anxiety. Moreover, quarantine and self-isolation may have resulted in melancholy, suicidal thoughts, drug and alcohol misuse, and loneliness. Therefore, it is crucial and significant to gather data on the global prevalence of suicide and suicidal attempts throughout the pandemic. Objective: This study's objective was to evaluate the tone of tweets regarding suicide and whether or not those tweets are connected to COVID-19. Methods: Twitter is one of the most widely used channels for sharing people's thoughts in various situations. A total of 9750 tweets have been found with respect to COVID-19-related suicidal ideation and other suicides. Gathered data were pre-processed, and feature vectors were constructed in order to establish a forecast paradigm by using artificial neural networks (ANN), long short-term memory (LSTM), and support vector machine (SVM). Results: The results demonstrated that ANN outperformed SVM and LSTM in terms of classification, achieving 91.33% accuracy while also having greater recall, precision, F-measure, and minimum error values. Conclusion: The findings of this study may help to categorize peoples' suicidal thoughts successfully. The results will help to identify future suicidal incidents with the help of the proposed approach and avoid such kinds of situations from occurring.