Supervised term weighting for automated text categorization

Adolescents in higher education are more prone to Avoidant Personality Disorder (AVPD), which strongly affects academic achievement. The goal of this study was to create models for accurate prediction of the likelihood of Avoidant Personality Disorder among students in higher education. Information Gain, Gain Ratio, and Wrapper Approach are used as feature selection methods combined with data resampling techniques and machine learning, including Multi-Layer Perceptron Neural Network, Naïve Bayes, Decision Tree, Random Forest, and Support Vector Machine. The findings revealed that the Wrapper approach gave higher accuracy than Information Gain and Gain Ratio approach. Further, using the Gain Ratio approach gives the model a slightly higher efficiency than the Information Gain. Furthermore, when comparing feature selection and data resampling, it was found that the model using feature selection had more higher model efficiency than data resampling alone. Additionally, combining the Synthetic Minority Over-sampling Technique with Edited Nearest Neighbor (SMOTE-ENN) considerably increased the model’s effectiveness. Finally, the model’s efficiency was at its maximum, with an accuracy of 95.52%, when the Wrapper approach was used in conjunction with the Synthetic Minority Over-sampling Technique, the Edited Nearest Neighbor algorithm, and the Multi-Layer Perceptron Neural Network.

Now finding relevant information is absolutely needed by users of the information. Actually, finding relevant information is more difficult than just looking for information. The presence information retrieval (IR) system is a system for automatically searching the relevant information to the user needs, which is expressed in the required query, and this query will be used as an input and processed by IR system and then will get relevant documents to the required query. One of methods of finding relevant information by query is term weighting by both query and document. The commonly used methods are the term weighting of local and global weighting, while the local term weighting algorithms that are used such as TF, TF logarithmic, binary TF and augmented TF and global weighting is IDF, IDFP, IDFB. In this research, besides of comparison of term weighting algorithms, it is also proposed new improvement in term weighting algorithms by adding global weight value that changes base 10 logarithmic to base 2 logarithmic and adds the number 1 in the global term weighting IDFP. Measurements result of this research are Precision, Recall and NIAP. In This research, the best result for precision and NAIP have been performed by new propose term weighting algorithms. After compare and analyze the result of the weighting algorithms. It is necessary to combine the weighting with semantic algorithms so that it will get better result.

Random Forest algorithm eliminates the confines of a decision tree algorithm by reducing the over-fitting of datasets. It can handle the missing values in an effective manner and is more accurate than the decision trees. This research study presents a comparison of five different supervised machine learning algorithms namely Naive Bayes, Decision Tree, Multilayer Perceptron, Support Vector Machine and Random Forest for the classification of the disease dataset collected from an online repository. The Random Forest algorithm emerges to be the most efficient algorithm in classifying the diseases. Also, the research study applies different attribute selection measures to evaluate the impact of accuracy on the Random Forest classifier empirically. Among the different node splitting criteria, we conclude that the GINI index performed better on average than the Information Gain and Gain Ratio. The work is implemented using the Python 3.7 programming language.

Credit risk analysis forms an important criterion for the endurance of the banking sector. Understanding credit liability of customer enhances the security stability of the banker. This research is aimed at comparing the predictive accuracy of data mining techniques with feature selection and extraction techniques in the default of credit card clients and suggesting the most efficient technique for analyzing credit card default. Customer's default payments in Taiwan were used as the dataset. Machine Learning classification algorithms like K-nearest neighbor(KNN), Naive Bayesian(NB), Decision Tree(DT) and Support Vector Machines(SVM) were applied to the dataset. Feature filter methods like information gain (IG), gain ratio (GR) and chi-square (CS) and Wrapper based methods like Best First search(BFS) and Hill Climbing search (HCS) were used to identify minimum features required. Feature extraction methods such as Principal Component Analysis(PCA) and Linear Discriminant Anal-ysis(LDA) were also applied. The minimum features of feature selection algorithms along with PCA and LDA were then applied to Base classifiers and their accuracies were tabulated and compared. SVM with feature selection and extraction techniques had the best predictive accuracy.

Landslide susceptibility analyses using Random Forest, C4.5, and C5.0 with balanced and unbalanced datasets

In information retrieval (IR) and related tasks, term weighting approaches typically consider the frequency of the term in the document and in the collection in order to compute a score reflecting the importance of the term for the document. In tasks characterized by the presence of training data (such as text classification) it seems logical that the term weighting function should take into account the distribution (as estimated from training data) of the term across the classes of interest. Although "supervised term weighting" approaches that use this intuition have been described before, they have failed to show consistent improvements. In this article, we analyze the possible reasons for this failure, and call consolidated assumptions into question. Following this criticism, we propose a novel supervised term weighting approach that, instead of relying on any predefined formula, learns a term weighting function optimized on the training set of interest; we dub this approach Learning to Weight (LTW). The experiments that we run on several well-known benchmarks, and using different learning methods, show that our method outperforms previous term weighting approaches in text classification.

Feature selection is an important task during classification of any pattern. In this paper, we compute and compare the strengths of five most widely used feature ranking techniques in identifying the optimal subset of features for best classification results. The feature ranking measurements that are used here are information gain (IG), gain ratio (GR), correlation, symmetrical uncertainty (SU), and chi-square (CS). For evaluation purpose, recognition of handwritten numeral samples from five popular Indic scripts—Bangla, Hindi, English, Telugu, and Arabic—are used. These ranking methods are applied over quadtree-based longest run feature set. Experimental results are drawn and compared using support vector machine (SVM)-based classifier.

Examination is one of the common ways to evaluate the students’ cognitive levels in higher education institutions. Exam questions are labeled manually by educators in accordance with Bloom’s taxonomy cognitive domain. To ease the burden of the educators, several past research works have proposed the automated question classification based on Bloom’s taxonomy using the machine learning technique. Feature selection, feature extraction and term weighting are common ways to improve the accuracy of question classification. Commonly used term weighting method in the past work is unsupervised namely TF and TF-IDF. There are several variants of TF and TFIDF and the most optimal variant has yet to be identified in the context of question classification based on BT. Therefore, this paper aims to study the TF, TF-IDF and normalized TF-IDF variants and identify the optimal variant that can enhance the exam question classification accuracy. To investigate the variants two different classifiers were used, which are Support Vector Machine (SVM) and Naïve Bayes. The average accuracies achieved by TF-IDF and normalized TF-IDF variants using SVM classifier were 64.3% and 72.4% respectively, while using Naïve Bayes classifier the average accuracies for TF-IDF and normalized TF-IDF were 61.9% and 63.0% respectively. Generally, the normalized TF-IDF variants outperformed TF and TF-IDF variants in accuracy and F1-measure respectively. Further statistical analysis using t-test and Wilcoxon Signed also shows that the differences in accuracy between normalized TF-IDF and TF, TF-IDF are significant. The findings from this study show that the Normalized TF-IDF3 variant recorded the highest accuracy of 74.0% among normalized TF-IDF variants. Also, the differences in accuracy between Normalized TF-IDF3 and other normalized variants are generally significant, thus the optimal variant is Normalized TF-IDF3. Therefore, the normalized TF-IDF3 variant is important for benchmarking purposes, which can be used to compare with other term weighting techniques in future work.

Sentiment classification (SC) is an ongoing field of research, which involves computing opinions, sentiments, and the subjectivity of a text. It has recently been proven that imbalanced classification is challenging for the SC research community. Most existing studies assume that the balance between negative and positive samples may not be true in reality. This work describes a method to improve the problem of imbalanced sentiment classification using supervised term weighting schemes and shows how these weighting schemes can improve the performance of sentiment classification with imbalanced data, especially in the domain of multi-class classification. Nonetheless, to obtain the most appropriate term weighting schemes, five term weighting schemes are comparatively studied, namely tf-idf, tf-idf-icf, tf-rf, tf-igm, and sqrt_tf-igm. In addition to comparing several term weightings schemes, this work also compares four supervised machine learning algorithms to obtain an appropriate algorithm, including k-Nearest Neighbor (k-NN), Multinomial Naïve Bayes (MNB), Support Vector Machines (SVM) with linear, and SVM with RBF. After evaluating by F1, the performance of sqrt_tf-igm was superior to all other weighting schemes. Since the overall picture of sqrt_tf-igm returned better results than the tf-idf, tf-idf-icf, and tf-rf methods, with improved scores of F1 at 10.94%. Meanwhile, the result of sqrt_tf-igm was slightly better than tf-igm.

Determination of the different short oligonucleotide features in the full genome of fatal and mild coronavirus strains can show the researchers how these viruses evolved and became virulent strains. To this aim, at first, in the full genome of all coronavirus strains included in this study, the observed and expected frequency of dinucleotide to hexanucleotide was obtained using Markov method. Then odds ratio (observed/expected abundances) of short oligonucleotide was computed and considered as the raw data (features). Finally, ten distinct weighting algorithms approaches (Information Gain, Information Gain Ratio, Rule, Deviation, Chi Squared, Gini Index, Uncertainty, Relief, Support Vector Machine (SVM), and PCA) was employed on the features to identify oligonucleotide distribution differences across the full genome of SARS-related viruses compared to common cold coronaviruses. Totally among 5440 features (16 dinucleotides, 64 trinucleotides, 256 tetra nucleotides, 1024 penta-nucleotides, and 4096 Hexa-nucleotides), CC, CCA, CCAC, ACCAC, and CACCAC motifs were selected by 80 -90% of all weighting algorithms models to distinguish virulent strains from mild coronaviruses. These remarkable oligonucleotides might point toward the existence of some particular RNA elements that might be involved in viral virulence and thus can be targeted for viral treatment in the future.

A novel term weighting scheme for text classification: TF-MONO

Skin disease rates have been increasing over the past few decades. It has led to both fatal and non-fatal disabilities all around the world, especially in those areas where medical resources are not good enough. Early diagnosis of skin diseases increases the chances of cure significantly. Therefore, this work is comparing six machine learning algorithms, namely KNN, random forest, neural network, naïve bayes, logistic regression, and SVM, for the prediction of the skin diseases. The information gain, gain ratio, gini decrease, chi-square, and relieff are used to rank the features. This work comprises the introduction, literature review, and proposed methodology parts. In this research paper, a new method of analyzing skin disease has been proposed in which six different data mining techniques are used to develop an ensemble method that integrates all the six data mining techniques as a single one. The ensemble method used on the dermatology dataset gives improved result with 94% accuracy in comparison to other classifier algorithms and hence is more effective in this area.

In this article, first a comprehensive study of the impact of term weighting schemes on the topic modeling performance (i.e., LDA and DMM) on Arabic long and short texts is presented. We investigate six term weighting methods including Word count method (standard topic models), TFIDF, PMI, BDC, CLPB, and CEW. Moreover, we propose a novel combination term weighting scheme, namely, CmTLB. We utilize the mTFIDF that takes into account the missing terms and the number of the documents in which the term appears when calculating the term weight. For further robust term weight, we combine mTFIDF with two weighting methods. We evaluate CmTLB against the studied weighting schemes by the quality of the learned topics (topic visualization and topic coherence), classification, and clustering tasks. We applied weighting schemes to Latent Dirichlet allocation (LDA) and Dirichlet multinomial mixture (DMM) on eight Arabic long and short document datasets, respectively. The experiment results outline that appropriate weighting schemes can effectively improve topic modeling performance on Arabic texts. More importantly, our proposed CmTLB significantly outperforms the other weighting schemes. Secondly, we investigate whether the Arabic stemming process can improve topic modeling performance. We study the three approaches of Arabic stemming including root-based, stem-based, and statistical approaches. We also train topic models with weighting schemes on documents after applying four stemmers related to different stemming approaches. The results outline that applying the stemming process not only reduces the dimensionality of term-document matrix leading to fast estimation process, but also show enhancement of topic modeling performance both on short and long Arabic documents. Moreover, Farasa stemmer achieves the highest performance in most cases, since it prevents the ambiguity that may happen because of the blind removal of the affixes such as in root-based or stem-based stemmers.

The enthusiasm level of a person is an important measurement in real-world problems. This paper, therefore, presents face recognition classification for enthusiasm level, based on supervised machine learning, using Support Vector Machine (SVM) as a classifier, with a one-vs-one method because the data consists of more than two classes. In addition, Fisher’s Ratio and Information Gain are applied in the selection of contributive features, and the goals were to present an accuracy comparison between SVM and Fisher’s Ratio, as wells as with Information Gain, and the results showed the accuracy at 88,89%, and 80,95238%, respectively. This indicates the combination of SVM with Fisher Ratio to be better.

Multi-Tier Attention Network using Term-weighted Question Features for Visual Question Answering