Sentiment Analysis System for Classification of Patient-Generated Health Reviews Using Rough Set Theory and Machine Learning Technique

2020 ◽  
Vol 10 (10) ◽  
pp. 2361-2368
Author(s):  
Alaa Omran Almagrabi ◽  
Shakeel Ahmad

Advancements in social media domain have led to a prominent progress in the number of online communities. Sites, such as Twitter and Facebook, provide an avenue for the unrestricted generation, communication, and distribution of messages as well as information. In this work, we propose a sentiment classification system from patient-generated content posted by users on medical forums and social media sites. The rough set theory is a numerical rule-based technique employed for categorizing and examining doubtful, partial or indistinct data. The emphasis of this study is on the employment of the rough set theory technique for sentiment classification of patient-generated health reviews. We investigated four rough set theory-based algorithms, namely: Genetic, Learning from Examples Module version 2 (LEM2), Exhaustive and Covering, to generate rules for sentiment classification of patient-generated health reviews text. The Rough Set Exploration System (RSES 2.0) software is utilized to conduct experiments. Additionally, we applied SVM classifier to classify emotions. The experimental results show that the Genetic algorithm outperforms the comparing algorithms with an accuracy of 84.2% and Support Vector Machine outperforms other classifiers with an accuracy of 80.5%.

2014 ◽  
Vol 543-547 ◽  
pp. 2329-2332
Author(s):  
Dong Li

In Recent years, with the rapid development of facial expression recognition technology, processing and classification of facial expression recognition has become a hotspot in application studies of remote sensing. Rough set theory (RS) and SVM have unique advantages in information processing and classification. This paper applies RS-SVM to facial expression recognition, briefly introduce the concepts of RS and principle of SVM, attributes reduction in RS theory as preposing system to get rid of redundancy attributes. Meanwhile, the SVM classifier works as postposing system helps training and classifying the facial expression recognition. Experimental results indicate this model not only raise the operating speed, but also improve classification performance, providing a new effective way in facial expression recognition technology.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Jianchuan Bai ◽  
Kewen Xia ◽  
Yongliang Lin ◽  
Panpan Wu

As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both theory and application. By using the covering rough set, the process of continuous attribute discretization can be avoided. Firstly, this paper focuses on consistent covering rough set and reviews some basic concepts in consistent covering rough set theory. Then, we establish the model of attribute reduction and elaborate the steps of attribute reduction based on consistent covering rough set. Finally, we apply the studied method to actual lagging data. It can be proved that our method is feasible and the reduction results are recognized by Least Squares Support Vector Machine (LS-SVM) and Relevance Vector Machine (RVM). Furthermore, the recognition results are consistent with the actual test results of a gas well, which verifies the effectiveness and efficiency of the presented method.


2011 ◽  
Vol 230-232 ◽  
pp. 625-628
Author(s):  
Lei Shi ◽  
Xin Ming Ma ◽  
Xiao Hong Hu

E-bussiness has grown rapidly in the last decade and massive amount of data on customer purchases, browsing pattern and preferences has been generated. Classification of electronic data plays a pivotal role to mine the valuable information and thus has become one of the most important applications of E-bussiness. Support Vector Machines are popular and powerful machine learning techniques, and they offer state-of-the-art performance. Rough set theory is a formal mathematical tool to deal with incomplete or imprecise information and one of its important applications is feature selection. In this paper, rough set theory and support vector machines are combined to construct a classification model to classify the data of E-bussiness effectively.


Author(s):  
Malcolm J. Beynon

Rough set theory (RST), since its introduction in Pawlak (1982), continues to develop as an effective tool in classification problems and decision support. In the majority of applications using RST based methodologies, there is the construction of ‘if .. then ..’ decision rules that are used to describe the results from an analysis. The variation of applications in management and decision making, using RST, recently includes discovering the operating rules of a Sicilian irrigation purpose reservoir (Barbagallo, Consoli, Pappalardo, Greco, & Zimbone, 2006), feature selection in customer relationship management (Tseng & Huang, 2007) and decisions that insurance companies make to satisfy customers’ needs (Shyng, Wang, Tzeng, & Wu, 2007). As a nascent symbolic machine learning technique, the popularity of RST is a direct consequence of its set theoretical operational processes, mitigating inhibiting issues associated with traditional techniques, such as within-group probability distribution assumptions (Beynon & Peel, 2001). Instead, the rudiments of the original RST are based on an indiscernibility relation, whereby objects are grouped into certain equivalence classes and inference taken from these groups. Characteristics like this mean that decision support will be built upon the underlying RST philosophy of “Let the data speak for itself” (Dunstch & Gediga, 1997). Recently, RST was viewed as being of fundamental importance in artificial intelligence and cognitive sciences, including decision analysis and decision support systems (Tseng & Huang, 2007). One of the first developments on RST was through the variable precision rough sets model (VPRSß), which allows a level of mis-classification to exist in the classification of objects, resulting in probabilistic rules (see Ziarko, 1993; Beynon, 2001; Li and Wang, 2004). VPRSß has specifically been applied as a potential decision support system with the UK Monopolies and Mergers Commission (Beynon & Driffield, 2005), predicting bank credit ratings (Griffiths & Beynon, 2005) and diffusion of medicaid home care programs (Kitchener, Beynon, & Harrington, 2004). Further developments of RST include extended variable precision rough sets (VPRSl,u), which infers asymmetric bounds on the possible classification and mis-classification of objects (Katzberg & Ziarko, 1996), dominance-based rough sets, which bases their approach around a dominance relation (Greco, Matarazzo, & Slowinski, 2004), fuzzy rough sets, which allows the grade of membership of objects to constructed sets (Greco, Inuiguchi, & Slowinski, 2006), and probabilistic bayesian rough sets model that considers an appropriate certainty gain function (Ziarko, 2005). A literal presentation of the diversity of work on RST can be viewed in the annual volumes of the Transactions on Rough Sets (most recent year 2006), also the annual conferences dedicated to RST and its developments (see for example, RSCTC, 2004). In this article, the theory underlying VPRSl,u is described, with its special case of VPRSß used in an example analysis. The utilisation of VPRSl,u, and VPRSß, is without loss of generality to other developments such as those referenced, its relative simplicity allows the non-proficient reader the opportunity to fully follow the details presented.


Author(s):  
Rashmi K. Thakur ◽  
Manojkumar V. Deshpande

Sentiment analysis is one of the popular techniques gaining attention in recent times. Nowadays, people gain information on reviews of users regarding public transportation, movies, hotel reservation, etc., by utilizing the resources available, as they meet their needs. Hence, sentiment classification is an essential process employed to determine the positive and negative responses. This paper presents an approach for sentiment classification of train reviews using MapReduce model with the proposed Kernel Optimized-Support Vector Machine (KO-SVM) classifier. The MapReduce framework handles big data using a mapper, which performs feature extraction and reducer that classifies the review based on KO-SVM classification. The feature extraction process utilizes features that are classification-specific and SentiWordNet-based. KO-SVM adopts SVM for the classification, where the exponential kernel is replaced by an optimized kernel, finding the weights using a novel optimizer, Self-adaptive Lion Algorithm (SLA). In a comparative analysis, the performance of KO-SVM classifier is compared with SentiWordNet, NB, NN, and LSVM, using the evaluation metrics, specificity, sensitivity, and accuracy, with train review and movie review database. The proposed KO-SVM classifier could attain maximum sensitivity of 93.46% and 91.249% specificity of 74.485% and 70.018%; and accuracy of 84.341% and 79.611% respectively, for train review and movie review databases.


2011 ◽  
Vol 28 (01) ◽  
pp. 95-109 ◽  
Author(s):  
YU CAO ◽  
GUANGYU WAN ◽  
FUQIANG WANG

Effectively predicting corporate financial distress is an important and challenging issue for companies. The research aims at predicting financial distress using the integrated model of rough set theory (RST) and support vector machine (SVM), in order to find a better early warning method and enhance the prediction accuracy. After several comparative experiments with the dataset of Chinese listed companies, rough set theory is proved to be an effective approach for reducing redundant information. Our results indicate that the SVM performs better than the BPNN when they are used for corporate financial distress prediction.


2018 ◽  
Vol 52 (4-5) ◽  
pp. 1219-1232 ◽  
Author(s):  
Atena Gholami ◽  
Reza Sheikh ◽  
Neda Mizani ◽  
Shib Sankar Sana

Customer’s recognition, classification, and selecting the target market are the most important success factors of a marketing system. ABC classification of the customers based on axiomatic design exposes the behavior of the customer in a logical way in each class. Quite often, missing data is a common occurrence and can have a significant effect on the decision- making problems. In this context, this proposed article determines the customer’s behavioral rule by incomplete rough set theory. Based on the proposed axiomatic design, the managers of a firm can map the rules on designed structures. This study demonstrates to identify the customers, determine their characteristics, and facilitate the development of a marketing strategy.


2020 ◽  
Vol 176 ◽  
pp. 3235-3244
Author(s):  
Jarosław Becker ◽  
Aleksandra Radomska-Zalas ◽  
Paweł Ziemba

Sign in / Sign up

Export Citation Format

Share Document