Skip to content


  • Research
  • Open Access

Word clustering based on POS feature for efficient twitter sentiment analysis

Human-centric Computing and Information Sciences20188:17

Received: 6 April 2018

Accepted: 1 June 2018

Published: 18 June 2018


With rapid growth of social networking service on Internet, huge amount of information are continuously generated in real time. As a result, sentiment analysis of online reviews and messages has become a popular research issue [1]. In this paper a novel modified Chi Square-based feature clustering and weighting scheme is proposed for the sentiment analysis of twitter message. Along with the part of speech tagging, the discriminability and dependency of the words in the tagged training dataset are taken into account in the clustering and weighting process. The multinomial Naïve Bayes model is also employed to handle redundant features, and the influence of emotional words is raised for maximizing the accuracy. Computer simulation with Sentiment 140 workload shows that the proposed scheme significantly outperforms four existing representative sentiment analysis schemes in terms of the accuracy regardless of the size of training and test data.


Sentiment analysisTwitter classificationPart of speech trainingWord clustering


Recently, massive volume of data are generated and shared through internet [24]. There exist various forms with the data originated from internet, and especially text is quite popular for expressing and sharing information between individual users. Therefore, text classification has drawn increasing interests [5], which automatically processes and categorizes the text data into predefined categories using an analytical model constructed based on the training data [6]. Twitter is one of the most popular micro-blogging web platforms [7, 8], which has become a lode for text classification as over million active users send and receive about 500 million messages per day in a 140 character message called “tweet” [8, 9]. The “tweet” extracted from the twitter API has been widely adopted as the source data for sentiment analysis [7]. Employing various machine learning techniques, sentiment analysis classifies a twitter message into ‘positive’ or ‘negative’, and sometimes ‘neutral’.

Typically, there exist two major approaches employed for sentiment analysis. The first one is to analyze the words-bag features of text with supervised machine learning algorithm [10]. In this approach a words-bag vector is established by filtering the words in the text, and the appearance of the words in the vector is regarded as the feature of the text [11]. The other approach is to establish a sentiment classifier based on the syntax tree of sentence, which is constructed to indicate the relationship between the words by parsing the sentences [1215]. Then the sentiment classifier is built based on the syntax relations, polarity, and features of the words [11]. There exist various challenges in sentiment analysis. The primary issue is the extraction of effective model. Typically, a machine learning algorithm is applied to the classification model extracted from the training dataset having manually tagged class labels [3]. Therefore, proper implementation of the classification model plays a crucial role in deciding the performance of sentiment analysis. Another issue is feature weighting. Assigning appropriate weight to relevant and discriminative features (attribute) is crucial to achieve the sentiment analysis of high accuracy using the classifier.

Among the feature weighting schemes proposed for sentiment analysis, the most widely used one is based on feature frequency (FF) due to the simplicity and effectiveness [10]. Here, the frequency of a word appearing in a document is utilized as the value of the feature of the document, and the highest value of them in the total documents is regarded as the feature value of the whole training data set. FF shows reasonable performance in many cases. However, if the feature values are uniformly distributed, it is difficult to properly analyze the feature information. The scheme based on document frequency (DF) effectively handles the issue of uniform distribution of the features. Here, the number of documents containing the target word is counted from the training dataset, which effectively represents the statistical information of the feature even the case of uniform distribution. The DF scheme has the advantage of simplicity and applicability to the training data of a huge volume at reasonable computational complexity [16]. However, rare words are treated as useless data, which degrades the performance of sentiment analysis [17]. Part of speech-based weighting (PSW) [18] is a recently proposed feature weighting scheme for twitter sentiment analysis, which is a kind of word frequency (WF)-based approach considering the frequency of unique word in each category. The relevance of the word among the training dataset is also considered. As the weights for the words are set empirically, however, its performance may not be robust. The term frequency and inverse document frequency (TF–IDF) [19, 20] is a commonly adopted feature weighting scheme owing to its efficiency and robustness. It assumes that importance of a word is highly dependent on its frequency of occurrences in the document and the ratio of the total number of documents to the number of documents containing the word. It is effective in measuring the importance of the words among the documents of training dataset, which greatly increases the accuracy of sentiment analysis. However, exaggeration of the dimensionality still exists, which treats the size of features as the volume of the words of the entire training dataset. This causes big computation overhead of weighting all the words [21].

Although a variety of feature weighting schemes for sentiment analysis have been developed, few of them investigate the relevancy between the clustered features and the class in assigning the weights. In this paper a novel feature weighting approach is proposed, which is inspired by the expectation that enhancing the strength of the words of strong discriminability may allow higher accuracy of sentiment analysis [22, 23]. In the proposed scheme the words of same type of POS feature of the classes are clustered into predefined sets. The dependency between the clustered set and the corresponding class is measured by the modified Chi Square technique [24]. It serves as a criterion for weighting the emotional words along with the discriminability of the words. The proposed scheme is extensively evaluated by computer simulation and compared with other schemes proposed for twitter sentiment analysis using the workloads of Sentiment 140 [25]. The simulation results reveal that the proposed scheme greatly improves the accuracy of the existing schemes. The main contributions of the paper are summarized below,
  • A novel feature reduction method is proposed to reduce the dimensionality (size of features) [26], which omits irrelevant data in classifying the training dataset into a small number of features and achieves a reasonable computational complexity when weighting the words [27, 28].

  • A modified Chi Square method is employed since the conventional Chi Square method suffers from the shortcoming of overemphasizing the role of the words of low frequency and measuring the class of a word based on DF. Therefore, WF is proposed to serve as the input to the Chi Square method to avoid such weakness. In addition, the traditional Chi Square method investigates the independency between a single feature and the class in the text classification. In the proposed scheme the dependency of the clustered feature set on the class is explored. The importance of the words is also characterized by the dependency derived from the modified Chi Square method.

  • A novel composite feature weighting technique is proposed, which considers the dependency derived using the modified Chi Square technique and discriminability of the clustered feature set. In addition, the influence of the dependency to the weighting is also taken into account. Meanwhile, the importance of the words of strong discriminability is emphasized in the weighting process so that they can take more significant role in the sentiment analysis.

The rest of the paper is organized as follows: “Related work” section discusses the background of sentiment analysis. In “The proposed scheme” section the proposed scheme is presented, and its performance is evaluated in “Performance evaluation” section. Finally, the paper is concluded in “Conclusion” section.

Related work

Naive Bayes classifier (NBC)

NBC is commonly employed for text classification due to its robust performance for various data, especially for high dimensional text data. It is a probability-based classifier employing the Baye’s theorem with the assumption of naïve independency between the predictors [29]. Here the properties of each predictor are analyzed to contribute the probability of the category of each predictor to its class. A classifier is constructed based on Bayes theorem of Eq. (1) [30]. With NBC the influence of predictor_x on given class_c is estimated, assuming that the predictors are independent with each other.
$$P\left( {c|x} \right) = \frac{{P\left( {x|c} \right)P\left( c \right)}}{P\left( x \right)}$$
Here P(c|x) is the probability of class_c given predictor_x, which is called the posterior probability. P(x|c) is the probability of predictor_x given class_c. P(c) is the probability of class_c to be true, which is called the prior probability of class_c. P(x) is the prior probability of predictor_x. With n predictors, P(x|c) is defined as,
$$P\left( {x|c} \right) = \prod\limits_{k = 1}^{n} {P\left( {x_{k} |c} \right)}$$

The selective Bayes classifier (SBC) is an enhancement of NBC, which displays good performance when redundant attributes exist. With SBC highly correlated redundant attributes are excluded if the assumption of attribute independency is taken. In [31] greedy search is performed to select all the subsets of the attributes using the forward selection technique, which raises the accuracy of the classifier obtained from the training set.

Twitter sentiment analysis

Sentiment analysis involves language processing, text classification, and computational linguistics to extract emotional information from the source data. It is broadly employed to review the social media used in various fields such as marketing and customer service [32]. Typically, the intention of sentiment analysis is to estimate the mood of the user concerning the target object, and the basic task is to determine the polarity of the given text [32]. The approaches employed for sentiment analysis is roughly categorized into two types; machine learning-based and lexicon-based. With the machine learning-based approach the sentiment classifier is trained using a machine learning algorithm [1]. The lexicon-based approach focuses on the evaluation of the polarity of the text using the lexicons collected from various sources such as MPQA lexicon [33], WordNet [34] and SentiWordNet [35]. The machine learning-based approach is commonly adopted for twitter sentiment analysis, which is a representative binary classifier categorizing the target text into positive or negative. The basic structure of twitter sentiment analysis is shown in Fig. 1.
Figure 1
Fig. 1

The structure of twitter sentiment analysis

Recent studies of twitter sentiment analysis focus on usage of various feature sets and methods [3639]. In [40], the emotional state of tweets is visualized into specific feelings such as sadness, joy, and anger by employing the theory of Naïve Bayesian. SVM and MaxEntropy classifiers are used as competitors to compare the performance. In [41], the authors analyze the emoticons of sport fans using a lexicon-based approach. In [42], the prediction of stock market was analyzed by SVM approach. Tweets derived from the University and financial companies are utilized as source dataset in the performance evaluations. The results proved that SVM achieved best performance compared to KNN and Naïve Bayes classifiers. In [43], a hybrid approach combining several classifiers is investigated. Various cross-validated experiments were conducted, and the results reveal that the hybrid approach greatly improves the accuracy of classification.

Feature selection is one of the key steps in data pre-processing employed to maximize the performance of text classification, and it utilizes a machine learning technique [44]. It eliminates irrelevant or redundant attributes from the original feature space, and selects a relevant subset based on the target evaluation criterion to reduce the complexity of the analysis [2, 45]. Twitter is a popular online social networking service (SNS) platform that enables the users to show their thought or opinion in a 140-character message. Sentiment 140 lets the users discover the sentiment on people, product, etc. on Twitter. It also provides the APIs for analyzing the tweets, and supports the integration of sentiment analysis classifier with other personal site or platform [25].

Part of speech

The part of speech (POS) tagging is a method of splitting the sentences into words and attaching a proper tag such as noun, verb, adjective and adverb to each word based on the POS tagging rules [46]. Figure 2 lists the POS tag, and Fig. 3 shows three examples of tagging [47]. POS tagging has been widely used in various tasks including text classification, speech recognition, automatic machine translation, and so on. A variety of POS taggers are available for English such as Brill tagger, Tree tagger, and CLAWS tagger. The POS tagging operation consists of two stages, training stage and tagging stage, which are shown in Figs. 4 and 5, respectively.
Figure 2
Fig. 2

The POS tag

Figure 3
Fig. 3

Three examples of POS tagging

Figure 4
Fig. 4

The Training stage in POS tagging

Figure 5
Fig. 5

The tagging stage in POS tagging

In the training stage, the corpus is employed to supply words in different context environments, and the contextual information is used as a clue to construct the rules required to decide the lexical classes of the words. Then the most likely tag for a word is selected by calculating the probability of the appearance of the context of the word and its immediate neighbors in the tagging stage [48].

Feature weighting

In sentiment analysis the training data are classified into features (attributes) based on the content, and then weights are assigned to the features to distinguish their importances. Various feature weighting schemes have been proposed, and the commonly used one is term frequency and inversed document frequency (TF–IDF). TF–IDF consists of two parts, term frequency and inverse document frequency. Term frequency, tf(w,d), represents the frequency of word_w appearing in document_d. The inverse document frequency, idf(w,D), is a measurement showing how much information word_w offer for document_d. It is achieved by dividing the total number of documents by the number of documents word_w appears, and then taking the logarithm as,
$${\text{idf}}\left( {w,D} \right) = { \log }\frac{N}{{|\left\{ {d \in D\text{:}w \in d} \right\}|}}$$
The TF–IDF value is then obtained by TFIDF(w,d,D) = tf(w,didf(w,D). A high TF–IDF value of a word denotes a large frequency in few documents, and a small frequency of the documents containing the word in the entire set of the documents. On the contrary, a low value indicates that the word appears evenly in every document. The TF–IDF is useful for selecting the words important for a document and evicting common words [49]. FF is a popular feature weighting scheme because of its simplicity and efficiency, which expresses a document as a vector of features. The method utilizes the frequency of a word appearing in a certain document as the value of the feature of the document [49]. DF is another important feature weighting method used in a variety of applications of text classification and other related tasks, which counts the number of documents that the target word_w appears within the entire documents. Only the words of a high DF value are kept which is represented as,
$${\text{DF}}\left( {w_{i} \text{,}C_{k} } \right) = p\left( {w_{i} |C_{k} } \right)$$
Part of speech-based weighting (PSW) is a recently proposed feature weighting scheme for improving the accuracy of twitter sentiment analysis. The method utilizes POS tagger, and the words are classified into three predefined subclasses as shown in Table 1.
Table 1

The subclasses with POS tag



POS tag


Adverb, adjective, verb








The importance of a word is measured based on its POS tag. Refer to Table 1. The word of Adverb, Adjective and Verb with the corresponding POS tags are regarded as related to emotion, and thus retained in the Emotion subclass. In addition, a weight value, wti,j (j = 1, 2, 3), is assigned to reflect the importance of the words.
$$wt_{i,j} = \left\{ {\begin{array}{*{20}ll} {x \cdot f_{i} \text{,} \quad f_{i} \ge E\left[ {F_{j} } \right]} \\ { f_{i} \text{,} \quad\quad f_{i} < E\left[ {F_{j} } \right]} \\ \end{array} } \right.$$
Here f i is the frequency of word_i appearing in the training dataset, and x is a constant factor used to adjust the degree of influence of the words of different property in deciding the sentiment. It is 2, 1.5, and 1 for the emotion, normal and remain subclass, respectively. E[F j ] is obtained as follows, where F j (j = 1, 2, 3) represents the subclass of Emotion, Normal, and Remain, respectively.
$$E\left[ {F_{j} } \right] = \sum\limits_{i = 1}^{n} {f_{i} p_{i} ,\; \, p_{i} = \frac{{f_{i} }}{{\sum\nolimits_{i = 1}^{n} {f_{i} } }}\quad\left( {j = 1,2,3} \right)}$$

The proposed scheme

Basic operation

The overall operation flow of the proposed scheme is as follows. For the sentences of twitter, POS tagging is firstly performed. Some sentences are selected as training data set based on the criteria, and then categorized into two classes, positive and negative according to their polarity. The words in the classes are clustered using their POS tags. A weight value is then assigned to every word based on the dependency and word discriminability of the clustered feature set to which the word belongs. When the training stage is over, a table of statistical data is obtained. The sentiment of the sentences of twitter in the test document is judged based on the statistics table. The overall operation flow of the proposed scheme is depicted in Fig. 5. Generally, the objective of the proposed scheme is to reinforce the strength of emotional words through the weighting and make them more influential in sentiment analysis, where the dependency among the cluster feature sets and classes serves as a criterion for the weighting. The detail implementation is presented in the next subsection (Fig. 6).
Figure 6
Fig. 6

The operation flow of the proposed scheme


Sentiment analysis mainly depends on the availability of initial corpus, Φ = {d1,, d|Φ|}, d i  = {s1,…,s|S|} and predefined class, C = {c1,,c|C|}. Here d i represents a document consisting of |S| sentences out of |Φ| documents of original corpus and |C| classes. Firstly, the components of Φ are classified into the predefined set of categories, C. The task can be formalized as a function Ψ: Φ × C → {N,P}, which characterizes the process of classification. Specifically, if Ψ(d i ,c j ) = N, document_d i is a negative dataset of c j . Otherwise, if Ψ(d i ,c j ) = P, d i is positive [50]. Then the initial corpus Φ is classified into two class sets, D neg and D pos (D neg D pos  = Φ), D neg  = {d1,…,d sn }, D pos  = {d1,…,d sp }, sn + sp  = |Φ|, where sn and sp are the size of documents consisting of negative and positive sentences, respectively. Then every sentence in D neg and D pos is parsed through POS tagger, and every word of the sentence is assigned a corresponding POS tag serving as its feature. Refer to the example of Fig. 3.

Dimensionality reduction by feature selection

The sentences of twitter in the training data are classified into positive and negative sentences, while they can also be classified into subjective or objective. Note that emotional words in a sentence is important in judging the sentiment of the sentence. Therefore, removing the sentences having few emotional words can improve the accuracy of sentiment analysis. In this paper, Adverb, Adjective and Verb are regarded as emotional features important in deciding the sentiment. The sentence containing less than two types of emotional feature is regarded as unrelevant to sentiment analysis, and thus removed from the training data set [51]. In the example of Fig. 3, even though the meaning of the third sentence seems negative, it is not used for training because only one type of emotional feature of Verb appears in the sentence.

Feature clustering

The unigram feature extractor is utilized to retrieve the features from the tweets due to its simplicity and efficiency, which treats each unique word in the training dataset as a unit representing separate features [52]. Therefore, the set of document-built classes, D α , is expressed as feature-based array consisting of unique words excluding the stop words. It is represented as [53], Di,α = {w1, w2,…, w|w|| α = neg˅pos}, where w i is a unique word occurring in the class set, Di,α. It is expressed as, w i  = {(f i , t i , Di,α, NW i )| α = negνpos}. Here f i is the number of occurrences of unique word, w i , in the entire documents of Di,α with its POS feature tag, t i . NW i is the weighted frequency of w i reflecting the importance of the word as discussed in the following subsection. Different from the existing schemes counting the term frequency in every document and choosing the largest value to represent the feature of the document, the frequency of the words of the documents is computed with the class dataset to avoid the problem of exaggerating the role of low-frequency terms [22, 49]. A novel feature clustering method is proposed to aggregate the words of same POS features of Di,neg and Di,pos into the clustered feature set, C E and C N , as follows [5456]. Here C E is the clustered set of emotional feature maintaining the words of the POS tag of Adverb (JJ, JJR, JJS in Fig. 1), Adjective and Verb in Di,α. C N serves as normal feature set keeping the words of remaining tags [57]. The detail classification is shown in Table 2. This process is formulated as, Di,α = {C E ,C N | α = neg˅pos}, C E  = {w1,…,w p }, C N  = {w1,…,w q }, p + q = |w|.
Table 2

The feature set in the proposed scheme

Feature Set


POS tag


Adverb, adjective, verb





Measuring importance

The emotional words are classified into the clustered feature set, C E . Here it is crucial to reflect the importance of the words to decide whether the tagged emotional words are actually important to the class or not [58]. Typically, word discrimination (WD) is applied to measure how much discriminative information a word owns with respect to the class [59]. The importance of a word for the class is quantified as, WDi,μ = fi,μ fi,ν, μ ≠ ν. Where WDi,μ represents the WD of word_i of class_μ against class_ν, which is measured by the difference in the frequency of word_i appearing in class_μ, fi,μ, and that in class_ν, fi. Intuitively, the word of high WD is regarded as important to the class as it contains a strong flavor on the class differentiating from other classes. This in turn greatly facilitates the judgement of the sentiment of the sentences. If fi,μ> 0, word_i has positive correlation with class_μ. Otherwise, it is deemed unrelated to class_μ. For instance, assume that two words, w1 and w2 coexist in Di,neg and Di,pos with the frequency listed in the Table 3.
Table 3

The words and their frequencies


D i,neg

D i,pos

w 1

f 1,neg

f 1,pos

w 2

f 2,neg

f 2,pos

Here f1,neg is the frequency of w1 appearing in Di,neg and so on. WD of w1 and w2 of Di,neg is calculated as, WD1,neg = f1,neg− f1,pos, WD2,neg = f2,neg −  f2,pos. If (f1,neg − f1,pos) > 0, w1 is regarded as an essential word of Di,neg instead of Di,pos. Meanwhile, if WD1,neg> WD2,neg, w1 is regarded as the word containing more information on Di,neg than w2 for the analysis of the sentiment. Recall that two feature sets, C E and C N , were built considering the POS feature of every word in Di,α, where C E retains the emotional words and C N the others. Intuitively, the emotional words are expected to carry more information regarding the polarity of the sentiment compared to other words [10]. In addition, emotional words are not likely to occur in more than one class owing to its strong discriminability. For example, “Like” is an emotional word representing positive sentiment, and thus WDLike’,pos will be much larger than WDLike’,neg. Since the emotional words are classified into C E based on the POS tag, the mean value of WD of the words in C E will be greater than that of C N . If p and q are the number of unique words of C E and C N in Di,α, respectively,
$$\sum\limits_{i = 1}^{p} {\frac{{WD_{{i\text{,}\alpha }} }}{p} > } \sum\limits_{j = 1}^{q} {\frac{{WD_{{j\text{,}\alpha }} }}{q}} \text{,}\,\alpha = neg \vee pos$$

Measuring dependency

The conventional Chi Square method is commonly used for feature selection, which ranks the words and selects the word of the highest x2 value. Meanwhile, it suffers from the weakness of overemphasizing low frequency words as only DF is considered without WF. Different from DF, WF is the frequency a word appears in the entire dataset, and it is expressed as,
$$WF_{{w_{i} }} = \sum\limits_{i = 1}^{d} {f_{{w_{i} }} }$$

WF measures the importance of a word in the whole data space. With the traditional Chi Square method the uniformly distributed words are deemed to best represent the class. Specifically, the method is based on the intuition that the optimal words for a specific class are the ones distributed most evenly among the documents of the training dataset [50]. Therefore, only the evenly distributed words of high DF and low WF value are selected from the dataset as the features representing the class, while the words of low DF and high WF value are discarded as they may cause inefficiency. However, some words of low DF and high WF might also be important and thus need to be reserved. Especially, the emotional words are regarded as rare with the conventional Chi Square method because they usually have uneven distribution. They also have high WF and low DF value [22]. By incorporating WF as an input to the Chi Square method, the dependency of C E on Di,α(α = negpos) is measured as follows. Firstly, the hypothesis statements are set up as follows.

Null Hypothesis_1: C E and Di,α are independent.

Alternative Hypothesis_1: C E and Ci,α are dependent.

Then contingency table for r·c is constructed as in Table 4, where r and c are the number of rows and columns, respectively. The Chi Square value, χ2, is calculated using χ2 = ∑(O − E)2/E. Here O is the observed frequency and E is the expected frequency under the hypothesis. Table 4 lists different cases of feature selections with respect to C E .
Table 4

Different cases of summing the frequencies

Feature selection




Containing C E



A + B

Not Containing C E



C + D


A + C

B + D


In Table 4, A is the sum of the WF of the words in C E which is expressed as \(A\, = \,\sum\nolimits_{i = 1}^{p} {WF_{i} } ,\) where p is the number of words in C E . Similarly, the value of C is calculated as \(C = \sum\nolimits_{i = 1}^{q} {WF_{i} }\) with q as the number of words in C N . B is the case for the opposite class which is represented as,
$$B = \sum\limits_{i = 1}^{z} {WF_{{w_{i} }} } \text{,}\left\{ {w_{i} \in \mathop {C_{E} }\limits_{{C_{E} \in D_{i,\alpha } }} \left| {\varPsi \left( {d_{j} \text{,}c_{i} } \right) = \overline{\alpha } , \, D_{i,\alpha } \cup D_{{i,\overline{\alpha } }} = \varPhi \text{,}\;z \le q} \right.} \right\}$$
where z is the number of words of C E in class Di,α appearing in \(D_{{i,\bar{\alpha }}}\). As the number of words in Di,α is q, z ≤ q. D is calculated as,
$$D = \sum\limits_{i = 1}^{{p' + q^{\prime}}} {WF_{{w_{i} }} } - B$$
where p′ and q′ are the number of words in C E and C N in \(D_{{i,\bar{\alpha }}}\), respectively. For example, if the dependency of Di,neg with its corresponding clustered feature set, C E , is measured, A is the total WF of the words in C E of Di,neg and B is the sum of WF that the words of C E appear in Di,pos. C and D are obtained by subtracting the total WF of Di,neg and Di,pos from A and B, respectively. The expected frequency of the words of C E belonging to Di,j is obtained as, E11 = (A + C)·(A + B)/N. Here E11 is the expectation of A in the first row and first column of Table 4, and the deviation between the expectation is calculated as, D11 = (A − E)2/E11. Similarly, the other values are obtained as follows.
$$E_{12} = \left( {B + D} \right) * \frac{{\left( {A + B} \right)}}{N},\;D_{12} = \frac{{\left( {B - E_{12} } \right)^{2} }}{{E_{12} }}$$
$$E_{21} = \left( {A + C} \right) * \frac{{\left( {C + D} \right)}}{N},\;D_{21} = \frac{{\left( {C - E_{21} } \right)^{2} }}{{E_{21} }}$$
$$E_{22} = \left( {B + D} \right) * \frac{{\left( {C + D} \right)}}{N},\;D_{22} = \frac{{\left( {D - E_{22} } \right)^{2} }}{{E_{22} }}$$
And then, C E and Di,α are derived as
$$\chi^{2} \left( {C_{E} ,D_{i,\alpha } } \right) = D_{11} + D_{12} + D_{21} + D_{22} = \left( {\frac{{A^{2} }}{{E_{11} }}{ + }\frac{{B^{2} }}{{E_{12} }} + \frac{{C^{2} }}{{E_{21} }} + \frac{{D^{2} }}{{E_{22} }}} \right) - 2\left( {A + B + C + D} \right) + \left( {E_{11} + E_{12} + E_{21} + E_{22} } \right)$$
$$= \frac{{N * \left( {AD - BC} \right)^{2} }}{{\left( {A + B} \right)\left( {A + C} \right)\left( {B + D} \right)\left( {C + D} \right)}}$$

In addition, the value of χ2(C N ,Di,α) can also be computed by constructing the table similar to Table 4, and the hypotheses is shown below.

Null Hypothesis_2: C N and Di,α are independent.

Alternative Hypothesis_2: C N and Di,α are dependent.

Weighting of the word

Word weighting is performed based on the importance of the word in the training dataset. The proposed weighting scheme considers the dependency of the clustered feature set with the class, which is measured by the value of χ2. The greater the value, the stronger the dependency. For measuring the dependency, the critical value (CV) of Chi Square is given. In this paper 95% is taken as a metric for the measurement which indicates the null hypothesis is wrong with the probability of 0.95 or more. CV is computed as 3.84 with one degree of freedom [DF = (r − 1)·(c − 1)] based on the cumulative distribution function of Chi Square expressed as [60],
$$F\left( {cv\text{;}k} \right) = \frac{{\gamma \left( {{k \mathord{\left/ {\vphantom {k 2}} \right. \kern-0pt} 2}\text{,}{{cv} \mathord{\left/ {\vphantom {{cv} 2}} \right. \kern-0pt} 2}} \right)}}{{\varGamma \left( {{k \mathord{\left/ {\vphantom {k 2}} \right. \kern-0pt} 2}} \right)}}$$
Here k is the degree, γ is incomplete gamma function, and Γ is gamma function represented as,
$$\varGamma \left( \alpha \right) = \int_{0}^{\infty } {t^{\alpha - 1} e^{ - t} } dt$$
The probability density function (PDF) of χ2 distribution, f2), is drawn in Fig. 7, which shows a two-sided test of χ2 distribution with the CV of 3.84. If the given χ2 value is greater than the CV, the null hypothesis would be rejected. The tested clustered feature set is regarded as dependent on the class. Otherwise, they are treated as independent with each other. The CV of χ2 is set high to ensure the reliability of the dependency. The region for the probability of one degree of freedom with the CV is marked with slashed lines.
Figure 7
Fig. 7

The PDF of χ2 distribution

Then χ2(C E ,Di,α) is compared with the CV. The Null Hypothesis_1 is rejected if χ2(C E ,Di,α) > CV, and Alternative Hypothesis_1 is chosen which indicates that C E is highly dependent on Di,α with the probability of 95%. Otherwise, they are regarded as independent from each other. Similarly, χ2(C N ,Di,α) is compared with the CV, and the Null Hypothesis_2 or Alternative Hypothesis_2 is chosen based on the result of the comparison. As C E holds emotional words of relative strong discriminability which are more likely to represent the class, the proposed weighting scheme strengthens the discriminability to highlight the role of emotional words in category prediction. Recall that the larger the χ2 value is, the more discriminative information of the class the feature holds [22]. If χ2(C E ,Di,α) < CV, C E and Di,α are regarded as independent from each other, which indicates that C E does not contain enough information on class Di,α, and thus no weighting is applied. Only when χ2(C E ,Di,α) > CV, the words in C E are supposed to be highly dependent on Di,α, and the proposed weighting scheme is performed. Observe from Table 4 that χ2(C E ,Di,α) increases with the growth of A because B, C and D are constant values. Therefore, the value A is increased to make the words in C E more discriminative, and firstly the distortion of the importance of a word is defined as,
$$\varTheta (w_{i} ,D_{i,\alpha } ) = |\alpha (w_{i} ,D_{i,\alpha } ) - \beta (w_{i} ,D_{i,\alpha } )| = |WF_{{w_{i} }} - \exp (w_{i} )|$$
Here Θ(w i ,Di,α) measures the importance of a word between the observation and prediction. α(w i ,Di,α) is the observed importance of the word_w i for class_Di,α measured by the relative frequency, WF wi , of word_w i . β(w i ,Di,α) represents the predicted importance, and it is computed by the deviation between the expectation of Chi Square method. The distortion of the importance for the clustered set, C α (α = EN), is obtained as,
$$\varTheta (C_{\alpha } ,D_{i,\alpha } ) = \sum\limits_{i = 1}^{m} {\varTheta (w_{i} ,D_{i,\alpha } ) = } \sum\limits_{i = 1}^{m} {|WF_{{w_{i} }} - \exp (w_{i} )|}$$
Θ(C α ,c k ) measures the distortion of the importance between cluster_C α and class_Di,α. The increment rate of A, r A , is computed as,
$$r_{A} = \frac{{\varTheta (C_{\alpha } ,D_{i,\alpha } )}}{{\sum\limits_{i = 1}^{m} {WF_{i} } }}$$
Since Θ(C α ,c k ) is equal to |A − E11|, Eq. (17) can be rewritten as,
$$r_{A} = \frac{{\sqrt {D_{11} \cdot E_{11} } }}{A}$$
Here D11 and E11 are the deviation and expected frequency, and \(\sqrt {D_{11} *E_{11} }\) measures the difference between the observed frequency and expected frequency in D i ,α(α = negpos). By dividing it by the value of A, the increment rate of r A is calculated. Meanwhile, χ2(C N ,Di,α) > χ α 2 might be possible since some non-emotional words also have small discriminability. Moreover, as the volume of data of C N is much larger than C E , the value of χ2(C N ,Di,α) might be greater than the CV of χ2. Therefore, r N is computed based on Table 5 and Eq. (18). The increment rate, r D , is then,
$$r_{D} = \left\{ {\begin{array}{*{20}ll} {r_{E} - r_{N} ,\quad r_{E} > r_{N} } \\ { 0,\quad\quad\quad r_{E} \le r_{N} } \\ \end{array} } \right.$$
Table 5

Different cases of summing of frequencies

Feature selection




Containing C N



E + F

Not containing C N



G + H


E + G

F + H


Here r D increases the frequency of A when C E holds enough words of strong discriminability and contains more class information than C N . Otherwise, it is set to be zero. In addition, as the value of A is the sum of the WF of the words of all the documents in C E (= {w1,…w p },w i  = {(f i ,t i ,Di,α,NW i )|j = negpos}, the new weight of every word in C E , NW i , is calculated as NWi = (1 + r D WFi.


Bayes theorem is widely used in supervised learning for text classification. In this paper Multinomial Naïve Bayes (MNB) model is employed as the classifier for the given text, which is based on naïve assumption of conditional independence for the features [61]. Specifically, in the text classification of sentiment analysis, the goal is to find the best matching class for the tested sentences. It is the most likely or maximum a posteriori (MAP) class, c map , which is calculated as,
$$c_{{map}} = arg\mathop {\max }\limits_{{c \in C}} \left( {P\left( {c|S} \right)} \right)$$
where c is a class in the total classes in training dataset, C, and P(c|S) is posterior probability of class_c measuring the probability of sentence_S being in class_c as computed by Eq. (21). In the proposed scheme two classes are defined, D neg and D pos . Therefore, C = {D neg , D pos }, and the objective is to find the best matching class among C for every tested sentence.
$$P\left( {c|S} \right) = \frac{{P\left( {S|c} \right)P\left( c \right)}}{P\left( S \right)}$$
Since the probability of the sentence, P(S), is a constant, it can be discarded. Equation (21) can then be expressed as,
$$P\left( {c|S} \right) \propto P\left( c \right)P\left( {S|c} \right) = P\left( c \right)\prod\limits_{1 \le i \le n} {P\left( {w_{i} |c} \right)}$$
S i  = {w1,…,w|k|} represents one sentence composed of |k| words, and w j (j = 1,…,n) is a word in the sentence. For example, for the sentence of “peace is important”, S = {peace, is, important}, with |k| = 3. P(w i |c) is the conditional probability of w j occurring in a sentence of class_c, which measures how much w j contributes for class_c to be the matching class. P(c) is the prior probability of a sentence in class_c. In Eq. (22), multiplying many conditional probabilities may lead to the problem of floating point underflow. Therefore, adding the logarithms of the probabilities instead of the multiplication is carried out. As the logarithmic function is monotonic, the class of the highest probability can still be selected as the target class. Equation (22) is thus converted to,
$$c_{map} = \arg \mathop {\hbox{max} }\limits_{c \in C} \left[ {\log P\left( c \right) + \sum\limits_{1 \le i \le n} {\log P\left( {w_{i} |c} \right)} } \right]$$

P(c) is obtained as, P(c) = N c /N. Where N c is the number of sentences in class_c and N is the total number of sentences in the training dataset. P(w i |c) is the posterior probability of T i , which is denoted as, P(w i |c) = count(w i ,c)/count(c). Here count(w i ,c) is the number of appearances of w i in class_c of the training dataset and count(c) is the total number of words in class_c. Meanwhile, the problem of zero probability can occur if a word in a sentence does not appear in the training dataset. Then, no matter how strong evidence could be gained from other words for the class, the estimation becomes zero. Laplace smoothing is employed to avoid this issue as [62], P(w i |c) = (count(w i ,c) + 1)/(count(c) + |V|). Where |V| is the number of distinct words in the training dataset. Recall that, in the proposed scheme, the weighted frequency (NW) of every word in the training dataset has been adjusted considering its relative popularity. Using it, P(w i |c) is obtained as, P(w i |c) = (NW i + 1)/(count(c) + |V|).

Recall that NW i was obtained based on the dependency and discriminability of the word in the target class, where the influence of emotional words was strengthened by assigning more weight than the others for more accurate prediction. Note that redundant feature words are considered with the MNB model. For instance, assume that sentence_S i is composed of four words as S i = {w1, w2, w3, w1}. Then the numerator of Eq. (22) becomes P(C i P(w1|C i )P(w2|C i )·P(w3|C i ). Where w1 has twice as much influence as the other words. The redundant word is therefore given more weight, which leads to biased and low accuracy prediction. In the proposed scheme, thus, only distinct words in the tested sentence are counted.

Performance evaluation

In this section the proposed scheme is evaluated by computer simulation using Matlab. For this, the workload obtained from Sentiment 140 [25] is used to analyze the accuracy of the proposed scheme for twitter sentiment analysis. It is also compared against the previously existing FF, PSW, DF, and TF–IDF scheme.

The simulator consists of three parts; preprocessor, POS tagging API, and Bayes-based classifier. The preprocessor classifies the data of the training data set, and converts them to the customized format accessible by the API of POS tagging [46]. A Matlab function is implemented for accessing the Stanford POS tagger [63], which provides the API for the data in the workload. The Bayesian classifier is used to classify the tested document and predict the sentiment of the target sentences. A Multinomial Naïve Bayes (MNB) model is employed as the classifier in the simulation. The workload used in the simulation is extracted from Sentiment 140, which contains 1,600,000 lines of tweet data. 800,000 of them are negative class and the others are positive class. In the simulation the documents used for the training process are also classified into two categories; positive and negative. Figure 8 shows two examples of data in the data set. There are six components in one tweet; polarity (0 = negative, 4 = positive), id, data, query condition, user name, and text of the tweet. The text is used in the training stage of the simulation.
Figure 8
Fig. 8

Two examples of tweets in the data set

Extensive simulations are run to obtain reliable performance data. Six training data sets of (5000, 10,000, 15,000, 20,000, 25,000, 30,000) randomly selected tweets data are built, and each of which consists of an equal number of positive and negative randomly selected tweets extracted from the Sentiment 140. In addition, a series of tested data sets are formed to verify the performance. Firstly, three tested data sets consisting of 2000, 4000 and 6000 data of equal size of negative and positive document are built to compare the accuracy of the schemes with six different sizes of training data ranging from 5000 to 30,000. The results are shown in Fig. 9. Observe from the figure that the proposed scheme consistently outperforms the other schemes regardless of the size of training and test data set. Intuitively, the accuracy of sentiment analysis increases as the volume of training data grows. It is because the larger the training data, the more evidences could be provided for sentiment judgement. Also notice that the accuracy of the proposed scheme gradually increases with the growth of the size of training data set. However, there is no such improvement with the other schemes excluding the PSW scheme. This is because the parameters of the feature classification model were decided empirically. Moreover, the accuracy generally drops as the test data increases because a limited size training data cannot consistently provide robust evidence for sentiment analysis. Observe from Fig. 9c that the proposed scheme is substantially more accurate than the others even in the worst condition of ‘minimum training data (5000) and maximum test data (6000)’. This is because WF is utilized as a parameter in the Chi Square method of the proposed scheme, which overcomes the drawback of the traditional Chi Square method in analyzing low frequency terms. Moreover, as a large value of Chi Square implies more class information of the feature (attribute), the weight applied to the words properly takes the interclass dependency into consideration. This enhances the feature of important words of high discriminability, which in turn produces higher accuracy than other schemes.
Figure 9
Fig. 9

The comparison of accuracies with different size test data

In order to check the robustness of the proposed scheme, the accuracy is also measured with three randomly selected test data sets containing 3000 positive and 3000 negative data, respectively. The outcomes are shown in Fig. 10. Observe from the figure that the proposed scheme substantially displays higher accuracy regardless of the volume of training and test data. It is also worth to note that the accuracy decreases as the number of test data increases from 1000 to 6000. This is because the accuracy of sentiment analysis is significantly affected by the pattern of the test sentences. TF–IDF also shows reasonable performance since it employs feature weighting. The PSW scheme offers good accuracy when the size of training data is large. The DF scheme is consistently superior than the FF scheme. Pan et al. [10] identified that considering the presence or absence of features can allow higher accuracy than considering only the feature frequency. This is the reason why the DF scheme outperforms the FF scheme.
Figure 10
Fig. 10

The comparison of accuracies with the test data of balanced polarity

In the previous simulations the test data consists of equal number of positive and negative tweets. In order to evaluate the sensitivity of the proposed scheme with respect to the polarity, simulations are made with the test document randomly selected from the test dataset without considering the polarity. Three different sizes of training data set of 5000, 20,000 and 30,000 are taken to handle the test data. The average accuracy is shown in Fig. 10 revealing that the proposed scheme consistently outperforms the others (Fig. 11).
Figure 11
Fig. 11

The comparison of accuracies with the test data of unbalanced polarity

Figure 12 shows the performance of the five schemes when the test dataset is randomly selected from Sentiment 140. Note that the proposed method significantly outperforms other schemes for the three well-known benchmarks. The proposed scheme produces best performance in terms of precision, recall, and F1-measures when the size of test dataset varies from 500 to 6000. It reveals that the proposed scheme is very sensitive to the sentiment of test documents and is capable of classifying test data into correct category.
Figure 12
Fig. 12

The comparison of three benchmarks with the randomly selected test data


Twitter sentiment analysis has become a promising technique for industry and academia. In this paper a novel feature weighting approach for sentiment analysis of twitter data has been proposed using a Bayes-based text classifier. An effective feature selection strategy recognizing sentiment sentence is presented to select informative data for classification. Moreover, each term is grouped into target cluster considering the POS property of the term. A novel feature weighting scheme considering discriminability and dependency derived from modified Chi Square statistics is introduced, which computes a proper weight value for each term reflecting the importance degree of the term. Extensive experiments were conducted on Sentiment 140, and four representative feature weighting schemes were also tested to demonstrate the performance. The experimental results show that the proposed scheme consistently outperforms others in terms of accuracy, precision, recall, and F1-measure. In the future a fine-grained clustering strategy is planned to be developed to accurately define the margin of the clusters. Moreover, unsupervised learning techniques will be incorporated into the proposed scheme to further improve the performance of sentiment analysis. In addition, the proposed scheme will be tested using various classifiers such as SVM, decision tree, and neural network.


Authors' contributions

All authors read and approved the final manuscript.


This work was partly supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No. 2016-0-00133, Research on Edge computing via collective intelligence of hyperconnection IoT nodes), Korea, under the National Program for Excellence in SW supervised by the IITP (Institute for Information & communications Technology Promotion) (2015-0-00914), Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2016R1A6A3A11931385, Research of key technologies based on software defined wireless sensor network for realtime public safety service, 2017R1A2B2009095, Research on SDN-based WSN Supporting Real-time Stream Data Processing and Multiconnectivity), the second Brain Korea 21 PLUS project, and Samsung Electronics.

Competing interests

The authors declare that they have no competing interests.

Availability of data and materials

Not applicable.

Consent for publication

Not applicable.

Ethics approval and consent to participate

Not applicable.


Not applicable.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors’ Affiliations

College of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
College of Software, Sungkyunkwan University, Suwon, Korea


  1. Lizhen L et al (2014) A novel feature-based method for sentiment analysis of Chinese product reviews. China Commun 11:154–164. View ArticleGoogle Scholar
  2. Bidi N, Elberrichi Z (2016) Feature selection for text classification using genetic algorithms. Paper presented at the 2016 8th international conference on modelling, identification and control, 806–810 Nov 2016.
  3. Qiang G (2010) An effective algorithm for improving the performance of Naive Bayes for text classification. Paper presented at the second international conference on computer research and development, 699–701 May 2010.
  4. Sharma N et al (2016) Text classification using combined sparse representation classifiers and support vector machines. Paper presented at the 4th international symposium on computational and business intelligence, 181–185 November 2016.
  5. Joachims T (1998) Text categorization with support vector machines: learning with many relevant features. Paper presented at the European conference on machine learning, 137–142 April 1998.
  6. Qiaowei J (2016) Deep feature weighting in Naive Bayes for Chinese text classification. Paper presented at the 4th international conference on cloud computing and intelligence systems, 160–164 December 2016.
  7. Krouska A, Troussas C, Virvou M (2016) The effect of preprocessing techniques on twitter sentiment analysis. Paper presented at the 7th international conference on information, intelligence, systems and applications, 1–5 December 2016.
  8. Suresh H (2016) An unsupervised fuzzy clustering method for twitter sentiment analysis. Paper presented at the international conference on computation system and information technology for sustainable solutions, 80–85 December 2016.
  9. Yang A et al (2015) Enhanced twitter sentiment analysis by using feature selection and combination. Paper presented at the international symposium on security and privacy in social networks and big data, 52–57 Nov 2015.
  10. Pang B, Lillian L, Vaithyanathan S (2002) Thumbs up?: sentiment classification using machine learning techniques. Paper presented at the ACL-02 conference on empirical methods in natural language processing, 10:79–86 July 2002.
  11. Zou H et al (2015) Sentiment classification using machine learning techniques with syntax features. Paper presented at the international conference on computational science and computational intelligence, 175–179 March 2015.
  12. Socher R et al (2013) Recursive deep models for semantic compositionality over a sentiment treebank. Paper presented at the conference on empirical methods in natural language processing, 1631–1642, 2013Google Scholar
  13. Singh J, Singh G, Singh R (2017) Optimization of sentiment analysis using machine learning classifiers. Hum Comput Inf Sci 7:32. View ArticleGoogle Scholar
  14. Yu N et al (2016) A comprehensive review of emerging computational methods for gene identification. J Inf Proc Syst 12:1. Google Scholar
  15. Jiadong Z, San-Segundo R, Pardo JM (2017) Feature extraction for robust physical activity recognition. Hum Comput Inf Sci 7:16. View ArticleGoogle Scholar
  16. Yang Y, Pedersen JO (1997) A comparative study on feature selection in text categorization. In: ICML. 97:412–420. ISBN:1-55860-486-3Google Scholar
  17. Xu Y, Chen L (2010) Term-frequency based feature selection methods for text categorization. Paper presented at the 4th international conference on genetic and evolutionary computing, 280–283 Dec 2010.
  18. Yili W et al (2017) A novel feature-based text classification improving the accuracy of twitter sentiment analysis. Paper presented at the 12th international conference on future information technology, 440–445 May 2017.
  19. Salton G, Buckley C (1988) Term-weighting approaches in automatic text retrieval. Inf Pro Man 24:513–523. Google Scholar
  20. Zhihua X et al (2016) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Dis Syst 27:340–352. View ArticleGoogle Scholar
  21. Wen Z, Yoshida T, Xinjing T (2011) a comparative study of TF* IDF, LSI and multi-words for text classification. Expert Syst Appl 38:2758–2765. View ArticleGoogle Scholar
  22. Chuanxin J et al (2015) Chi square statistics feature selection based on term frequency and distribution for text categorization. IETE J Res 61:351–362. View ArticleGoogle Scholar
  23. Zhangjie F et al (2016) Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans Parallel Distrib Syst 27:2546–2559. View ArticleGoogle Scholar
  24. Tinghuai M et al (2016) LED: a fast overlapping communities detection algorithm based on structural clustering. Neurocomput 207:488–500. View ArticleGoogle Scholar
  25. Sentiment analysis workload Sentiment 140. Accessed 15 May 2016
  26. Zebin W et al (2016) Parallel and distributed dimensionality reduction of hyperspectral data on cloud computing architectures. IEEE J Sel Top App Earth Obs Remote Sens 9:2270–2278. View ArticleGoogle Scholar
  27. Paul S, Das S (2015) simultaneous feature selection and weighting–an evolutionary multi-objective optimization approach. Pattern Recognit Lett 65:51–59. View ArticleGoogle Scholar
  28. Zhaoqing P et al (2016) Fast motion estimation based on content property for low-complexity H.265/HEVC encoder. IEEE Trans Broad 62:675–684. View ArticleGoogle Scholar
  29. Wikipedia Naïve Bayes classifier. Accessed 3 June 2016
  30. Suresh Y (2016) Software quality assessment for open source software using logistic and Naive Bayes classifier. Paper presented at the International conference on computation system and information technology for sustainable solutions, 267–272 Oct 2016.
  31. Singh M, Provan, GM (1996) A comparison of induction algorithms for selective and non-selective Bayesian classifiers. Paper presented at the international conference on machine learning, 497–505 May 1996. 6.50068-2
  32. Wikipedia Sentiment analysis. Accessed 20 Jan 2016
  33. Wilson T, Wiebe J, Hoffmann P (2005) Recognizing contextual polarity in phrase-level sentiment analysis. Paper presented at the conference on human language technology and empirical methods in natural language processing, 347–354 Oct 2015.
  34. Miller G et al (1990) Introduction to wordnet: an on-line lexical database. Int J Lexicogr 3:235–244. View ArticleGoogle Scholar
  35. Baccianella S, Esuli A, Sebastiani F (2010) Sentiwordnet 3.0: an enhanced lexical resource for sentiment analysis and opinion mining. In: LREC, 10:2200–2204 May 2010Google Scholar
  36. Troussas C et al (2013) Sentiment analysis of Facebook statuses using Naive Bayes classifier for language learning. Paper presented at the 4th international conference on information, intelligence, systems and applications, 1–6 July 2013.
  37. Krouska A, Troussas C, Virvou M (2016) The effect of preprocessing techniques on twitter sentiment analysis. Paper presented at the 7th international conference on information, intelligence, systems and applications, 1–5 July 2016.
  38. Troussas C, Krouska A, Virvou M (2016) Evaluation of ensemble-based sentiment classifiers for twitter data. Paper presented at the 7th international conference on information, intelligence, systems and applications, 1–6 July 2016.
  39. Krouska A, Troussas C, Virvou M (2017) Comparative evaluation of algorithms for sentiment analysis over social networking services. J Univers Comput Sci 23(8):755–768. Google Scholar
  40. Ravichandran M, Kulanthaivel G (2014) Twitter sentiment mining (TSM) framework based learners emotional state classification and visualization for e-learning system. J Theor Appl Inf Technol 69(1):84–90Google Scholar
  41. Yu Y, Xiao W (2015) World Cup 2014 in the twitter World: a big data analysis of sentiments in US sports fans. Comput Hum Behav 48:392–400. View ArticleGoogle Scholar
  42. Smailović J et al (2014) Stream-based active learning for sentiment analysis in the financial domain. Inf Sci 285:181–203. View ArticleGoogle Scholar
  43. Silva Da et al (2014) Tweet sentiment analysis with classifier ensembles. Decis Support Syst 66:170–179. View ArticleGoogle Scholar
  44. Yuhui Z et al (2017) Student’s t-hidden Markov model for unsupervised learning using localized feature selection. IEEE Trans Circuits Syst Video Technol. Google Scholar
  45. Bahassine S, Madani A, Kissi M (2016) An improved Chi-sqaure feature selection for Arabic text classification using decision tree. Paper presented at the international conference on intelligent systems: theories and applications, 1–5 Oct 2016.
  46. Stanford Log-linear Part of Speech Tagger. Accessed 13 Mar 2017
  47. Slide share text analysis for security. Accessed 16 Apr 2017
  48. Mekuria Z, Assabie Y (2014) A hybrid approach to the development of part-of-speech tagger for Kafi-noonoo text. Paper presented at the international conference on intelligent text processing and computational linguistics, 214–224 April 2014.
  49. O’Keefe T, Koprinska I (2009) feature selection and weighting methods in sentiment analysis. Paper presented at the 14th Australasian document computing symposium, 67–74 Dec 2009Google Scholar
  50. Sebastiani F (2002) machine learning in automated text categorization. Paper presented at the ACM computing surveys, 34:1–47 March 2002.
  51. Zhaoqing P et al (2016) Fast reference frame selection based on content similarity for low complexity HEVC encoder. J Vis Commun Image Rep 40:516–524. View ArticleGoogle Scholar
  52. Go A, Bhayani R, Huang L (2009) twitter sentiment classification using distant supervision. CS224N Project Report, Stanford, 12, Dec 2009Google Scholar
  53. Jinwei W et al (2017) Forensics feature analysis in quaternion wavelet domain for distinguishing photographic images and computer graphics. Multimedia Tools Appl 76:23721–23737. View ArticleGoogle Scholar
  54. Jin W et al (2015) Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks. IEEE Trans Consumer Electron 61:438–444. View ArticleGoogle Scholar
  55. Jin W et al (2005) A load-balancing and energy-aware clustering algorithm in wireless ad-hoc networks. Paper presented at the international conference on embedded and ubiquitous computing, 1108–1117 Dec 2005.
  56. Jin W et al (2017) Energy-efficient cluster-based dynamic routes adjustment approach for wireless sensor networks with mobile sinks. J Supercomput 73:3277–3290. View ArticleGoogle Scholar
  57. Zhangjie F et al (2015) Privacy-preserving smart similarity search based on Simhash over encrypted data in cloud computing. J Int Technol 16:453–460. Google Scholar
  58. Huan R et al (2018) A novel subgraph K+-isomorphism method in social network based on graph similarity detection. Soft Comput 22:2583–2601. View ArticleGoogle Scholar
  59. Gu B, Sun X, Sheng VS (2017) Structural minimax probability machine. IEEE Trans Neural Netw Learn Syst 28:1646–1656. MathSciNetView ArticleGoogle Scholar
  60. Wikipedia.Chi squared distribution. Accessed 2 July 2017
  61. Gu B, Sheng VS (2017) A robust regularization path algorithm for ν-support vector classification. IEEE Trans Neural Netw Learn Syst 28:1241–1248. View ArticleGoogle Scholar
  62. The Stanford Natural language processing group. Naive Bayes text classification. Accessed 25 June 2016
  63. GitHub. Matlab-standford-postagger. Accessed 15 Mar 2017


© The Author(s) 2018