Entropy-based Classifier Research Articles

Affirmative Ant Colony Optimization Based Support Vector Machine for Sentiment Classification

Sentiment analysis is part of contextual text mining, which detects, extracts and supports an organization in understanding their brand or service in social sentiment while monitoring the reviews provided by customers in online shops. The rise of online shopping and digitalization is practically achieved, and the quality of products is tough for users to judge. There is no model to find out about the same or unlike a set of people with similar sentiment analysis concerning online product evaluations. In this paper optimization-based classification algorithm is proposed namely, Affirmative Ant Colony Optimization Based Support Vector Machine (AACOSVM) to classify sentiments provided by customers in online shopping. This paper provides a new Ant Colony Optimization method via providing a novel pheromone model for support vector machine optimization parameters in two steps. The first one is statute of state transition, and the second step is statute of state updates. They aim to allow the ants to use the fake pheromone path to pick parameters and to motivate ants to create subsets having the least classification mistakes. The proposed work includes product review datasets from Amazon to assess the performance of the AACOSVM against existing classifiers, namely, Entropy-Based Classifier (EBC) and Enhanced Feature Attention Network (EFAN). Various review datasets are accessible at Amazon for various items. This research effort has identified a dataset from DVDs, books, kitchen appliances and electronics from the many multiple available review datasets. It utilizes the natural foraging behavior of ants towards searching for food to identify and classify the sentiments present in the product reviews. AACOSVM is evaluated using two standard data mining performance metrics, namely F-Measure and Classification Accuracy. Results indicate that the proposed classification algorithm AACOSVM achieves better F-Measure and Classification Accuracy than the EBC and EFAN classifiers.

Protein Subcellular Localization Based on Evolutionary Information and Segmented Distribution

The prediction of protein subcellular localization not only is important for the study of protein structure and function but also can facilitate the design and development of new drugs. In recent years, feature extraction methods based on protein evolution information have attracted much attention and made good progress. Based on the protein position-specific score matrix (PSSM) obtained by PSI-BLAST, PSSM-GSD method is proposed according to the data distribution characteristics. In order to reflect the protein sequence information as much as possible, AAO method, PSSM-AAO method, and PSSM-GSD method are fused together. Then, conditional entropy-based classifier chain algorithm and support vector machine are used to locate multilabel proteins. Finally, we test Gpos-mPLoc and Gneg-mPLoc datasets, considering the severe imbalance of data, and select SMOTE algorithm to expand a few sample; the experiment shows that the AAO + PSSM ∗ method in the paper achieved 83.1% and 86.8% overall accuracy, respectively. After experimental comparison of different methods, AAO + PSSM ∗ has good performance and can effectively predict protein subcellular location.

Entropy-Based Classifier Enhancement to Handle Imbalanced Class Problem

The paper presents a possible enhancement of entropy-based classifiers to handle problems, caused by the class imbalance in the original dataset. The proposed method was tested on synthetic data in order to analyse its robustness in the controlled environment with different class proportions. As also the proposed method was tested on the real medical data with imbalanced classes and compared to the original classification algorithm results. The medical field was chosen for testing due to frequent situations with uneven class ratios.

Combining Naïve Bayes and Modified Maximum Entropy Classifiers for Text Classification

Text Classificat ion is done mainly through classifiers proposed over the years, Naive Bayes and Maximum Entropy being the most popular of all. However, the individual classifiers show limited applicability according to their respective domains and scopes. Recent research works evaluated that the combination of classifiers when used for classification showed better performance than the individual ones. This work introduces a modified Maximum Entropy-based classifier. Maximum Entropy classifiers provide a great deal of flexibility for parameter defin itions and follow assumptions closer to real world scenario. This classifier is then combined with a Naive Bayes classifier. Naive Bayes Classification is a very simple and fast technique. The assumption model is opposite to that of Maximum Entropy. The combination of classifiers is done through operators that linearly co mbine the results of two classifiers to predict class of documents in query. Proper validation of the 7 proposed modifications (4 modifications of Maximum Entropy, 3 combined classifiers) are demonstrated through implementation and experimenting on real life datasets.

AN EFFECTIVE APPROACH FOR TEXT CLASSIFICATION

Text Classification is done mainly through classifiers proposed over the years, Naive Bayes and Maximum Entropy being the most popular of all. However, the individual classifiers show limited applicability according to their respective domains and scopes. Recent research works evaluated that the combination of classifiers when used for classification showed better performance than the individual ones. This work introduces a modified Maximum Entropy-based classifier. Maximum Entropy classifiers provide a great deal of flexibility for parameter definitions and follow assumptions closer to real world scenario. This classifier is then combined with a Naive Bayes classifier. Naive Bayes Classification is a very simple and fast technique. The assumption model is opposite to that of Maximum Entropy. The combination of classifiers is done through operators that linearly combine the results of two classifiers to predict class of documents in query. Proper validation of the 7 proposed modifications (4 modifications of Maximum Entropy, 3 combined classifiers) are demonstrated through implementation and experimenting on real life datasets.

Humans and Bots in Internet Chat: Measurement, Analysis, and Automated Classification

The abuse of chat services by automated programs, known as chat bots, poses a serious threat to Internet users. Chat bots target popular chat networks to distribute spam and malware. In this paper, we first conduct a series of measurements on a large commercial chat network. Our measurements capture a total of 16 different types of chat bots ranging from simple to advanced. Moreover, we observe that human behavior is more complex than bot behavior. Based on the measurement study, we propose a classification system to accurately distinguish chat bots from human users. The proposed classification system consists of two components: 1) an entropy-based classifier; and 2) a Bayesian-based classifier. The two classifiers complement each other in chat bot detection. The entropy-based classifier is more accurate to detect unknown chat bots, whereas the Bayesian-based classifier is faster to detect known chat bots. Our experimental evaluation shows that the proposed classification system is highly effective in differentiating bots from humans.

Entropy-based fuzzy classification parameter optimization using uncertainty variation across spatial resolution

In the past researchers have suggested hard classification approaches for pure pixel remote sensing data and to handle mixed pixels soft classification approaches have been studied for land cover mapping. In this research work, while selecting fuzzy c-means (FCM) as a base soft classifier entropy parameter has been added. For this research work Resourcesat-1 (IRS-P6) datasets from AWIFS, LISSIII and LISS-IV sensors of same date have been used. AWIFS and LISS-III datasets have been used for classification and LISS-III and LISS-IV data were used for reference data generation, respectively. Soft classified outputs from entropy based FCM classifiers for AWIFS and LISS-III datasets have been evaluated using sub-pixel confusion uncertainty matrix (SCM). It has been observed that output from FCM classifier has higher classification accuracy with higher uncertainty but entropy-based classifier with optimum value of regularizing parameter generates classified output with minimum uncertainty.