A web sentiment analysis method on fuzzy clustering for mobile social media users
 Li Yang^{1}Email author,
 Xinyu Geng^{1} and
 Haode Liao^{1}
https://doi.org/10.1186/s1363801606260
© Yang et al. 2016
Received: 27 January 2016
Accepted: 24 April 2016
Published: 6 May 2016
Abstract
Microblog has become an emerging application in the Internet in recent years, and affective computing and sentiment analysis for microblog have been a vital research project in computer science, natural linguistics, psychology of human, and other social computing fields. In this paper, firstly, fuzzy clustering theory was introduced and source database for microblog was constructed. Then, word similarity computation method based on basic emotion word set of HowNet was used to calculate weights of microblog emotion words, and microblog emotional lexicon was built. Next, using calculation methods for appropriate sentiment value, the whole microblog message’s emotional values were obtained. Finally, sentiment values from users in different time periods were selected as original data matrix, using the fuzzy clustering algorithm. The users were classified dynamically; meanwhile, dynamic clustering figure was generated. The best classification was obtained by using F statistics test method, and emotion trend graph was predicted from classification results, to more intuitively analyze emotion changes of user. In this paper, using microblog information with affective computing, governments, businesses, or enterprises can get different classification results according to the different needs and take the appropriate measures.
Keywords
1 Introduction
Since human entered the twentyfirst century, people continue to create hightech product and enjoy various emotions they bring. Internet products all the time burst with its unique personality and creativity; a few years ago, people always soaked in social networking sites such as “kaixin” and “renren”, to share with the working and living of classmates, colleagues, or friends. Nowadays, “microblog” is widely used in the daily life of Internet users and plays an important role. In recent years, with the rapid development of Web technologies and the growing and expanding of website, users have become the browser of website contents and the creator of website contents. All kinds of social network service (SNS), such as Facebook, forum, friendsnet, renren, Sina microblog, and Tencent zone, have become the indispensable stage for globe internet users to show their emotions, communicate with each other, and share information, as well as become windows to get information, show themselves, and promote marketing. With the development of mobile networks, users can express their personal mood at any time, describe their experience, and elaborate the subjective and objective view of things on the Internet [1].
Microblog, as a new type of media, is developing rapidly. It has the characteristics of fast propagation speed, realtime information updating, and strong interaction and so on and has a tremendous impact on social life of Internet users and even the nonusers. Microblog users can use the computer, mobile devices (such as mobile phones and iPad) to release and share information to the community in a variety of forms through the Internet. On the one hand, users can post messages on microblog. On the other hand, users can also find out news of current events, hot topics, reviews of others on the microblog, expand their social circle, and make likeminded friends. The man who designed microblog platform at first is, Evan Williams, the founder of blog technology, pioneer blogger. In March 2006, he launched a social network platform and microblog service that is now known abroad, Twitter. In China, microblog, the new term, has become the world’s most popular word and two most popular microblog platforms are Sina microblog and Tencent microblog [2].
Nowadays, the social network has become an important part of people’s lives; you can talk about something in the QQ space or microblog, share the mood like a diary, and record all kinds of emotional color in the daily life. Therefore, Web text data which contains the rich emotion of Internet users expand at an amazing speed, so the analysis of an effective emotional analysis model has become one of the important topics of network social computing.
Microblog sentiment computing and analysis includes two aspects: one is to analyze the personal emotion fluctuation in different period of time; the other is to analyze emotions of a group people in different time. The meanings are as following: first, through the establishment of personal emotion charts, emotional states of Internet users in a certain period of time can be analyzed so that decision makers can understand the emotion changes related to Internet users recently and timely can detect abnormal changes of mood, in order to make the corresponding decision to create a healthy and harmonious network society; secondly, through the research on group emotion analysis, emotion dynamic fuzzy clustering graph can be formed by fuzzy clustering analysis on members in group. And we can set different conditions to get different classification results, in order to find your friends. So, the establishment of various kinds of social relations can provide great help to users in life or in business decisions.
In the paper, fuzzy clustering algorithm is applied to microblog sentiment analysis and dynamic clustering graph is generated; the best classification is obtained by using F statistics test method, and emotion trend graph is predicted from classification results by SPSS, to achieve visualization on people’s emotions.
The remainder of this paper is organized as follows. Section 2 describes the related work on web sentiment analysis methods. Section 3 gives computation method for the sentiment value of sentiment phrase with modifier, as well as sentiment intensity analysis of microblog content. Section 4 presents sentiment analysis for QQ zone users. In Section 5, sentiment clustering analysis of microblog users on fuzzy clustering algorithm is put forward. Conclusions are summarized in Section 6.
2 Related works
Wang et al. [3] thought that sentiment analysis is to analyze users’ comments on the Web, so as to identify the implicit emotional information, and found out the rules of user emotion evolution; Zhao et al. [4] believed that sentiment analysis was called opinion mining, an analysis, processing, induction, and deduction process of subjectivity text with emotional color. Sentiment analysis involved various difficult and huge challenging researches. Existing research fruits on microblog sentiment analysis are listed as follows:
In 2009, Alec Go, Richa Bhayani, and Lei Huang used machine learning method for the first time to analyze the sentiment on the microblog text and joined the emoticon sign in the system so as to greatly improve the accuracy of the system [5]. In 2010, according to statistics on written words of product view and opinion polls of customer between 2008 and 2009, Brendan, Ramnath Balasubramanyan, and Bryan R. Routledge concluded that sentiment words used in product view and opinion polls had a high correlation [6]. Alexander Pak and Patrick Paroubek collected data and trained classifier to make research on sentiment analysis and opinion mining on microblog [7]; Albert Bifet and Eibe Frank analyzed the difficulties in microblog data mining, solved the problem of unbalanced data classes by setting a kappa test sliding window, and achieved good results [8]; Dmitry Davidov, Oren Tsur, and Ari Rappoport built an emotional classification system by supervising learning based on Twitter with common labels, emotion labels. The method did not need too much manual annotation [9]; Cindy Xide Lin, Bo Zhao, and Qiaozhu Mei discussed social network event topic by using the statistical method [10]; Asli Celikyilmaz, Dilek Hakkani, and Junlan Feng classified Twitter text into polar and nonpolar text by probability and statistics mode and then used the sentiment vocabulary to categorize sentiment polarity of Twitter text [11]; Luciano Barbosa and Junlan Feng detected sentiment information of Twitter text by analyzing text structure and text keywords information of Twitter [1213]. Long Jiang, Mo Yu, and Ming Zhou improved the accuracy of sentiment classification by merging characteristics and adding relevant text [14]. Lei Zhang, Riddhiman Ghosh, and Mohamed Dekhil adopted sentiment dictionary and machine learning methods to classify emotional polarity text in Twitter based on entity in the text [15].
In online videos, Hoque et al. developed an automated system to distinguish between naturally occurring spontaneous smiles under frustrating and delightful stimuli by exploring their temporal patterns given video of both, evaluated and compared two variants of Support Vector Machine (SVM), Hidden Markov Models (HMM), and HiddenState Conditional Random Fields (HCRF) for binary classification. McDuff et al. presented results validating a novel framework for collecting and analyzing facial responses to media content over the Internet. The framework, data collected, and analysis demonstrated an ecologically valid method for unobtrusive evaluation of facial responses to media content [16, 17].
In terms of opinion mining, a fuzzy propagation modeling for opinion mining by sentiment analysis of online social networks was proposed by Trung et al. A practical system, called TweetScope, has been implemented to efficiently collect and analyze all possible tweets from customers [18]. S Venkatesh, D Phung, D Bo, and M Berk used machine learning and statistical methods to discriminate online messages between depression and control communities using mood, psycholinguistic processes, and content topics extracted from the posts generated by members of these communities [19].To understand customers’ opinion and subjectivity, a fuzzy propagation modeling for opinion mining by sentiment analysis of online social networks was presented and a practical system, called TweetScope, was implemented to efficiently collect and analyze all possible tweets from customers [20, 21]. A crowdsourcingbased method is proposed by Xu et al. [31–35] to process mobile social media data. To improve sentiment analysis consequences, Xing Wu and Shaojian Zhu investigated the limitations of traditional sentiment analysis approaches and proposed an effective Chinese sentiment analysis approach based on emotion degree lexicon to obtain significant improvement in Chinese text [22]. To address these various limitations and issues in nonEnglish languages, in 2014, Wang et al proposed a new scheme to derive dominant valence as well as prominent positive and negative emotions by using an adaptive fuzzy inference method (FIM) with linguistics processors to minimize semantic ambiguity as well as multisource lexicon integration and development [23].
To solve the difference among affect, feelings, emotions, sentiments, and opinions in text, M. D. Munezero et al. clarified the differences between these five subjective terms and reveals significant concepts to the computational linguistics community for their effective detection and processing in text [24]. A new affectivebehavioralcognitive (ABC) framework was presented to measure the usual cognitive selfreport information and behavioral information, together with affective information while a customer makes repeated selections in a randomoutcome twooption decision task to obtain their preferred product [25]. SantosSanchez et al. proposed a novel system to obtain data of interest from a Web search engine by analyzing the emotional and sentimental content of each page, which made possible to have a better understanding on how the users perceive the recommended products [26]. Pappurajan, A. and S. P. Victor put forward an algorithm that judged whether the text in the Tweet is positive or negative based on the likelihood for each possibility to determine the sentiment of the text, whether it was positive or negative [27]. In order to facilitate sentiment analysis of usergenerated content, Hogenboom et al. proposed to map sentiment conveyed by unstructured natural language text to universal star ratings, capturing intended sentiment. The results of our experiments revealed languagespecific sentiment scores can separate universal classes of intended sentiment from one another to a limited extent [28]. A new sentiment analysis technique called SentiPipe was presented, which took the best of a set of methods, generating a less sensitive analysis based context [29]. C. Clavel and Z. Callejas presented a comparative state of the art which analyzes the sentimentrelated phenomena and the sentiment detection methods used in both communities and made an overview of the goals of socioaffective humanagent strategies [30].
3 Method
3.1 The basic principle of fuzzy clustering
Clustering analysis is to strictly divide each object into different classes. In fact, most of the objects are fuzzy. Here, the socalled fuzzy, mainly refers that the differences in objective things in the middle of the excessive nature is not clear, such as in the management system, medical diagnosis, artificial intelligence, image recognition, and other fields. Fuzzy set theory was first put forward by professor L. A. Zadeh; many meaningful results have been achieved until now. From the point of view of the development trend of the subject, it has extremely strong vitality and penetrability. Fuzzy set theory is applied to solving the problem of clustering in order to cluster fuzzy objects. The essence of fuzzy clustering is to construct fuzzy matrix according to the nature of the object itself, on the basis of this, according to a certain degree of membership, to determine the classification relationship.

Definition 1: Let set of source information for statistical analysis be X = (x _{1}, x _{2}, ⋯, x _{ n }), where x _{ i } has m attributes, (x _{ i1}, x _{ i2}, ⋯, x _{ im }) represents a partition of x _{ i }. X is n × m matrix, which is called initial value matrix.

Definition 2: In X = (x _{1}, x _{2}, ⋯, x _{ n }), x _{ i } and x _{ j } (i ≠ j) are any two different objects. The symbol r _{ ij } stands for similarity degree between x _{ i } and x _{ j }; r _{ ij } is called as similarity coefficient.

Definition 3: Let U and V be two domains. For ∀ (x, y) ∈ U × V, denote R as membership degree (or membership function) of U and V. μ _{ R }(x, y) : U × V → [0, 1] represents fuzzy set R on U and V, which is a fuzzy relation from U to V.

Definition 4: Suppose U and V are finite domains, then all the r _{ ij }, constitute fuzzy set R, which can be rewritten as (r _{ xy })_{ n × m }, where 0 ≤ r _{ ij } ≤ 1(i ≤ n, j ≤ m) and n and m are all positive integers. Matrix R is a fuzzy matrix and satisfies the following conditions:
 1)
Reflexivity: That is, any object must be the same as its own, which is denoted as r _{ ii } = 1
 2)
Symmetry: If the object a is similar to the object b, then b should be similar to a, which is denoted as r _{ ij } = r _{ ji }
 3)
Transitivity: If the object a and object b are similar, object b and object c are similar, then a and c are similar, which is denoted as R ∘ R ⊆ R
If R satisfies the above 1), 2), 3), then the relation represented by R is called as equivalence relation. So, fuzzy clustering analysis is carried out on the fuzzy equivalence relation.
R = (r _{ ij })_{ n × n }, which satisfies the reflexivity, symmetry, and transitivity, is fuzzy equivalence matrix, also known as similarity matrix.
 1)

Definition 5: Let R = (r _{ ij })_{ n × n }; for given λ ∈ [0, 1], R _{ λ } = (r _{ ij }(λ))_{ n × n }, then R _{ λ } is λcut matrix of R, where \( {r}_{ij}\left(\lambda \right)=\left\{\begin{array}{l}1,{r}_{ij}\ge \lambda \\ {}0,{r}_{ij}<\lambda \end{array}\right. \). The equivalent matrix R = (r _{ ij })_{ n × n } can be used to classify the objects in domain, that is, when R = (r _{ ij })_{ n × n } is determined, for a given λ ∈ [0, 1], the equivalent matrix R _{ λ } can be obtained, and then get a level classification of λ.
3.2 Collection of microblog sentiment words set
 (1)
Microblog corpus reprocessing
Before extracting the microblog network words, first of all, text information of microblog need to be reprocessed, such as microblog message: “//@ veggieg: flags can hang up a bit, dear,” “【# I’m a singer # live 】 zhang jie sings the great love of life and feeling…,” and so on. In the messages, “@user,” “# Theme Name#,” “punctuation.” and hyperlink information need to be removed in the reprocessing. n − gram (n = 1, 2, 3, 4) method is used to get microblog words set, then basic sentiment words set are filtered out; next, candidate networks’ sentiment word set can be obtained. Finally, analyzing word frequency of the candidate word sets gotten by n − gram (n = 2, 3, 4), and setting a word frequency threshold value, effective candidate words set can be generated (if the candidate words frequency is lower than the threshold, it is filtered).
 (2)
Discovery method of microblog network sentiment words (contextbased entropy method)
Step 1: Compute each word in candidate word set with contextbased entropy method. Let context word sets of a candidate word w be L = {l _{1}, l _{2}, l _{3}, ⋯, l _{ p }} and R = {r _{1}, r _{2}, r _{3}, ⋯ r _{ q }}; its context entropy is computed as follows:$$ {E}_L(w)=\frac{1}{n}{\displaystyle \sum_{i=1}^pC\left(w,{l}_i\right)} \log \frac{C\left(w,{l}_i\right)}{n},{l}_i\in L $$(1)$$ {E}_R(w)=\frac{1}{m}{\displaystyle \sum_{j=1}^qC\left(w,{r}_j\right)} \log \frac{C\left(w,{r}_j\right)}{m},{r}_j\in R $$(2)In formula 1 and 2, \( n={\displaystyle \sum_{l_i\in L}C\left(w,{l}_i\right)},m={\displaystyle \sum_{r_j\in R}C\left(w,{r}_j\right)} \),where m and n represent the total frequency times of single word appearing before candidate word and after candidate word, respectively; C(w, l _{ i }) and C(w, l _{ i }) are respectively the frequency times of word; l _{ i } and r _{ j } appears in the candidate words w context.
Step 2: Determine network sentiment words. First, set context entropy threshold and count word frequency to extract users’ network sentiment words in the microblog, then make up network sentiment words library of the microblog.
 (3)
Filter of the network words (IFIDF method)
Although some words have context entropy, they are not words like
which belongs to network word but has not the emotion color. For these disruptive words, they need to be filtered. In this paper, IFIDF method is used to filter the network words. IFIDF calculation method is shown in formula (3)$$ \mathrm{T}\mathrm{F}\hbox{} \mathrm{I}\mathrm{D}\mathrm{F}\left({w}_i\right)=\mathrm{freq}\left({w}_i\right)\cdot log\left(\frac{N}{df\left({w}_i\right)}\right) $$(3)where
freq(w _{ i }) represents the occurrence times of word w _{ i } in the corpus, N is total number of total documents in the corpus, and df(w _{ i }) is the frequency of documents containing w _{ i } in the corpus.
In microblog corpus, the next steps for filtering network words are to calculate IFIDF values of each candidate word, and then sort them, set a threshold value, and finally merge the candidate words higher than the threshold into microblog network sentiment word set.
3.3 A computation method for the sentiment value of sentiment phrase with modifier
Computation method of sentiment phrases trend
Sequence number  Phrase combination mode  Formula of sentiment computing 

1  S = PW  E(PW) 
2  S = NA + PW  a*E(PW)*E(NA),where a is adjustable parameter, its value range is from 1/2 to 1 
3  S = NA + NA + PW  E(PW)*E(NA)*E(NA) 
4  S = DA + PW  (1 + E(DA))*E(PW), E(DA) < 0 E(PW) + (1E(PW))*E(DA),E(DA) > 0 & E(PW) > =0 E(PW) + (1E(PW))*E(DA),E(DA) > 0 & E(PW) < 0 
5  S = DA + DA + PW  E(PW) + (1E(PW))*(E(DA1) + (1E(PW)(1E(PW))*E(DA1))*E(DA2) 
6  S = NA + DA + PW  E(PW) + (1E(PW))*(E(DA)0.2)) 
7  S = DA + NA + PW  E(PW)*E(NA) + (1E(PW)*E(NA)*E(DA) 
3.4 The sentiment intensity analysis of microblog content
Microblog content may be a phrase and may also be composed of two or more short sentences. To calculate sentiment intensity value of the whole microblog content, the first step is to analyze sentiment value of every phrase in microblog content; the second step is that if a complex sentence composed of two or more than two short sentences contains “coordinating,” “progressive,” “causal,” and “selected” relationship of conjunction, sentiment intensity value of the complex sentence is determined by means of accumulative sum of sentiment values; for the complex sentence with “hypothesis,” “conditions,” “concessions,” or “turning” relationship, sentiment intensity value of rear part of the sentence is taken as the sentiment intensity value of the whole sentence. Moreover, in a single short sentence, firstly, we should select sentiment words, and secondly, modify sentiment intensity value of sentiment words according to the weights of degree adverbs and negative words.

Algorithm name: sentiment intensity value computation based on sentence semantic with sentiment words

Input: microblog message sentence S

Output: sentiment intensity value E(S) of message S

Step 1: Decompose the sentence into single Chinese words, then mark speech of words; finally, store the sequence of decomposed Chinese words

Step 2: Find the conjunction and punctuation in the sequence of decomposed words, obtain p short sequences {SS _{ k }, k = 1, 2, ⋯, p}, and store the conjunction types

Step 3: Compute sentiment intensity value of single phrase SS _{ k }

Step 3.1: In sentiment library, search a sentiment word w and record its sentiment weight E(w)

Step 3.2: Extract the modifier in two adjacent punctuation area before and after sentiment word, get degree adverbs set D = (D _{1}, D _{2}, ⋯, D _{ n }) and negative word sets N = (N _{1}, N _{2}, ⋯, N _{ m }), then according to Table 2, obtain adjusted sentiment value of sentiment word w with modifier, which is the sentiment intensity ME(w) of phrase SS _{ k }Table 2
Meaning of emotional phrase tag
Tag
Sentiment formula
PW
Sentiment words
NA
Negative words
DA
Adverbs of degree
E(*)
*Sentiment intensity value of the word, *stands for negative emotional words and adverbs of degree
S
The phrases made up of modifier and sentiment words

Step 4: According to the phrase sequence relationship, use corresponding algorithm to obtain sentiment intensity values E(S) of the whole sentence

Step 5: Determine sentence types

Case 1: question sentence, then E(S) = − E(S), turn step 6

Case 2: exclamatory sentences, then E(S) = 2E(S), turn step 6

Step 6: output E(S)
3.5 Generation of sentiment dynamic clustering graph
Fuzzy clustering concept is based on general clustering. Assume that the set of X is classified to many classes by membership function; each class is thought as a fuzzy subset of X; the classification matrix corresponding to each classification is a fuzzy matrix R.
 (1)
Construction of original data matrix
Let classified objects be domain X = (x _{1}, x _{2}, ⋯, x _{ n }) and n represents the number of objects; each object has m attribute features, x _{ i } = (x _{ i1}, x _{ i2}, ⋯, x _{ im }), i = 1, 2, ⋯, n,. So, original data matrix is given as follows:$$ A=\left[\begin{array}{cccc}\hfill {x}_{11}\hfill & \hfill {x}_{12}\hfill & \hfill \cdots \hfill & \hfill {x}_{1m}\hfill \\ {}\hfill {x}_{21}\hfill & \hfill {x}_{22}\hfill & \hfill \cdots \hfill & \hfill {x}_{2m}\hfill \\ {}\hfill \vdots \hfill & \hfill \vdots \hfill & \hfill \vdots \hfill & \hfill \vdots \hfill \\ {}\hfill {x}_{n1}\hfill & \hfill {x}_{n2}\hfill & \hfill \cdots \hfill & \hfill {x}_{nm}\hfill \end{array}\right] $$where x _{ nm } represents original data of the mth feature of the nth classified object.
 (2)
Standardization processing of data
Because of the different orders of magnitude and dimension of feature indexes, for the convenience of analysis and comparison, the sample data needs to be standardized; data range is transferred to the domain [0, 1] (normalized processing). Assume that there are n sample objects x _{1}, x _{2}, ⋯, x _{ n }, each object has m feature values y _{1}, y _{2}, ⋯, y _{ m }; x _{ ij } means the jth attribute value of the ith object. The following moving range formula (4) is used in standardization method:$$ {x_{ij}}^{\prime }=\frac{x_{ij}{x}_{\min }}{x_{\max }{x}_{\min }} $$(4)  (3)
Construction of a fuzzy similar matrix
Let the domain set be X = (x _{1}, x _{2}, ⋯, x _{ n }), x _{ i } = (x _{ i1}, x _{ i2}, ⋯, x _{ im }), in accordance with the commonly clustering method; we can determine fuzzy similarity coefficient r _{ ij }, which is similar degree of x _{ i }, x _{ j } (r _{ ij } = R(x _{ i }, x _{ j })).
The following 12 methods can be used to determine r _{ ij }, which can be chosen for actual needs. (1)Maximum minimum method$$ {r}_{ij}=\frac{{\displaystyle {\sum}_{k=1}^m\left({x}_{ik}\wedge {x}_{jk}\right)}}{{\displaystyle \sum_{k=1}^m\left({x}_{ik}\vee {x}_{jk}\right)}} $$(5)
 (2)Arithmetic average minimum method$$ {r}_{ij}=\frac{{\displaystyle {\sum}_{k=1}^m\left({x}_{ik}\wedge {x}_{jk}\right)}}{\frac{1}{2}{\displaystyle {\sum}_{k=1}^m\left({x}_{ik}+{x}_{jk}\right)}} $$(6)
 (3)Geometric average minimum method$$ {r}_{ij}=\frac{{\displaystyle {\sum}_{k=1}^m\left({x}_{ik}\wedge {x}_{jk}\right)}}{{\displaystyle \sum_{k=1}^m\sqrt{x_{ik}{x}_{jk}}}} $$(7)
 (4)Index similarity coefficient method$$ {r}_{ij}=\frac{1}{m}{\displaystyle \sum_{k=1}^m{e}^{\frac{4{\left({x}_{ik}{x}_{jk}\right)}^2}{3{s}_k^2}}} $$(8)
where \( {s}_k=\sqrt{\frac{1}{n}{\displaystyle {\sum}_{i=1}^m{\left({x}_{ik}{\overline{x}}_{{}_k}\right)}^2}},\kern0.5em {\overline{x}}_{{}_k}=\frac{1}{n}{\displaystyle {\sum}_{i=1}^n{x}_{ik}} \)
 (5)Correlation coefficient method$$ {r}_{ij}=\frac{{\displaystyle {\sum}_{k=1}^m\left{x}_{ik}{\overline{x}}_{{}_i}\right\left{x}_{jk}{\overline{x}}_{{}_j}\right}}{\sqrt{{\displaystyle {\sum}_{k=1}^m{\left({x}_{ik}{\overline{x}}_{{}_i}\right)}^2}}\cdot \sqrt{{\displaystyle {\sum}_{k=1}^m{\left({x}_{jk}{\overline{x}}_{{}_j}\right)}^2}}} $$(9)
Where \( {\overline{x}}_{{}_i}=\frac{1}{m}{\displaystyle {\sum}_{k=1}^m{x}_{ik}},{\overline{x}}_{{}_j}=\frac{1}{m}{\displaystyle {\sum}_{k=1}^m{x}_{jk}} \)
 (6)Chebyshev distance method$$ {r}_{ij}=1C{\left(d\left({x}_i,{x}_j\right)\right)}^a $$(10)
where \( d\left({x}_i,{x}_j\right)=\underset{k=1}{\overset{m}{\vee }}\left{x}_{ik}{x}_{jk}\right,\kern0.5em a=1 \)
 (7)Absolute value index method$$ {r}_{ij}={e}^{{\displaystyle {\sum}_{k=1}^m\left{x}_{ik}{x}_{jk}\right}} $$(11)
 (8)Absolute value inverse method$$ {r}_{ij}=\left\{\begin{array}{cc}\hfill 1\hfill & \hfill i=j\hfill \\ {}\hfill \frac{C}{{\displaystyle {\sum}_{k=1}^m\left{x}_{ik}{x}_{jk}\right}}\hfill & \hfill i\ne j\hfill \end{array}\right. $$(12)
where C is proper positive number, satisfy \( C\le \underset{i,j}{ \min}\left({\displaystyle {\sum}_{k=1}^m\left{x}_{ik}{x}_{jk}\right}\right) \)
 (9)Dot product method$$ {r}_{ij}=\left\{\begin{array}{cc}\hfill 1\hfill & \hfill i=j\hfill \\ {}\hfill \frac{1}{C}{\displaystyle {\sum}_{k=1}^m{x}_{ik}{x}_{jk}}\hfill & \hfill i\ne j\hfill \end{array}\right. $$(13)
where C is proper positive number,satisfy \( C\ge \underset{i,j}{ \max}\left({\displaystyle \sum_{k=1}^m{x}_{ik}{x}_{jk}}\right) \)
 (10)Absolute value reduction method$$ {r}_{ij}=\left\{\begin{array}{cc}\hfill 1\hfill & \hfill i=j\hfill \\ {}\hfill 1C{\displaystyle \sum_{k=1}^m\left{x}_{ik}{x}_{jk}\right}\hfill & \hfill i\ne j\hfill \end{array}\right. $$(14)
where C is a proper positive number, which satisfies 0 ≤ r _{ ij } ≤ 1.
 (11)Angle cosine method$$ {r}_{ij}=\frac{{\displaystyle {\sum}_{k=1}^m{x}_{ik}{x}_{jk}}}{\sqrt{{\displaystyle {\sum}_{k=1}^m{x}_{ik}^2}}\cdot \sqrt{{\displaystyle {\sum}_{k=1}^m{x}_{jk}^2}}} $$(15)
 (12)
Subjective evaluation method
Experts with rich experience experts directly assess the similarity degree between x _{ i } and x _{ j } and give the value of r _{ ij } (0 ≤ r _{ ij } ≤ 1).
 (1)
 (4)
Clustering (fuzzy equivalence matrix)
The fuzzy similar matrix constructed in the above section usually has reflexivity and symmetry and does not satisfy transitivity. In order to classify, we need to obtain fuzzy equivalence matrix by modifying fuzzy similar matrix. The commonly used method is the transitive closure method, that is R → R ^{2} → R ^{4} ⋯ → R ^{2k } ⋯ until R ^{2k } = (R ^{2k })^{2}, then R ^{2k } is called transitive closure. After obtaining the transitive closure, we can construct fuzzy equivalence matrix in domain set X. Then, set λ ∈ [0, 1], find R _{ λ }, namely, under different levels of λ, a dynamic clustering graph in range X can be generated by data processing tool such as Matlab, SPSS, and so on.
4 Sentiment analysis for QQ zone users
4.1 Original data matrix
Original data matrix
0.5  0.55  0.69  0.58  0.57  0.45  −0.14  −0.89  0.45  0.7 
0.5  0.54  0.69  0.69  0.57  0.95  1  −0.69  0.85  0.9 
0.89  0.78  0.89  0.69  0.57  −0.95  −0.89  −0.69  0.75  0.9 
0.1  −0.78  −0.9  −0.69  0.57  −1  −0.9  −0.69  0.23  0.3 
−0.1  −0.2  −0.3  −0.59  0.86  1  0.9  −0.69  0.23  −0.3 
0.1  −0.2  0.3  0.52  0.66  0.8  0.9  0.69  0.73  −0.36 
−0.1  0.2  0.3  0.52  0.46  −0.8  0.1  −0.69  0.73  −0.36 
0.5  0.55  0.89  0.2  −0.3  0.45  −0.14  −0.89  0.45  0.7 
0.19  0.85  0.79  0.2  −0.3  −0.45  −0.14  −0.89  0.45  0.7 
0.19  0.25  0.74  0.62  −0.33  −0.45  −0.14  −0.59  −0.45  0.7 
0.9  0.5  0.74  0.62  0.33  0.45  0.14  0.59  0.45  0.39 
0.9  0.89  0.74  0.62  0.33  0.89  0.55  0.59  0.45  0.29 
0.9  0.89  0.84  0.92  −0.13  0.89  0.85  0.78  −0.85  0.3 
0.19  0.89  0.44  0.82  −0.33  0.59  0.65  0.78  −0.45  0.13 
1  0.89  0.39  0.99  0.85  1  1  1  0.82  1 
4.2 Sample data standardization processing
Data standardization matrix
0.545455  0.796407  0.888268  0.755952  0.756303  0.725  0.4  0  0.764706  0.779412 
0.545455  0.790419  0.888268  0.821429  0.756303  0.975  1  0.10582  1  0.926471 
0.9  0.934132  1  0.821429  0.756303  0.025  0.005263  0.10582  0.941176  0.926471 
0.181818  0  0  0  0.756303  0  0  0.10582  0.635294  0.485294 
0  0.347305  0.335196  0.059524  1  1  0.947368  0.10582  0.635294  0.044118 
0.181818  0.347305  0.670391  0.720238  0.831933  0.9  0.947368  0.835979  0.929412  0 
0  0.586826  0.670391  0.720238  0.663866  0.1  0.526316  0.10582  0.929412  0 
0.545455  0.796407  1  0.529762  0.02521  0.725  0.4  0  0.764706  0.779412 
0.263636  0.976048  0.944134  0.529762  0.02521  0.275  0.4  0  0.764706  0.779412 
0.263636  0.616766  0.916201  0.779762  0  0.275  0.4  0.15873  0.235294  0.779412 
0.909091  0.766467  0.916201  0.779762  0.554622  0.725  0.547368  0.783069  0.764706  0.551471 
0.909091  1  0.916201  0.779762  0.554622  0.945  0.763158  0.783069  0.764706  0.477941 
0.909091  1  0.972067  0.958333  0.168067  0.945  0.921053  0.883598  0  0.485294 
0.263636  1  0.748603  0.89881  0  0.795  0.815789  0.883598  0.235294  0.360294 
1  1  0.72067  1  0.991597  1  1  1  0.982353  1 
4.3 Construction of fuzzy similar matrix
Fuzzy similar matrix
1  0.859  0.781  0.554  0.572  0.636  0.71  0.893  0.808  0.759  0.819  0.751  0.587  0.616  0.638 
0.859  1  0.739  0.436  0.613  0.694  0.649  0.752  0.667  0.645  0.735  0.753  0.629  0.606  0.774 
0.781  0.739  1  0.575  0.374  0.47  0.67  0.696  0.717  0.661  0.703  0.662  0.518  0.458  0.616 
0.554  0.436  0.575  1  0.644  0.483  0.634  0.492  0.553  0.543  0.446  0.385  0.247  0.36  0.247 
0.572  0.613  0.374  0.644  1  0.749  0.677  0.51  0.481  0.471  0.494  0.521  0.414  0.5  0.476 
0.636  0.694  0.47  0.483  0.749  1  0.746  0.536  0.507  0.519  0.693  0.711  0.588  0.684  0.667 
0.71  0.649  0.67  0.634  0.677  0.746  1  0.628  0.689  0.691  0.646  0.586  0.421  0.559  0.461 
0.893  0.752  0.696  0.492  0.51  0.536  0.628  1  0.903  0.804  0.758  0.69  0.615  0.655  0.531 
0.808  0.667  0.717  0.553  0.481  0.507  0.689  0.903  1  0.865  0.673  0.641  0.56  0.662  0.482 
0.759  0.645  0.661  0.543  0.471  0.519  0.691  0.804  0.865  1  0.667  0.593  0.612  0.725  0.434 
0.819  0.735  0.703  0.446  0.494  0.693  0.646  0.758  0.673  0.667  1  0.926  0.762  0.712  0.721 
0.751  0.753  0.662  0.385  0.521  0.711  0.586  0.69  0.641  0.593  0.926  1  0.835  0.756  0.781 
0.587  0.629  0.518  0.247  0.414  0.588  0.421  0.615  0.56  0.612  0.762  0.835  1  0.829  0.705 
0.616  0.606  0.458  0.36  0.5  0.684  0.559  0.655  0.662  0.725  0.712  0.756  0.829  1  0.625 
0.638  0.774  0.616  0.247  0.476  0.667  0.461  0.531  0.482  0.434  0.721  0.781  0.705  0.625  1 
4.4 Sentiment clustering
Fuzzy equivalence matrix
1  0.859  0.7806  0.6343  0.6769  0.7113  0.7098  0.8931  0.8931  0.8075  0.8195  0.8195  0.762  0.7512  0.7744 
0.859  1  0.7806  0.6343  0.6944  0.7113  0.7098  0.859  0.8075  0.7592  0.8195  0.7744  0.7528  0.7528  0.7744 
0.7806  0.7806  1  0.6343  0.6695  0.6944  0.7098  0.7806  0.7806  0.7592  0.7806  0.7512  0.7025  0.7025  0.7386 
0.6343  0.6343  0.6343  1  0.6444  0.6444  0.6444  0.6285  0.6343  0.6343  0.6343  0.5861  0.5541  0.5586  0.5749 
0.6769  0.6944  0.6695  0.6444  1  0.7486  0.7459  0.6285  0.6769  0.6769  0.6927  0.7113  0.6128  0.6838  0.667 
0.7113  0.7113  0.6944  0.6444  0.7486  1  0.7459  0.6944  0.6893  0.6909  0.7113  0.7113  0.7113  0.7113  0.7113 
0.7098  0.7098  0.7098  0.6444  0.7459  0.7459  1  0.7098  0.7098  0.7098  0.7098  0.7113  0.6457  0.6909  0.667 
0.8931  0.859  0.7806  0.6285  0.6285  0.6944  0.7098  1  0.9033  0.8649  0.8195  0.7585  0.7585  0.725  0.7521 
0.8931  0.8075  0.7806  0.6343  0.6769  0.6893  0.7098  0.9033  1  0.8649  0.8075  0.7512  0.6729  0.725  0.6729 
0.8075  0.7592  0.7592  0.6343  0.6769  0.6909  0.7098  0.8649  0.8649  1  0.7592  0.7512  0.725  0.725  0.6671 
0.8195  0.8195  0.7806  0.6343  0.6927  0.7113  0.7098  0.8195  0.8075  0.7592  1  0.9257  0.8349  0.762  0.7808 
0.8195  0.7744  0.7512  0.5861  0.7113  0.7113  0.7113  0.7585  0.7512  0.7512  0.9257  1  0.8349  0.8288  0.7808 
0.762  0.7528  0.7025  0.5541  0.6128  0.7113  0.6457  0.7585  0.6729  0.725  0.8349  0.8349  1  0.8288  0.7808 
0.7512  0.7528  0.7025  0.5586  0.6838  0.7113  0.6909  0.725  0.725  0.725  0.762  0.8288  0.8288  1  0.7563 
0.7744  0.7744  0.7386  0.5749  0.667  0.7113  0.667  0.7521  0.6729  0.6671  0.7808  0.7808  0.7808  0.7563  1 
4.5 Clustering results analysis
 (1)
When λ is set to 0.9257, emotions of 15 users are classified into 14 classes: the 11th and 12th users are the same class. Table 1 shows that the 11th and 12th rows in the original data matrix are all positive; this reveals that the two users have positive emotion at the time of the study, and other Internet users are always in the negative emotion state in some time, namely the negative emotion. It also can be seen that the objects which get together for a class first have the higher degree of similarity and closer emotions tend. Analysis shows that the fuzzy clustering algorithm applied in sentiment analysis has a good effect.
 (2)
Users can select the proper threshold to search for friends that are similar or contrary to their emotions, according to their circumstance and achieve the emotional pursuit of life. This illustrates that the dynamic fuzzy clustering analysis method has good maneuverability and flexibility in the analysis of emotion.
5 Sentiment clustering analysis of microblog users on fuzzy clustering algorithm
5.1 Data preparation
Experimental data were from microblog of www.sina.com. A large number of users microblog messages with user ID were collected by crawler system, and the time, website, and forwarding times of the messages were stored in a database. Then, the messages were reprocessed and computed by sentiment algorithm; we can obtaine the sentiment values of the messages in different periods. In the experiment, we selected 50 microblog users and found their sentiment values in 10 periods. Denote object domain as X = {x _{1}, x _{2}, ⋯, x _{ n }}; let object attributes of x _{ i } be (x _{ i1}, x _{ i2}, ⋯, x _{ im }), where n = 50, m = 10.
5.2 Fuzzy clustering
In Fig. 2, users’ sentiment change is illustrated by calculating the user network news; no matter what social circles users are in, they will show their emotions, so sentiment analysis is not directly related to social categories. As illustrated in Fig. 2, when clustering threshold λ is more close to 1, classification number is more, λ is small to a certain value, and the samples will belong to one class (λ is set to 0.72; all users are incorporated into one category). The advantage of the clustering method is that λ can be selected according to the actual needs in order to get the appropriate classification.
 1)
r = 2:{x _{21}},{x _{1}–x _{20}, x _{22}–x _{50}}.
 2)
r = 6:{x _{21}},{x _{34}},{x _{29}, x _{49}},{x _{6}},{x _{4}},{x _{1}–x _{3}, x _{5}, x _{7}–x _{20}, x _{22}–x _{28}, x _{30}–x _{33}, x _{35}–x _{48}, x _{50}}.
 3)
r = 7:{x _{21}},{x _{34}},{x _{29}, x _{49}},{x _{6}}, {x _{4}},{x _{47}},{x _{1}–x _{3}, x _{5}, x _{7}–x _{20},_{,} x _{22}–x _{28}, x _{30}–x _{33}, x _{35}–x _{46}, x _{48}, x _{50}}.
 4)
r = 14:{x _{21}}.{x _{34}}.{x _{29}, x _{49}},{x _{6}},{x _{4}},{x _{47}},{x _{50}},{x _{38}},{x _{23}, x _{43}},{x _{14}, x _{41}},{x _{8}},{x _{7}},{x _{3}},{x _{1}, x _{2}, x _{5}, x _{9}–x _{13}, x _{15}–x _{20}, x _{22}, x _{24}–x _{28}, x _{30}–x _{33}, x _{35}–x _{37}, x _{39}–x _{40}, x _{42}, x _{44}–x _{46}, x _{48}}.
 5)
r = 16:{x _{21}},{x _{34}},{x _{29},x _{49}},{x _{6}},{x _{4}},{x _{47}},{ x _{50}},{ x _{38}},{ x _{23}, x _{43}},{ x _{14}, x _{41}},{ x _{8}},{ x _{7}},{ x _{3}},{ x _{12}, x _{27}}, { x _{9}},{ x _{1}, x _{2},x _{5}, x _{10}–x _{11}, x _{13}, x _{15}–x _{20}, x _{22}, x _{24}–x _{26}, x _{28}, x _{30}–x _{33}, x _{35}–x _{37}, x _{39}, x _{40}, x _{42}, x _{44}–x _{46}, x _{48}}.
5.3 Clustering effect test and result analysis
 1)
If r = 2, then n _{1} = 1, n _{2} = 49, we can obtain F _{2} = 58.457 %
 2)
If r = 6, then n _{1} = 1, n _{2} = 1, n _{3} = 2, n _{4} = 1, n _{5} = 1, n _{6} = 44, F _{6} = 76.111 % can be computed.
 3)
If r = 14,then n _{1} = 1, n _{2} = 1, n _{3} = 2, n _{4} = 1, n _{5} = 1, n _{6} = 1, n _{7} = 1, n _{7} = 1, n _{8} = 1, n _{9} = 2, n _{10} = 2, n _{11} = 1, n _{12} = 1, n _{13} = 1, n _{14} = 33, we can derive F _{14} = 58.441 %.
 4)
If r = 16, n _{1} = 1, n _{2} = 1, n _{3} = 2, n _{4} = 1, n _{5} = 1, n _{6} = 1, n _{7} = 1, n _{7} = 1, n _{8} = 1, n _{9} = 2, n _{10} = 2, n _{11} = 1, n _{12} = 1, n _{13} = 1, n _{14} = 2, n _{15} = 1, n _{16} = 30, F _{16} = 61.236 % can be obtained.
From above data, we can get F6 > F16 > F2 > F14, so dividing into six categories is the best classification method.
When 50 users are divided into six classes, sentiment tendency graph of each user is shown in Fig. 2.
6 Application examples
 (1)Sentiment analysis of Tencent QQ space users
 (a)
Collect the news sent by 15 QQ users in 10 different time periods
 (b)
For the selected time period, the period of time is adjustable; for highly active users, a short time interval can be selected; on the contrary, for low active users, a longer time interval can be selected, and if there exist a number of news in each time, take the average of the news as the value of news. If there is no published news, let the value of news be 0
 (c)
Calculate emotional value of 15 QQ users in 10 different time periods with emotional Chinese text calculation method mentioned above to construct a dynamic fuzzy clustering map
The dynamic fuzzy clustering map shows some samples relatively belonging to a certain class in some extent, which can be used to make appropriate decisions according to their own preferences by users and to forecast users’ emotional trend with the curve fitting method and take appropriate preventive measures for some emotional extreme or abnormal people, to promote social harmony, stability, and development.
 (a)
 (2)
Sentiment analysis of microblog Sina user
There are three steps as follows: (a)
Design of microblog Sina data acquisition system
After investigating and analyzing API of microblog Sina open platform, we obtain HTML structure of the microblog and parse microblog news. Next, using web crawler technology, according to news features of microblog Sina, web crawler data acquisition system for microblog Sina is designed and implemented.
 (b)
The construction process of microblog the emotion lexicon
We calculate emotional intensity (weights) of the basic emotional words and construct a basic emotion lexicon with Hownetbased word similarity computation method; finally, the network emotion lexicon and microblog emotion lexicon are obtained.
 (c)
Classification analysis of microblog user emotions
The numerical value of emotional information is defined as the range of [−1.1], and when the emotional value is greater than 0, the user’s emotion is taken as the positive emotion, on the contrary, the emotional value which is less than 0 was for the negative emotions. Then, the fuzzy clustering algorithm is used to cluster the emotional values, and emotional value of the whole blog information is calculated based on the emotional words with modifiers and other factors. Next, emotional values of 50 users in 10 time periods are selected to make emotion classification analysis for microblog users by using the fuzzy clustering algorithm, and F testing method is used to calculate an optimal classification. Finally, we predict the classification results with SPSS tool and generate emotion chart to understand more intuitively the user’s emotional state.
 (a)
7 Conclusions
Sentiment analysis has become the inevitable trend of big data development. Quantizing the human’s emotion to enable computer to identify and analysis automatically has become one of the most important hot research topics of many scholars. In the paper, fuzzy clustering algorithm is applied to analyze emotional change of Sina microblog users. Firstly, sentiment intensity of text information issued by microblog users is analyzed. Next, combined with sentiment words and influence of modifiers on sentiment intensity, sentiment value of the whole text is calculated. Finally, Fuzzy clustering algorithm is used to analyze sentiment classification of microblog users, and classification result is forecasted with tools such as SPSS, and sentiment trend charts are generated to understand users’ emotion state more intuitively. The research provides an important basis for decisionmaking to relevant research departments.
Declarations
Acknowledgements
This work was supported by National Natural Science Foundation Project under grants 61175122, as well as by the Applied Basic Research Project of Sichuan province of China (2013JY0134) and by Key Project of Sichuan Educational Commission (No. 15ZA0049).
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), 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
References
 F Liu, W Xian, Microblog builds a new platform for mobile learning. China Educ. Technol. Equip. 26 (36), 26–27 (2012).Google Scholar
 X Song, 5W features analysis in microblog. J CHIFENG Univ. 29 (1), 96:98 (2013).Google Scholar
 H Wang et al., Literature review of sentiment classification on Web text. J. Chin. Soc. Sci. Tech. Inf. 29 (5), 931–938 (2010).Google Scholar
 Y Zhao, B Qin, T Liu, Sentiment analysis on text. J. Softw. 21(8), 1834–1848 (2010)View ArticleGoogle Scholar
 A Go, R Bhayani, L Huang, Twitter sentiment classification using distant supervision. Cs224n Project Report, 2009, pp. 1–12Google Scholar
 B O'Connor, R Balasubramanyan, BR Routledge, NA Smith, From Tweets to Polls: Linking Text Sentiment to Public Opinion Time Series, Conference: Proceedings of the Fourth International Conference on Weblogs and Social Media, 2010, pp. 122–129Google Scholar
 A Pak, P Paroubek, Twitter as a Corpus for Sentiment Analysis and Opinion Mining[C]//Seventh Conference on International Language Resources and Evaluation, 2010Google Scholar
 A Bifet, E Frank, Sentiment knowledge discovery in Twitter streaming data. Lect. Notes Comput.Sci. 6332, 1–15 (2010)View ArticleGoogle Scholar
 D Davidov, O Tsur, A Rappoport, Enhanced Sentiment Learning Using Twitter Hashtags and Smileys. International Conference on Computational Linguistics: Posters, 2010, pp. 241–249Google Scholar
 CX Lin et al., PET: A Statistical Model for Popular Events Tracking in Social Communities. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010, pp. 929–938Google Scholar
 A Celikyilmaz, D HakkaniTur, J Feng, Probabilistic ModelBased Sentiment Analysis of Twitter Messages. Spoken Language Technology Workshop (SLT), 2010 IEEE IEEE, 2010, pp. 79–84View ArticleGoogle Scholar
 L Barbosa, J Feng, Robust Sentiment Detection on Twitter from Biased and Noisy Data. 23rd International Conference on Computational Linguistics, vol. 23, 2010, pp. 36–44Google Scholar
 J Bollen, A Pepe, H Mao, Modeling public mood and emotion: Twitter sentiment and socioeconomic phenomena. Biochem. Pharmacol. 44(12), 2365–2370 (2010)Google Scholar
 L Jiang, M Yu, M Zhou et al., TargetDependent Twitter Sentiment Classification: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, vol. 1, 2011, pp. 151–160Google Scholar
 L Zhang et al., Combining LexiconBased and Learningbased Methods for Twitter Sentiment Analysis. HP Laboratories Technical Report, 2011Google Scholar
 M E Hoque, D J McDuff, R W Picard, Exploring temporal patterns in classifying frustrated and delighted smiles. IEEE Trans Affect Comput. 3(3),323334 (2012).Google Scholar
 DJ McDuff, R el Kaliouby, RW Picard, Crowdsourcing facial responses to online videos. IEEE Trans. Affect. Comput. 3(4), 456–468 (2012)View ArticleGoogle Scholar
 DN Trung et al., “Towards Modeling Fuzzy Propagation for Sentiment Analysis in Online Social Networks: A Case Study on TweetScope.” Cognitive Infocommunications (CogInfoCom), 2013 IEEE 4th International Conference on IEEE, 2013, pp. 331–338View ArticleGoogle Scholar
 S Venkatesh, D Phung, D Bo, M Berk, Affective and content analysis of online depression communities. IEEE Trans. Affect. Comput. 5(3), 217–226 (2014)View ArticleGoogle Scholar
 TH Nguyena, K Shiraia, J Velcinb, Sentiment analysis on social media for stock movement prediction. Expert Syst. Appl. 42, 9603–9611 (2015)View ArticleGoogle Scholar
 DN Trung, JJ Jung, Sentiment analysis based on fuzzy propagation in online social networks: a case study on TweetScope. Comput Sci. Inf. Syst. 11(1), 215–228 (2014)View ArticleGoogle Scholar
 W Xing, Z Shaojian, Chinese text sentiment analysis utilizing emotion degree lexicon and fuzzy semantic model. Int. J. Softw. Sci. Comput. Intell. 6(4), 20–32 (2014)View ArticleGoogle Scholar
 Z Wang et al., Issues of Social Data Analytics with a New Method for Sentiment Analysis of Social Media Data, Cloud Computing Technology and Science (CloudCom), 2014 IEEE 6th International Conference on IEEE, 2014, pp. 899–904Google Scholar
 MD Munezero, CS Montero, E Sutinen, J Pajunen, Are they different? Affect, feeling, emotion, sentiment, and opinion detection in text. IEEE Trans. Affect. Comput. 5(2), 101–111 (2014)View ArticleGoogle Scholar
 H I Ahn, R W Picard, Measuring affectivecognitive experience and predicting market success. IEEE Trans. Affect. Comput. 5(2):173186 (2014).Google Scholar
 F SantosSanchez, A MendezVazquez, “Sentiment Analysis for eServices.” Advanced Applied Informatics (IIAIAAI), 2014 IIAI 3rd International Conference on IEEE, 2014, pp. 42–47Google Scholar
 A Pappurajan, SP Victor, Web sentiment analysis for scoring positive or negative words using Tweeter data. Int. J. Comput. Appl. 96(6), 33–37 (2014)Google Scholar
 A Hogenboom et al., Lexiconbased sentient analysis by mapping conveyed sentiment to intended sentiment. Int. J. Web Eng. Technol. 9, 125–147 (2014)View ArticleGoogle Scholar
 RF Martins, A Pereira, F Benevenuto, “An Approach to Sentiment Analysis of Web Applications in Portuguese.” Proceedings of the 21st Brazilian Symposium on Multimedia and the Web ACM, 2015, pp. 105–112Google Scholar
 C Clavel, Z Callejas, Sentiment analysis: from opinion mining to humanagent interaction. IEEE Trans. Affect. Comput. 7(1), 74–93 (2016)View ArticleGoogle Scholar
 Z Xu et al., Knowle: a semantic link network based system for organizing large scale online news events. Future Generation Comput. Syst. 43–44, 40–50 (2015)View ArticleGoogle Scholar
 Z Xu et al., Crowdsourcing based social media data analysis of urban emergency events. multimedia tools Appl. DOI:10.1007/s1104201527311. (2015)
 Z Xu et al., Crowdsourcing based description of urban emergency events using social Media big data. IEEE Trans. Cloud Comput. DOI:10.1109/TCC.2016.2517638.(2016)
 Z Xu et al., Participatory sensing based semantic and spatial analysis of urban emergency events using mobile social media. EURASIP J. Wireless Commun. Netw. 44, 2016 (2016)Google Scholar
 Z Xu et al., Building knowledge base of urban emergency events based on crowdsourcing of social media. Concurrency Comput. Pract. Exp. DOI:10.1002/cpe.3780. (2016)