2018 8thInternational Conference on Communication Systems and Network Technologies

A Sentiment analysis approach through deep learning for a movie

review
Tanushree Dholpuria 1 Y.K Rana2 Chetan Agrawal3
Dept. Of Computer Science and Dept. Of Computer Science and Dept. Of Computer Science and
Engineering Engineering Engineering
Radharaman Institute of Radharaman Institute of Radharaman Institute of
Technology & Science Technology & Science Technology & Science
Bhopal, India Bhopal, India Bhopal, India
tanushreedholpuria@gmail.com yuvrajkrishnarana@gmail.com chetan.agrawal12@gmail.com

Abstract— This paper presents a study of various learning
algorithms using sentiment analysis of movie reviews. Presently,
posting reviews on movies is one of the famous approaches for
expressing evaluations and grievances in the direction of the box
office collection success brought or viewer comments received.
The growing importance of sentiment analysis coincides with
the growth of social media along with critiques, forum
discussions, blogs, micro-blogs, Twitter, and social networks.
The field of the sentiment of evaluation is intently tied to natural
language processing and text mining. Sentiment Analysis, which
is likewise called opinion mining, is the sphere of having a look
at which analyzes human beings' reviews as thoughts to
understand if the character was “glad”, “unhappy”, “angry”
and so on. The essential goal of this paper is to illustrate the
research on deep learning model by using Convolutional Neural
Networks (CNN) with respect to supervised machine learning
classifiers (Naive Bayes, SVM, Logistic Regression, KNN and
Ensemble Methods). The improvement in classification model
accuracy through CNN classifier is presented as comparative
analysis of their performance.
Keywords- Sentiments analysis, Natural language processing,
Text mining, Opinion mining, Supervised machine learning, Deep
learning.
to extract polarity of texts. Earlier traditional methods go
Bag-of-Words (BOW) ideal were used for sentiments
classification. The BOW ideal is used for thought
representation. A sentence is given by bag of its words,
disregarding grammar and ultimately word decision but the
dependent multiplicity.
The new age of sentiments analyzing methods came facing
the point of interest which is statistical machine learning
algorithms. Machine learning algorithms (supervised and
unsupervised) like Naive Bayes, SVM, KNN etc. are
appointed to train sentiments classifiers. Generally, in
document classification, where each word frequency is used
as a feature classifier. Rather than it does not focus on the
order of words and semantics.
The deep learning model is quite different from traditional
machine learning methods. Specifically, deep learning model
is not dependent on the feature extractor since feature are
extracted during the training session. We had achieved the
remarkable results for sentiments analysis using deep
learning classifiers.

I. INTRODUCTION
Expressing opinions and posting reviews about places visited
or movies are seen has become really popular nowadays. This
has influenced to the hunger to automatically derive the sense
of this tremendous amount of data. The human interpretation
is complex appropriately teaching a machine to study the
distinctive grammatical nuances, cultural variations,
buzzword and misspellings that turn out in reviews provided
by users is a deep process. Advancements in machine
learning and intuitive language processing techniques
constrained it convenient to study user reviews and recognize
the user's opinions towards them. These methods of
sentiment analysis are convenient in a wide chain of domains,
such as business or politics [1].The purpose of machine A. Why movie domain? [3]
learning is to experiment with different machine learning Recently studies conducted regarding online
models for the task of sentiment analysis corpus [2]. opinions, comments, writing reviews, discussion
The sentiments analysis is the set of comments extracted from blogs. The most of the piles are used by the film
any source say twitter, YouTube, website or any blogs. A industry includes songs, movie premier, trailers,
certain amount of work is going on in a field of data mining television programs, and radioactivity to convey the

978-1-5386-5956-4/18/$31.00 ©2018 IEEE 173

DOI: 10.1109/CSNT.2018.33

Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
 actual profit earned by the movies. Since movies
play a significant role in the entertainment market
not only to entertain people but also dependent on
ratings and profits on the basis of reviews across the
globe. Ultimately it helps in generation of leads with
the help of previous data. The movie review dataset
is obtained from website Kaggle. The publicly
accessible website for movie review is IMDB
website.
In this research, we frame our textual transformation of
movie reviews where identified features are represented by
columns and particular review are represented by rows. The
matrix is provided as input to machine learning and deep
learning algorithms in order to train the specific models.
These models are further tested on performance parameters.
In addition, we will also focus on convolutional neural
networks (CNN) which has shown remarkable scores in text
classifications [4]. Inspired by biological neural networks,
the aim of this research is using CNN to identify particular
words and phrases in movie reviews. Besides though we
considered multiple reviews for a movie we focus on
feedforward neural networks [5]. It is an artificial neural
network where nodes do not constitute cycles within
connections. The flow of information is in one direction from
an input, hidden and output nodes. On the basis of
comparison with existing literature obtained results are
critically examined.
The hereafter paper is set as follows: section 2 deals with
literature survey of our study; section 3 presents proposed
algorithms and detailed methodology; section 4 describes
proposed approach; section 5 explains all our experimental
approach with respect to the comparison of obtained results.
Finally, section 6 concludes the paper with references and
future scopes.
II. LITERATURE SURVEY
According to K. Khan [6], Opinion mining is a way, used
for immediate extraction of development from the feedback
of others approaching some particular idea or problem. With
the maturing availability of online staple on Web and
popularity of speedy and productive resources of feedback
sharing a well-known as online review sites and individual
blogs, answer mining has commenced a delightful area of
research. the internet is the fastest medium for opinion
everyone from users. Human intuition and freak opinion
have in a superior way potential for development discovery
and censure support. They have spotted a scan which covers
techniques and methods that desire to entitle us to gain
opinion-oriented idea from a text.
This research effort deals mutually techniques and
challenges devoted to perspective analysis and feedback
mining. Zhang et al [7] describe that Sentiment
categorization aims at mining reviews of a group for an
actual event's subject or output by immediate classifying the
reviews into positive or negative opinions. With the speedy
developing of internet applications, sentiment classification
174
Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
would have immense opportunity to assist people with
immediate analysis of customers' opinions from the internet
information. Automatic feedback mining will well-being
both the decision maker and ordinary people. Up to
instantly, it is more a sophisticated task mutually a copious
challenge. There are above all two types of approaches for
sentiment classification, machine learning methods, and
semantic outlook methods.
Balahur & Montoyo [8] states that a feature has determined
opinion summarization approach, whereas in the term
''driven{''} is engaged to describe the concept-to-detail
(product class to product-specific characteristics) approach.
For each output category we as a matter of choice
automatically recognize general features (characteristics
describing an entire product, one as rate, length, design), and
for each product, we then learn specific features (as describe
and evaluation in the position of a digital camera) and
centerpiece attributes.
Liu et al. [9] have extended models and algorithms for
predicting the helpfulness of reviews, which provides the
essence for discovering the most profitable reviews for
subject to products. The as a matter of choice shows that the
helpfulness of a review depends on three significant factors:
the reviewer away with, the writing by the number of the
review, and the timeliness of the review. Based on the
analysis of those factors, we express a nonlinear regression
model for helpfulness prediction. Our empirical design on
the IMDB movie reviews dataset demonstrates that the
proposed approach is intensively effective.
Cheng and Wang [10] has circulating Collaborative
Filtering (CF) has been direct many attention systems
effectively, a well known as IMDB, Netflix thus on. The
basic subject of a CF program is to bring about
recommendations based on the experiences of past similar
users. The users' option can be categorized into design and
kernel information. The ancient was supplied by the mean
users and a while after represents affect opinions provided by
experts (such as film critics). Both information types are
valuable and important for the CF system. This design
attempts to propose a contemporary collaborative filtering
frame of reference based on the fuzzy fit theory which
integrates the intellectual and prospect information. The new
methodology not only provides a comprehensive result but
also solve the problems of the traditional CF system, new
user, and new item. Finally, an experiment is performed.
Steinberger et al [11] present a semi-automatic concern to
creating a point of view dictionaries in profuse languages.
They produced high-level gold-standard bias dictionaries for
two humanistic discipline and earlier translated them
automatically directed toward third languages. Those
troubles that cut back be bottom in both propose language
style lists are perhaps to be used seeing their remark senses
are within the realm of possibility to be evocative to that of
the two source languages. These dictionaries boots are by the
same token more corrected, forever and ever and improved.
In this paper, we describe results that show our triangulation
 guesswork, by evaluating triangulated lists and comparing
them to non-triangulated machine-translated interpretation
lists.
Dave et al [12] begin by identifying the incredible properties
of this problem and develop a rule of thumb for automatically
distinguishing between convinced and by no means reviews.
Their classifier draws on artificial intelligence techniques for
highlight extraction and scoring, and the results for discrete
metrics and heuristics contradict depending on the
problematic situation. The exceptional methods what one is
in to as abundantly as or has a jump on than constant machine
learning. When occupied on abandoned sentences stored
from internet searches, the show is limited guerdon to imply
and ambiguity. But in the framework of an everywhere web-
based what under the hood and aided by a simple method for
grouping sentences into attributes, the results are
qualitatively completely useful.
Ye et al [13] have done where one is at classification
techniques were homogeneous into the domain of mining
reviews from commute blogs. Specifically, they compared
three supervised machine learning algorithms of Naive
Bayes, SVM and the approach-based N-gram model for
determining a classification of the reviews on commute blogs
for seven popular drawback and forth destinations in the US
and Europe. Empirical findings implicit that the SVM and N-
gram approach outperformed the Naive Bayes approach and
that when training datasets had an ample number of reviews,
for the approximately part three approaches reached
accuracies of at determinative 80%.
Joshi and Penstein Rose [14] has explored at which point
features based on syntactic protectorate relations can be
utilized to recover performance on opinion mining. Using a
break with the past of dependency recurrence triples, we
incline them into integration back-off features that conclude
better than the consistent lexicalized dependency recurrence
features. Experiments comparing our concern with several
special approaches that generalize protectorate features or
ngrams investigate the utility of integration back-off features.
III. PROPOSED METHODOLOGY
The main approaches towards sentiments analysis are used in
the literature survey based on binary sentiments classification
and multiclass classification. In binary classification, each
review is classified into two classes i.e positive and negative.
On the other hand in multi-class classification, it is referred
to as positive, strongly positive, neutral, negative, strong
negative. Mostly binary classification is used for comparison
of two sentiments like “ happy” and “sad”.
The case design builds on movie reviews that are stacked in
an unstructured textual format. Unstructured data is further
converted into meaningful disclosure by applying machine
learning algorithms. Traditional methods of machine learning
algorithms were secondhand by researchers but when it
comes to large datasets with the rapid flow of data
continuously increasing day by day it's hard to analyze with
175
Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
the machine learning models. Meanwhile, we had proposed
deep learning algorithms for our main approach.
Now the task of processing unstructured data which includes
removal of vague texts, removal of blank spaces which are of
no use in sentences. This process data is further converted
into numerical vectors. Each vector is the representation of a
feature of movie reviews. We are using Count Vectorizer that
is based on a number of features occurred in a review and
sparse matrix is created [15].
On labeled dataset supervised machine learning algorithms
are used. Each review is labeled as a substitute positive or
negative. This design comprises of machine learning and
deep learning algorithms are as follows:
A. Naive Bayes (NB) Classifier: It belongs to the family
of probabilistic classifiers based on Bayes theorem
assuming the features of strong independence [16].
This classifier is completely scalable and requires the
only a small approach of learning by doing for the
projection of valuable dimensional feature. It is highly
used for calculating the variance for independent
features rather than the complete covariance matrix.
Bayes theorem is the posterior probability P(c|x) from
P(c), P(x) and P(x|c). Mathematically it is given as:
P =PC W c)
v 1’ p (x )
Here P(c|x) is the posterior probability of predictor
in given class (c, target), (x, attribute)P(c) is the
class of prior probability. P (x|c) is the probability of
predictor given class. P(x) is the prior probability of
predictor. For further computation, the term P(c|x)
is decomposed with the assumption of fi’s that are
conditionally independent of given x’s class. This
decomposition is given as:
P ( c ) (Z i= 1 P ( / t ) |c )
P n b (c\x) P (x )
B. Logistic regression: It is the statistical model used on
a duplex-dependent variable. The feasible dependent
variable is "0" and " 1" like fail or pass, win or loss etc.
logistic regression can be explained separately logistic
function known to be a sigmoid function. In sigmoid
function real input is denoted by t, (t £ R) and the value
of output lies between 0 to The logistic function can
be defined as :
1
P(x) = 1+ p-(P0+pix) [1 7]
C. Support Vector Machine : It is the non-probabilistic
approach of a binary linear classifier. It is defined by
decision boundaries with the help of the input space in
computation [18] The input data comprises two sets of
vectors size m. The SVM models represented as a
vectorized form of datapoint in a space. It finds the
hyperplane with the separation of two classes in
marginal boundaries. After logistic regression can be
 explained individually logistic function known to be a single neuron architecture given below.
sigmoid function. It is given as:
— — — — • Biological neuron: So here firstly we are
w= acjdj, a j > 0 going to explain with the simple description
of single neuron mechanism that how it is
here cj£{1,-1} is the class of positive and negative for
inspired by biological neural system and
document dj, the equation for weight vector w
later on used as artificial neural network in
computation studies.
D. K nearest neighbor: It is the lazy learning approach
where functions are approximately computed on
dependent clusters in a coordinate plane. In
categorization, the split membership is the yield, and
objects are classified by restraint numbers of votes as
its neighbors and object considering assigned as k
nearest neighbors. In the training art, an adjunct of
learning had a reference to each file in the category
and represented by voting age labels as k nearest labels
[19]. If we require one nearest neighbor classifier that
relates x link to a category of the closest neighbor in
space achievement can be subject to as:
Cnnn (X) = Y(I)
H ere C^nn is the weighted nearest classifier with
weights w in i=1 to n.
In the above figure 2 information in the brain are
E. Ensemble method: Multiple design algorithms of carreid by dendrites to cell body.The signals are
statistics and machine learning are used to earn better processed by axon which connects another neuron
predictive performance. In term to draw to a close with axon terminals.
variance bagging, boosting and stacking are used. In • Artificial neuron: Similarly the artificial
bagging each ideal are given away with approach neural network are build to carry out the
weights. Each ideal is trained by a training fit of the information for processing. Neural network
randomly drained subset. Boosting is based on the is a significant approach of artificial
transformation of unfit learner facing an outstanding intelleginece. A single neuron is the
learner [20]. The ruling tree is used as arbitrary forest quantity that hold the specific number or
models to what place each feature are split into a word. This quantity is known as activation
different level of the tree. Stacking is the combination in artificial neural network.
of classification and regression models via meta
regressor or meta-classifier. The training is given to
base level classifier and further meta-classifier is
trained for output.

F. Convolutional Neural Networks: These networks are

based on deep learning methods. Since it is inspired by
the biological process of neurons the patterns are
structured in such a way that neurons seem to be visual
cortex of an animal. CNN uses the little pre-processing
means the pattern learns from the filters as compared
to traditional machine study algorithms. The
convolutional neural network comprises an input
layer, a hidden layer, and output layers respectively. The above fig 3 describes the single artificial neuron
Further CNN constitutes pooling layers and which read values from x vector say X1,X2.....Xd
completely accessible layers. Pooling layers constitute and perform the computation on neuron carried with
of local and overall pooling layers which are combined some weight W say W1, W2....Wn. Here bias ‘b ’ is
with the output of such layer and into the later layer of the another neuron which always have the positive
single neurons. Fully connected layers are the weight added to each layer . Bias help the neurons
combination of neurons connected by all of one layer to get learned from input layer in artificial neural
to various layers. We understood from the basic of network. Also help the neuron to converge faster. In

176

Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
 the equation form the activation of single neuron can
be calculated as:
a(x) = c + £ iWiXi
here ‘i ’ denotes to indices as number of inputs to
neuron calculated as the product weight of nodes
‘Wi’ with size of vector denoted as ‘Xi’ to dth level.
And ‘c ’ is the activation function
• Feed forward neural networks: In deep
learning, feed forward neural networks are
fully connected multilayer perceptron
networks. It comprises of input layer,
hidden layer and output layer. The bias
nodes are connected next to input layer as a
part of training phase as shown in below Fig
4.
When input are feeded to input layer Xi,X 2 .. Xn and
multiplied with the respected weights to hidden
layer. Then bias is applied on further layer after
input layer so as to get activation function as
discussed previously in order to get output. Adding
bias to hidden layer is part of training phase inorder
to assign some weight to non weighted neuron if
coming from the input layer. The value of bias is
always 1the point to be noted .
• Backpropogation: The most important term
in neural network considered as the training
phase termed as backpropogation. The error
is computed in backward propogation from
the output. The weight of the output and
target weight are substracted in order to get
the actual error from the network and finally
assigned the new weights of network
layer.Specifically in multilayer feed
forward network delta chain rule is used in
each layer so as to compute gradient
iteratevely as shown in Fig 5.
Backpropogation may change the network
weights by using stochastic gradient decent
optimization method. It is the way to
minimise the objective function on
177
Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
particular weights associated with nodes.
Fig 5 Backpropogation in Artificial Neural Network.
The below is the derivative equation in which
backpropogation is denoted as:
WK+1 VVlk - nndwf
VVl = W —.
Here k is the cycle number, ^ is the learning
rate(basically a small number) and is the
aggregate error with respect to balanced weight in
derivative form.
We considered the dataset of a IMDB movie where
we took % of training data and testing is done on %.
The Bias assigned to each layer in the network.
Fromthe previous explanation it is clear that deep
learning is the effcient in calculating the error in
more precise way. Here is the major part of the
approach is decribed that is Convolutional Neural
Network (CNN).
The CNN is based on the idea of convnet which
means the layer in network.it comprises of multiple
layer based on multilayer perceptron model.
• Input Layer: The input layer have the
sentiments of movie review which are
positive or negative according to
reviewers who had seen the movie. We
took this from the the csv file database.
• Convolution layer: This layer is said to be
the core block of CNN. It takes the bunch
of filters which is applied to the input
parameters and create the activation
features.
• MaxPooling Layer: The information is
extracted in this layer and minimised for
further representataion. The max pooling
layer is the hidden layer where we obtain
the desired features.
• Fully Connected Layer: This layer identify
the final output category. It computes the
transformation by picking up the
 maximum value on the basis of probability
distribution value.
• Output Layer: This layer returns the
classification result that is updated by
backpropogation algorith. From the
training data the actual classification
output is obtained from this layer. The
output might be poistive or negative is
decided by the activation function also
called as transfer function connceted
between the two layers. We used sigmoid
function its value only lies between 0 to 1.
In order to predict the output sigmoid is
the best option based on probabilitistic
approach. ReLU(Rectified Linear Unit) is
used to remove the overfitting probability
that means negative will not be considered
and positive value are focused for
calculations. In below Fig 6depicts the
activation functions namely sigmoid in red
and ReLU in blue lines as shown in graph.
in the later layer. The subsamples are the part o f hidden
layers.
IV. PROPOSED APPROACH
The movie dataset has been taken which consist of 3000
reviews of positives and negatives. Each review goes through
the preprocessing step where all the information like missing
words, special character are removed. The feature extraction
is done in this step only. Sampling is used to select a subset
of observations from statistical populations. Sampling is used
in order to increase the efficiency in training process with
respect to the decrement of the computational load by
removing similar data item in the dataset. Further, in the
vectorization process matrix containing rows and columns
are applied on training and testing datasets through cross­
validation technique. The flow of the proposed system is as

Fig 6 Graph of sigmoid and ReLU activation function.

Here is the diagrammatic view of the architecture of CNN in

sentiment analysis classification.

Sentiments:
I like this
movie.
This movie
is really
inspiring.
The action
scene in
movie is not
I s N
^:______________ y
good. Deep Learning: Machine Learning:
,___ lnPu t __ * _- Convolution-** Max Fully ----- M OutpuL. Logistic regression
Layer layers pooling connected Layer K- nearest neighbor
laver layfr Ensemble Method

Fig 7: Convolutional Neural Networks Architecture.

From the above figures 7we can explained the convolutional Prediction

neural networks background working architecture.

Convolutional layers set a layer activity to the input, passing Accuracy
the substantiate to the later layer. The convolution emulates
the operation of an isolated neuron to visual stimuli. Fig 8 Proposed Approach in Diagramatic view.
Convolutional networks may include local or global pooling The following steps are used in classification in the above
layers, which became associated with the outputs of neuron approach:
clusters at a well-known layer directed toward a single neuron

178

Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
 Step 1. The dataset of a movie review is considered in on precision, recall and f1 Score are calculated. The
polarity form which consists of 3000 labeled reviews of comparison table is discussed in the coming sections.
positive and negative. A separate text is maintained for each
review. V. EXPERIMENTAL RESULTS
Step 2. As the dataset contains a large number of reviews so The performance measures like accuracy, precision, recall,
the information that is not in the needed is removed. The and F1 scores are used for evaluating sentiments for opinion
preprocessing is the technique in which unnecessary mining. All the experimental results are based on the
characters like are removed like (,@*&!~). We give more confusion matrix. The following are the parameters on which
weight to expression reviews rather than on particular we had focused.
characters which are repeating again and again [21]. 1) Confusion Matrix
Sometimes we get the reviews like so cooooooool, TABLE 3 COMPARISON OF CLASSIFICATION ALGORITHMS.
superbbbbbb, goooood work and excellent!!!!!!!!!!!!!. so True Class
these are the repeating words which are not included in this 00
00 Positive Negative
a
process and ignored. In this step removal of stops, words are o True Positive Count False Negative Count
considered. £ (TP) (FP)
I
Step 3. Sampling is the process of efficiency increment. s- False Negative Count True Negative Count
Step 4. The training is given in the training dataset. The (FN) (TN)
machine will be able to learn with the feature of sentiments
emotions of people reviews. And on the basis of training
testing is done on the other half of the dataset. TP+FN
2) Accuracy Score:
Step 5. Vectorization is used to divide the computation in TP+TN+FP+FN
several order of magnitude and the difference in loop Precision:
TD

3) TP+FP
increases with data size. Since we are dealing with a large
amount of data, rewriting the algorithms with matrix TP
4) Recall:
operations may lead to essential performance gains. The
Count Vectorizer provides the token count matrix of review. 2 TP
5) F1 Score:
Tokenizing is done on the review according to the occurrence 2TP+FP+FN
of the token. The sparse matrix is made on the basis of tokens
formed. Let's see how the Count Vectorizer works. As a • On the basis of accuracy, we can find distinct few
sample we can take the following sentences: parameters like precision-recall and F conclude for
i. Movie is good furthermore analysis.
ii. Movie is bad
iii. Movie is amazing • Precision (also called immediate from doubt
iv. Movie is ok predictive value) is the fraction of analogous
instances intervening the retrieved instances.
Here the matrix is generated of 4 * 6 . looking over the
sentences above there are four documents and six distinct • Recall- while extract (also experienced as
features namely F1, F2, F3, F4, F5, and F6 respectively. sensitivity) is the division of complementary
Below Table 1 provides the information in the form of binary instances that have been retrieved overall the total
representation of occurring words in sentences bunch. amount of relevant instances.
Both precision and recall are suitably based on an
TABLE 1 GENERATION OF MATRIX UNDER COUNTVECTORIZER.. understanding and design of relevance.
Sentences F1 F2 F3 F4 F5 F6
i. 1 1 1 0 0 0 • F score- A measure that combines precision and
ii. 1 1 0 1 0 0 recall is the harmonic mean of precision and recall,
iii. 1 1 0 0 1 0 the traditional F-measure or balanced.
iv. 1 1 0 0 0 1
• Epoch, batch size and iterations: One Epoch is when
Step 6. Once the numeric vectors are generated the different an executed dataset is passed along and backward
classification algorithms are used. Basically, we are using the over the neural network only ONCE. Since such
machine learning and deep learning classifiers for analysis. epoch is too carrying a lot of weight to feed to the
Step 7. When training is done and confusion matrix is computer at once we divide it directed toward
generated the illusion is done on the number of positive or several smaller batches. Number of batches needed
negative reviews to complete one epoch is known as iterations.
Step 8. Finally, accuracy is calculated on the basis of the
confusion matrix by taking the mean of all accuracies. Later

179

Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
 TABLE 3 COMPARISON OF CLASSIFICATION ALGORITHMS. other deep learning classifiers or on a much higher
Classification Accuracy F1score Precision Recall
range of datasets.
Algorithms Score score Score
Naive Bayes 98.158996 98.214286 97.738288 98.694943 A CKNOWLEDGMENT
Logistic 98.828452 98.859935 98.699187 99.021207
Regression I would like to give sincere gratitude to my guide Dr.Y.K
SVM 99.24686 99.265306 99.346405 99.184339 Rana and Ass. Prof Chetan Agrawal for continuous support
KNN 98.410042 98.459043 97.903226 99.021207 in completion of master thesis and research for their patience,
Ensemble 98.828452 98.859935 98.699187 99.021207 motivation, and knowledge. Beside my guide, I would like to
Method
thank my rest of the department faculties for their
Proposed 99.330544 99.345336 99.671593 99.021207
CNN encouragement and enthusiasm.
Last but not the least I would like to thank my family for
supporting me throughout my life.
Performance measures of classifiers
REFERENCES
100
[1] Rudy Prabowo and Mike Thelwall, “Sentiment
99 Analysis: A Combined Approach,” Journal of Informetrics,
Vol.3, Issue 2, pp.143-157, 2009.
98
[2] Alexander Pak, Patrick Paroubek, “Twitter as a
97 Corpus for Sentiment Analysis and Opinion Mining,
“International Conference on Language Resources
y y .y
96
and Evaluation, pp.1320-1326, 2010.
[3] Mary Margarat Valentine, Ms. Veena Kulkarni,
Dr.R.R.Sedamkar A Model fo r Predicting Movie's
<<? Performance using Online Rating and Revenue,"
International Journal of Scientific & Engineering Research,
vol. Volume 4, no. issue 9, pp.277-282, 2013
Accuracy Score n F1 Score
i Precision Score Recall Score [4] Luda Zhao, Connie Zeng, “Using Neural Networks
to Predict Emoji Usage from Twitter Data ”,
Fig 8 Graphical Representation of Result Scores.
Sementic Scholar, pp.1-6,2-17.
[5] C. Albon, "Chris Albon," 2011. [Online]. Available:
VI. CONCLUSION AND FUTURE SCOPE https://chrisalbon. com/.

In this paper, our main bring to a focus is on
accuracy by all of the expression of classifiers.
Though we cannot deny traditional classifiers of
machine learning considering the base paper
analysis we took other supervised learning
classifiers like KNN, ensemble methods, and
logistic regression. Previously the base of operation
paper research was done by researchers on naive
Bayes and support vector machines. The work we
had proposed through deep learning model
concluded that in terms of accuracy its giving
reliable performance with the large dataset. Since
every day new data in the form of tweets, comments
are being posted so it's very important to analysis the
classifier on a large dataset. So with this mindset, we
approached CNN classifier to get the better one. Our
results become to well help evidence providing
constituent to statement level deep learning
concepts. In the future, one can experiment with
[6] Khairullah_____ Khan ; Baharum_____ B.
Baharudin ; Aurangzeb______ Khan ; Fazal-e-Malik
"Mining opinion from text documents: A survey,"
International Conference on Digital Ecosystems and
Technologies, DEST ’09, 2009.
[7] ng, W. Zuo, T. Peng and F. He, "Sentiment
Classification fo r Chinese Reviews Using Machine Learning
Methods Based on String Kernel," 2008 Third International
Conference on Convergence and Hybrid Information
Technology, vol. Volume 2, p. 5, 2008
[8] Alexandra Balahur; Andres Montoyo “ feature
dependent method fo r opinion mining and classification,"
International Conference on Natural Language Processing
and Knowledge Engineering, pp.1-6, 2008.
[9] Yang Liu ; Xiangji Huang ; Aijun An ; Xiaohui Yu
Modeling and Predicting the Helpfulness o f Online
Reviews, 8th IEEE International conference on Data Mining,
pp.1-5, 2008.

180

Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.
 [10] H.-A. W. Li-Chen Cheng, "A novel fuzzy
recommendation system integrated the experts ’ opinion,"
IEEE International Conference on Fuzzy Systems (FUZZ-
IEEE 2011), 2011.
[11] Josef Steinberger, "Creating sentiment dictionaries
via triangulation," Decision Support Systems 53(4), p. 5,
2012.
[12] Kushal Dave, "Mining the Peanut Gallery: Opinion
Extraction and Semantic Classification o f Product Reviews,"
Proc. 12th Int. Conf. World Wide Web, p. 10, 2003.
[13] Z. Z. R. L. Qiang Ye, "Sentiment classification o f online
reviews to travel destinations by supervised,"
elsevier.com/locate/eswa, p. 9, 2009.
[14] C. P.-R. Mahesh Joshi, "Generalizing Dependency
Features fo r Opinion Mining," Proceedings of the ACL-
IJCNLP 2009 Conference Short Papers , p. 3, 2009.
[15] G. M. Raul Garreta, "Learning Scikit learn Machine
Learning in Python," Packt Publishing Ltd, 2013, p. 118.
[16] McCallum, "A Comparison o f Event Models fo r
Naive Bayes Text Classification," Learning for Text
Categorization: Papers from the 1998 AAAI Workshop, p. 7,
1998.
[17] Wikipedia. [Online]. Available:
https://en.wikipedia.org/wiki/Logistic regression..
[18] V. A. K. a. S. Sonawane, "Sentiment Analysis o f
Twitter Data: A Survey o f Techniques," International Journal
of Computer Applications, vol. Volume 139, no. issue 11, p.
11, 2016.
[19] S. C. A. B. B. B. a. S. T. Lopamudra Dey, "Sentiment
Analysis o f Review Datasets using Naive Bayes and K-NN
Classifier," International Journal of Information Engineering
and Electronic Business, vol. Volume 4, p. 8, 2016.

[20] Medium, "Medium," [Online]. Available:

https://medium. com..
[21] M. A. M. F. a. M. J. S. Silvio Amir, "TUGAS:
Exploiting Unlabelled Data fo r Twitter Sentiment Analysis,"
Proceedings of the 8th International Workshop on Semantic
Evaluation (SemEval 2014), p. 4, 2014.
[9] G. S. Tomar, S. Verma & A sh ish Jha; “W eb
P age C lassification u sin g M odified n a ive
B a y s ia n A p p ro a ch ”, IEEE TENCON-2006, p p
1-4, 1 4 -1 7 N ov 2 0 0 6 .

181

Authorized licensed use limited to: Rajshahi University Of Engineering and Technology. Downloaded on January 15,2024 at 18:54:14 UTC from IEEE Xplore. Restrictions apply.