<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JCC</journal-id><journal-title-group><journal-title>Journal of Computer and Communications</journal-title></journal-title-group><issn pub-type="epub">2327-5219</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jcc.2015.35024</article-id><article-id pub-id-type="publisher-id">JCC-56620</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Big Data Stream Analytics for Near Real-Time Sentiment Analysis
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Otto</surname><given-names>K. M. Cheng</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Raymond</surname><given-names>Lau</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Information Systems, City University of Hong Kong, Hong Kong, China</addr-line></aff><pub-date pub-type="epub"><day>25</day><month>05</month><year>2015</year></pub-date><volume>03</volume><issue>05</issue><fpage>189</fpage><lpage>195</lpage><history><date date-type="received"><day>April</day>	<month>2015</month>	</date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
   In the era of big data, huge volumes of data are generated from online social networks, sensor networks, mobile devices, and organizations’ enterprise systems. This phenomenon provides organizations with unprecedented opportunities to tap into big data to mine valuable business intelligence. However, traditional business analytics methods may not be able to cope with the flood of big data. The main contribution of this paper is the illustration of the development of a novel big data stream analytics framework named BDSASA that leverages a probabilistic language model to analyze the consumer sentiments embedded in hundreds of millions of online consumer reviews. In particular, an inference model is embedded into the classical language modeling framework to enhance the prediction of consumer sentiments. The practical implication of our research work is that organizations can apply our big data stream analytics framework to analyze consumers’ product preferences, and hence develop more effective marketing and production strategies. 
 
</p></abstract><kwd-group><kwd>Big Data</kwd><kwd> Data Stream Analytics</kwd><kwd> Sentiment Analysis</kwd><kwd> Online Review</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>In the era of the Social Web, user-contributed contents have become the norm. The amounts of data produced by individuals, business, government, and research agents have been undergoing an explosive growth―a phenomenon known as the data deluge. For individual social networking, many online social networking sites have between 100 and 500 million users. By the end of 2013, Facebook and Twitter had 1.23 and 0.64 billion active users, respectively. The number of friendship edges of Facebook is estimated to be over 100 billion. The stream of huge amounts of user-contributed contents, such as online consumer reviews, online news, personal dialogs, search queries, and so on, have called for the research and development of a new generation of analytics methods and tools to effectively process them, preferably in real-time or near real-time. Big data is often characterized by three dimensions, named the 3 V’s: Volume, Velocity, and Variety [<xref ref-type="bibr" rid="scirp.56620-ref1">1</xref>]. Currently, there are two common approaches to deal with big data, namely batch-mode big data analytics and streaming-based big data analytics.</p><p>Most data originally produced from the Social Web is streaming data. For example, the data representing actions and interactions among individuals in online social media, or the data denoting some events captured by sensor networks is the typical kind of streaming data. Other types of big data perhaps are just a snapshot view of the streaming data generated from a specific point of time. The distinguished characteristic of a big data stream is that data continuously arrive at high speed. Accordingly, effective big data stream analytics methods should process the streaming data in one go, and under very strict constraints of space and time. Currently, research about big data analytics algorithms often focuses on processing big data in batch mode, while algorithms designed to process big data stream in real-time or near real-time are not abundant.</p><p><xref ref-type="fig" rid="fig1">Figure 1</xref> depicts a taxonomy of the common approaches (tools) for processing big data. Big data analytics approaches can be generally divided into distributed or single host approaches. For distributed big analytics methods, there can be then further classified into batch mode processing or streaming mode processing. Even though batch mode big data analytics methods (e.g., MapReduce) are the current dominated method, online incremental algorithms that can effectively process continuous and evolving data stream are desirable to address both the “volume” and the “velocity” issue of big data pasted on online social media. MapReduce and big data stream analytics are two different classes of analytical approaches although they are related for certain theoretical perspectives. Recently, researchers and practitioners have tried to integrate streaming-based analytics and online computation on top of the MapReduce batch mode analytics framework. Sample tools of that kind include the Hadoop Online Prototype. However, more research should be conducted for the development of next generation of big data stream analytics methods that inherit the merits from both batch mode analytics and streaming analytics.</p><p>The main contribution of this paper is the design and development of a novel big data stream analytics framework that provides the essential infrastructure to operationalize a probabilistic language modeling approach for near real-time consumer sentiment analysis. There is significant research and practical value of our work because organizations can apply our framework to better leverage the collective social intelligence to develop effective marketing and product design strategies. As a result, these organizations become more competitive in the global marketplace, which is one of the original promises of big data analytics.</p><p>With the rapid growth of the Social Web, increasingly more Web users have posted and extracted viewpoints about products, people, or political issues via a variety of online social media such as Blogs, forums, chat-rooms, and social networks. The big volume of user-contributed contents opens the door for automated extraction and analysis of the sentiments or emotions referring to the underlying entities such as consumer products. Sentiment analysis is also referred to as opinion analysis, subjectivity analysis, or opinion mining [<xref ref-type="bibr" rid="scirp.56620-ref2">2</xref>] [<xref ref-type="bibr" rid="scirp.56620-ref3">3</xref>]. Sentiment analysis aims to extract subjective feelings about some subjects rather than simply extracting the objective facets about these subjects [<xref ref-type="bibr" rid="scirp.56620-ref4">4</xref>]. Analyzing the sentiments of messages posted to social networks or online forums can generate countless business values for the organizations which aim to extract timely business intelligence about how their products or services are perceived by their customers [<xref ref-type="bibr" rid="scirp.56620-ref5">5</xref>]. Other possible applications of sentiment analysis include the analysis of the propaganda and activities of cybercriminal groups who pose serious threats to business or government owned web sites [<xref ref-type="bibr" rid="scirp.56620-ref2">2</xref>].</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title>A taxonomy of big data analytics approaches</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/56620x3.png"/></fig><p>Sentiment analysis can be applied to a phrase, a sentence, or an entire message [<xref ref-type="bibr" rid="scirp.56620-ref4">4</xref>]. Most of the existing sentiment analysis methods can be divided into two main camps. The first common paradigm utilizes a sentiment lexicon or heuristic rules as the knowledge base to locate opinionated expressions and predict the polarity of these opinioned expressions [<xref ref-type="bibr" rid="scirp.56620-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.56620-ref6">6</xref>]. The second common approach of sentiment analysis is based on statistical learning methods [<xref ref-type="bibr" rid="scirp.56620-ref4">4</xref>]. Nevertheless, each camp has its own limitations. For instance, for the lexicon-based methods, common sentiment lexicons may not be able to detect the context-sensitive nature of opinion expressions. For example, while the term “small” may have a negative polarity in a hotel review that refers to a “small” hotel room, the same term could have a positive polarity such as “a small and handy notebook” in consumer reviews about computers. In fact, the token “small” is defined as a negative opinion word in the well-known OpinionFinder sentiment lexicon.</p><p>In contrast, statistical learning techniques such as supervised machine learning method usually requires a large number of labeled training cases in order to build an effective classifier to identify the polarity of opinionated expressions. Unfortunately, it is not practical to assume the availability of a large number of human labeled training examples, particularly in a big data environment. On the other hand, both approaches may not be scale up to analyze a huge number of opinioned expressions as found in nowadays Social Web. There is an obvious research gap to develop new methods to be able to analyze big social media data in real-time or near real-time by leveraging a parallel and distributed system architecture. Our research work reported in this paper just tries to fill such a research gap.</p><p>The business implication of our research is that business managers and product designers can apply the proposed big data stream analytics framework to more effectively and promptly analyze the consumer sentiments embedded in online consumer reviews. As a result, proactive marketing or product design strategies can be developed to enhance the business operations and the competitive power of the corresponding firms. Moreover, third-party reputation monitoring agencies can apply the proposed framework to continuously monitor the sentiments toward the targeted products and services, and extract appropriate social intelligence from online social media in near real-time.</p></sec><sec id="s2"><title>2. The Big Data Stream Analytics Framework</title><p>An overview of the proposed framework that leverages Big Data Stream Analytics for online Sentiment Analysis (BDSASA) is depicted in <xref ref-type="fig" rid="fig2">Figure 2</xref>. The BDSASA framework consists of seven layers, namely data stream layer, data pre-processing layer, data mining layer, prediction layer, learning and adaptation layer, presentation layer, and storage layer. For these layers, we will apply sophisticated and state-of-the-art techniques for rapid service prototyping. For instance, Storm, the open-source Distributed Data Stream Engine (DDSE) for big data is applied to process streaming data fed from dedicated APIs and crawlers at the Data Stream Layer. For instance, the Topsy API is used to retrieve product related comments from Twitter.</p><p>The Storage Layer leverages Apache HBase and HDFS for real-time storage and retrieval of big volume of consumer reviews discussing products and services. The Stanford Dependency Parser and the GATE NER module [<xref ref-type="bibr" rid="scirp.56620-ref7">7</xref>] are applied to build the Data Pre-processing Layer. Our pilot tests show that the size of the multilingual social media data streams is within the range between 0.2 and 0.4 Gigabytes on a daily basis, and this volume is steadily growing. For the feature extraction layer, the Affect Miner utilizes a novel community-based affect intensity measure to predict consumers’ moods towards products. Among the big six classes i.e., anger, fear, happiness, sadness, surprise, and neutral commonly used in affect analysis, we focus on the anger, fear, sadness, and happiness classes relevant for product sentiment analysis. The WordNet-Affect lexicon [<xref ref-type="bibr" rid="scirp.56620-ref8">8</xref>] extended by a statistical learning method is used by the Affect Miner. Since social media messages are generally noisy, one novelty of our framework is that we reduce the noise of the “affect intensity” measure by processing messages really related to consumers’ comments about products or services.</p><p>Previous research employed the HMM method to mine the latent “intents” of actors [<xref ref-type="bibr" rid="scirp.56620-ref9">9</xref>]. We exploit a novel and more sophisticated online generative model and the corresponding distributed Gibbs sampling algorithm to build our Latent Intent Extractor that predicts the intents of consumers for potential product or service acquisitions. The Sentiment Extractor utilizes well-known sentiment lexicons such as OpinionFinder to extract the sentiment words embedded in consumer reviews. Finally, overall sentiment polarity prediction for consumer reviews is performed based on a novel inferential language modeling method. The computational details of this inferential language modeling method for context-sensitive sentiment analysis will be explained in the next section. The overall sentiment polarity against a product or a product category is communicated to the user of the</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title>An overview of the BDSASA framework</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/56620x4.png"/></fig><p>system via the presentation layer. Different modes of presentations (e.g., text, graphics, multimedia on desktops or mobile devices) are supported by our framework.</p><p>In addition, a novel parallel co-evolutionary genetic algorithm (PCGA) is designed so that the proposed prediction model is equipped with a learning and adaptation mechanism that continuously tunes the whole service with respect to possibly changing features of the problem domain. The PCGA can divide a large search space into some subspaces for a parallel and diversified search, which improves both the efficiency and the effectiveness of the heuristic search process. Each subspace (i.e., a sub-population) is hosted by a separate cluster. Three fundamental decisions are involved for the design a genetic algorithm (GA), that is, a fitness function, chromosome encoding, and a procedure that drives the evolution process of chromosomes [<xref ref-type="bibr" rid="scirp.56620-ref10">10</xref>]. First, the fitness function of our PCGA is developed based on a performance metric (e.g., accuracy of sentiment polarity prediction). Second, since various components of the proposed service should be continuously refined, there are multiple sub-populations of chromosomes to be encoded and co-evolved simultaneously. During each evolution cycle, the best chromosome of a sub-population (e.g., prediction features, social media sources, system parameters) is exchanged with that of other sub-populations. Armed with all the essential information, each chromosome of a sub-population represents a feasible prediction, and its fitness can be assessed accordingly.</p></sec><sec id="s3"><title>3. Probabilistic Language Modeling for Sentiment Analysis</title><p>Originally, the term “language model” has been widely explored in the speech recognition community, and it refers to a probability distribution which represents the statistical regularities for the generation of a language [<xref ref-type="bibr" rid="scirp.56620-ref11">11</xref>]. In other words, a language model is a probabilistic function that assigns a probability mass to a string drawn from some vocabulary. In the context of Information Retrieval (IR), a language model <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x5.png" xlink:type="simple"/></inline-formula> is used to estimate the probability that a document <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x6.png" xlink:type="simple"/></inline-formula> generates a query <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x7.png" xlink:type="simple"/></inline-formula> [<xref ref-type="bibr" rid="scirp.56620-ref12">12</xref>]. In particular, such a probabilistic inference is used to mimic the concept of document “relevance” of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x8.png" xlink:type="simple"/></inline-formula> respect to<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x9.png" xlink:type="simple"/></inline-formula>. The basic unigram language model is defined according to the following formulas [<xref ref-type="bibr" rid="scirp.56620-ref12">12</xref>] [<xref ref-type="bibr" rid="scirp.56620-ref13">13</xref>]:</p><disp-formula id="scirp.56620-formula318"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/56620x10.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.56620-formula319"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/56620x11.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.56620-formula320"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/56620x12.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x13.png" xlink:type="simple"/></inline-formula> is the language model of the document<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x14.png" xlink:type="simple"/></inline-formula>. With Jelinek-Mercer smoothing [<xref ref-type="bibr" rid="scirp.56620-ref13">13</xref>], the probability of the document generating a query term <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x15.png" xlink:type="simple"/></inline-formula> (i.e.,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x16.png" xlink:type="simple"/></inline-formula>) is estimated according to the maximum likelihood model<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x17.png" xlink:type="simple"/></inline-formula>, and the maximum likelihood model of the entire collection<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x18.png" xlink:type="simple"/></inline-formula>. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x19.png" xlink:type="simple"/></inline-formula>is the Jelinek-Mercer smoothing parameter [<xref ref-type="bibr" rid="scirp.56620-ref13">13</xref>]. The smoothing process is used to alleviate the problem of over-estimat- ing the probabilities for query terms found in a document and the problem of under-estimating the probabilities for terms not found in the document. The function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x19.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x20.png" xlink:type="simple"/></inline-formula> returns the term frequency of term <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x19.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x21.png" xlink:type="simple"/></inline-formula> in the document<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x19.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x22.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x19.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x23.png" xlink:type="simple"/></inline-formula> is the document length measured by the number of tokens contained in the document.</p><p>However, previous studies found that applying the probabilities of query related terms of a relevant context instead of the probabilities of the individual query terms estimated based on the entire document collection (i.e., a general product review context) to a document language model will lead to a more effective smoothing process, and hence lead to good IR performance [<xref ref-type="bibr" rid="scirp.56620-ref14">14</xref>]. Following the similar kind of idea, we develop an inferential language model to compute the probability that a document <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x24.png" xlink:type="simple"/></inline-formula> (e.g., a product review) will generate a term <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x25.png" xlink:type="simple"/></inline-formula> found in a Sentiment Lexicon (SL). In order to ensure a more robust and effective smoothing process, the inferential language model can take into account terms (opinion evidences) associated with the opinion indicators in a relevant online review context. In particular, the associated opinion evidences are discovered based on the context-sensitive text mining process over an online review context. The inferential language model for context-sensitive opinion scoring is then defined as follows.</p><disp-formula id="scirp.56620-formula321"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/56620x26.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.56620-formula322"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/56620x27.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.56620-formula323"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/56620x28.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x29.png" xlink:type="simple"/></inline-formula> is the document language model for estimating the probabilities that the document <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x30.png" xlink:type="simple"/></inline-formula> will generates the opinion indicators defined in a sentiment lexicon (SL). However, to address the common problem that sentiment lexicons may not capture all possible sentiments of a problem domain (e.g., context-sensitive opinion evidences are missing), the proposed language model can take into account other opinion evidences contained in the document by means of the inferential language model<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x31.png" xlink:type="simple"/></inline-formula>. The set of context-sensitive opinion evidences <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x32.png" xlink:type="simple"/></inline-formula> is dynamically generated according to a context-sensitive text mining technique.</p><p>The term association (term inference) of the form <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula> is applied to the inferential language model to compute the probability that a document generates a term (e.g., an opinion indicator) which is contextually associated with another opinion indicator captured in a sentiment lexicon [<xref ref-type="bibr" rid="scirp.56620-ref15">15</xref>]. For easy of implementation, we only include the top <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula> term associations captured in <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula> for each opinion indicator<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x36.png" xlink:type="simple"/></inline-formula>. It should be noted that the inference that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x37.png" xlink:type="simple"/></inline-formula> generating <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x38.png" xlink:type="simple"/></inline-formula> involves a certain degree of uncertainty. As a result, the maximum likelihood estimation of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x39.png" xlink:type="simple"/></inline-formula> is moderated by a factor<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x40.png" xlink:type="simple"/></inline-formula>. The hyperbolic tangent function is applied to moderate the probability function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/56620x41.png" xlink:type="simple"/></inline-formula> such that its values fall in the unit interval.</p></sec><sec id="s4"><title>4. Discussions and Summary</title><p>While some research work has been devoted to big data analytics recently, very few studies about big data stream analytics are reported in the literature. The main theoretical contributions of our research include the design and development of a novel big data stream analytics framework, named BDSASA for the near real-time analysis of consumer sentiments. Another main contribution of this paper is the illustration of a probabilistic inferential language model for analyzing the sentiments embedded in an evolving big data stream generated from online social media. The business implication of our research is that business managers and product designers can apply the proposed big data stream analytics framework to more effectively analyze and predict consumers’ preferences about products and services. Accordingly, they can take proactive business strategies to streamline the marketing or product design operations.</p><p>One limitation of our current work is that the proposed framework has not been tested under an empirical setting. We will devote our future effort to evaluating the effectiveness and efficiency of the BDSASA framework based on realistic consumer reviews and social media messages collected from the Web. On the other hand, we will continue to refine the proposed inferential language model for better sentiment polarity prediction. For instance, a consumer may connect to other consumers via a social network. We may incorporate such connection features in the inferential language model when the sentiment polarity of a review is analyzed. Moreover, the prediction thresholds for probabilistic opinion scoring will be fine-tuned using the proposed PCGA. Finally, we will conduct a usability study for the proposed big data stream analytics service in a real-world e-Business environment.</p></sec><sec id="s5"><title>Acknowledgements</title><p>This research work was partially supported by a grant from the Shenzhen Municipal Science and Technology R &amp; D Funding―Basic Research Program (project number: JCYJ20130401145617281 and project number: JCYJ20140419115614350).</p></sec><sec id="s6"><title>Cite this paper</title><p>Otto K. M. Cheng,Raymond Lau, (2015) Big Data Stream Analytics for Near Real-Time Sentiment Analysis. Journal of Computer and Communications,03,189-195. doi: 10.4236/jcc.2015.35024</p></sec></body><back><ref-list><title>References</title><ref id="scirp.56620-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Boden, C., Karnstedt, M., Fernandez, M. and Markl, V. (2013) Large-Scale Social-Media Analytics on Stratosphere. Proceedings of the 22nd International Conference on World Wide Web Companion, 257-260.</mixed-citation></ref><ref id="scirp.56620-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Lau, R.Y.K., Xia, Y. and Ye, Y. (2014) A Probabilistic Generative Model for Mining Cybercriminal Networks from Online Social Media. IEEE Computational Intelligence Magazine, 9, 31-43.  
http://dx.doi.org/10.1109/MCI.2013.2291689</mixed-citation></ref><ref id="scirp.56620-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Turney, P.D. and Littman, M.L. (2003) Measuring Praise and Criticism: Inference of Semantic Orientation from Association. ACM Transactions on Information Systems, 21, 315-346. http://dx.doi.org/10.1145/944012.944013</mixed-citation></ref><ref id="scirp.56620-ref4"><label>4</label><mixed-citation publication-type="book" xlink:type="simple">Wilson, T., Wiebe, J. and Rwa, R. (2004) Just How Mad Are You? Finding Strong and Weak Opinion Clauses. In: McGuinness, D.L. and Ferguson, G., Eds., Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, San Jose, 25-29 July 2004, 761-769.</mixed-citation></ref><ref id="scirp.56620-ref5"><label>5</label><mixed-citation publication-type="book" xlink:type="simple">Archak, N., Ghose, A. and Ipeirotis, P.G. (2007) Show Me the Money!: Deriving the Pricing Power of Product Features by Mining Consumer Reviews. In: Berkhin, P., Caruana, R. and Wu, X., Eds., Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, 12-15 August 2007, 56-65.  
http://dx.doi.org/10.1145/1281192.1281202</mixed-citation></ref><ref id="scirp.56620-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Turney, P.D. (2002) Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews. Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, 417-424.</mixed-citation></ref><ref id="scirp.56620-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Maynard, D., Tablan, V., Ursu, C., Cunningham, H. and Wilks, Y. (2001) Named Entity Recognition from Diverse Text Types. Proceedings of the 2001 Conference on Recent Advances in Natural Language Processing, Tzigov Chark, Bulgaria.</mixed-citation></ref><ref id="scirp.56620-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Valitutti, A., Strapparava, C. and Stock, O. (2004) Developing Affective Lexical Resources. Psychology, 2, 61-83.</mixed-citation></ref><ref id="scirp.56620-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, Q., Man, D. and Wu, Y. (2009) Using HMM for Intent Recognition in Cyber Security Situation Awareness. Proceedings of the Second IEEE International Symposium on Knowledge Acquisition and Modeling, 166-169.  
http://dx.doi.org/10.1109/kam.2009.315</mixed-citation></ref><ref id="scirp.56620-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Lau, R.Y.K., Tang, M., Wong, O., Milliner, S. and Chen, Y. (2006) An Evolutionary Learning Approach for Adaptive Negotiation Agents. International Journal of Intelligent Systems, 21, 41-72. http://dx.doi.org/10.1002/int.20120</mixed-citation></ref><ref id="scirp.56620-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Nadas, A. (1984) Estimation of Probabilities in the Language Model of the IBM Speech Recognition System. IEEE Transactions on Acoustics, Speech and Signal Processing, 32, 859. http://dx.doi.org/10.1109/TASSP.1984.1164378</mixed-citation></ref><ref id="scirp.56620-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Ponte, J.M. and Croft, W.B. (1998) A Language Modeling Approach to Information Retrieval. Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 275-281. 
http://dx.doi.org/10.1145/290941.291008</mixed-citation></ref><ref id="scirp.56620-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Zhai, C.X. and Lafferty, J. (2004) A Study of Smoothing Methods for Language Models Applied to Information Retrieval. ACM Transactions on Information Systems, 22, 179-214. http://dx.doi.org/10.1145/984321.984322</mixed-citation></ref><ref id="scirp.56620-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Nie, J.-Y., Cao, G.H. and Bai, J. (2006) Inferential Language Models for Information Retrieval. ACM Transactions on Asian Language Information Processing, 5, 296-322. http://dx.doi.org/10.1145/1236181.1236183</mixed-citation></ref><ref id="scirp.56620-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Lau, R.Y.K., Song, D., Li, Y., Cheung, C.H. and Hao, J.X. (2009) Towards a Fuzzy Domain Ontology Extraction Method for Adaptive E-Learning. IEEE Transactions on Knowledge and Data Engineering, 21, 800-813. 
http://dx.doi.org/10.1109/TKDE.2008.137</mixed-citation></ref></ref-list></back></article>