Spam is commonly defined as unwanted e-mails and it became a global threat against e-mail users. Although, Support Vector Machine (SVM) has been commonly used in e-mail spam classification, yet the problem of high data dimensionality of the feature space due to the massive number of e-mail dataset and features still exist. To improve the limitation of SVM, reduce the computational complexity (efficiency) and enhancing the classification accuracy (effectiveness). In this study, feature selection based on one-way ANOVA F-test statistics scheme was applied to determine the most important features contributing to e-mail spam classification. This feature selection based on one-way ANOVA F-test is used to reduce the high data dimensionality of the feature space before the classification process. The experiment of the proposed scheme was carried out using spam base well-known benchmarking dataset to evaluate the feasibility of the proposed method. The comparison is achieved for different datasets, categorization algorithm and success measures. In addition, experimental results on spam base English datasets showed that the enhanced SVM (FSSVM) significantly outperforms SVM and many other recent spam classification methods for English dataset in terms of computational complexity and dimension reduction.
Radial Based Function Neural Network models (RBFNN) are currently used deep-rooted methods for assessing the stages of diagnosis of chronic diseases. The goals of this research are to suggest a model for the diagnosis of breast cancer, and to be able to estimate the stages of development of pre-malignant breast tumors. The significance of the study is to develop an integrated RBF neural network with ensemble features using the boosting method. The importance of the ensemble boosting method is to generate a sequence of models to achieve more precise predictions. One of the ensemble boosting advantages is that it can take longer to build and to score than a RBF NN standard model. By using ensemble boosting, the accuracy of breast tumor diagnosis increased and thus it became easier to know the stage of the tumor, and whether it was malignant or benign. This will help doctors to select appropriate treatment for each tumor stage, consequently leading to the salvage of cancer patients with this type of tumor. The suggested RBFNN method was examined on the different type of UCI breast cancer datasets. The general diagnosis accuracy based on 10-fold cross validation using RBFNN method obtained 97.4%, 98.4%, 97.7% and 97.0% for the WBC, BCD, BCP, and WBCD UCI datasets respectively. The effectiveness of the proposed method was confirmed by comparing accuracy improvement both before and after using ensemble boosting, and it was found to be more accurate compared with other breast cancer diagnosis methods such as Logistic Regression (91.5%), KNN (96%), SVM (89%), Decision tree (95.13%), CNN (97.66%), and Naive Bayes (91%).
Graph-based text representation is one of the important preprocessing steps in data and text mining, Natural Language Processing (NLP), and information retrieval approaches. The graph-based methods focus on how to represent text documents in the shape of a graph to exploit the best features of their characteristics. This study reviews and lists the advantages and disadvantages of such methods employed or developed in graph-based text representations. The literature shows that some of the proposed graph-based methods suffer from a lack of representing texts in certain situations. Currently, several techniques are commonly used in graph-based text representation. However, there are still some weaknesses and shortages in these techniques and tools that significantly affect the success of graph representation and graph matching. In this review, we conduct an inclusive survey of the state of the art in graph-based text representation and learning. We provide a formal description of the problem of graph-based text representation and introduce some basic concepts. More significantly, this study proposes a new taxonomy of graph-based text representation, categorizing the existing studies based on representation characteristics and scheme techniques. In terms of the representation scheme taxonomy, we introduce four main types of conceptual graph schemes and summarize the challenges faced in each scheme. The main issues of graph representation, such as research topics and the sub-taxonomy of graph models for web documents, are introduced and categorized. This research also covers some tasks of understanding natural language processing (NLP) that depend on different types of graph structures. In addition, the graph matching taxonomy implements three main categories based on the matching approach, including structural-, semantic-, and similarity-based approaches. Moreover, a deep comparison of these approaches is discussed and reported in terms of methods and tools, the concepts of matching and locality, and the application domains that use these tools. Finally, the paper recommends seven promising future study directions in the graph-based text representation field. These recommendation points are summarized and highlighted as open problems and challenges of graph-based text representation and learning to facilitate and fill the research gaps for scientific researchers in this field.
19 March 2025 in Archives of Computational Methods in Engineering