Skip to main content

Sentiment analysis of online product reviews using DLMNN and future prediction of online product using IANFIS


A major task that the NLP (Natural Language Processing) has to follow is Sentiments analysis (SA) or opinions mining (OM). For finding whether the user’s attitude is positive, neutral or negative, it captures each user’s opinion, belief, and feelings about the corresponding product. Through this, needed changes can well be done on the product for better customer contentment by the companies. Most of the existent techniques on SA aimed at these online products have extremely low accuracy and also encompassed more time amid training. By employing a Deep learning modified neural network (DLMNN), a technique is proposed aimed at SA of online products review; in addition, via Improved Adaptive Neuro-Fuzzy Inferences System (IANFIS), a technique is proposed aimed at future prediction of online products to trounce the above-stated issues. Firstly, the data values are separated into Contents-based (CB), Grades-based (GB), along with Collaborations based (CLB) setting as of the dataset. Then, each setting goes via review analysis (RA) by employing DLMNN, which renders the results as negative, positive, in addition to neutral reviews. IANFIS carry out a weighting factor and classification on the product for upcoming prediction. In the experimental assessment, the proposed work gave an enhanced performance compared to the existing methods.


Since, there are numerous brands that are present in the market; selecting one will be a tough task for a consumer. The advancement of E-Commerce influences the buying routine of customers. Buyers make the desired decision centered on the reviews present in E-commerce (i.e. the ratings and summary of relevant text about the items can well be utilized aimed at decision making [1]). Along with it, the reviews for the product can as well be seen in Social networking sites [2]. In present years, social networks have turned very popular; so there is a chance that because of those sites, the expansion of data can be uncontrollable in the future [3, 4]. Since, everyone is posting comments every day, which led to the immense continuous augmentation in the online data and online information. Thus, it is really hard to accurately extract relevant information as of the internet [5]. The customers together with manufacturers will attain as of analyzing the positive along with the negative sentiments regarding every product that can well be attained via SA. SA stands as chief tasks in NLP [6,7,8]. By employing SA, the mood or attitude of the critic can well be determined as negative or positive [9]. In SA, all product reviews to be summarized and sentiments are to be classified.

SA stands as a field that evaluates the people’s opinions, evaluations, sentiments, attitudes, appraisals, as well as the emotion that they encompass on entities cherish products, organizations, services, and people [10, 11]. The links between SA and product design stay comparatively uncharted regardless of the swift advancements of SA in other fields. The primary aim of SA is to recognize the data’s polarity on the Web and then to classify them. SA is text centered analysis; however there are particular challenges to discover the precise polarity of the sentence. The SA encompasses ‘3’ stages: (i) document, (ii) sentence and (iii) aspect-level [12]. In sentence level, the document SA checks the entire document and categories the opinion as negative, positive or neutral (i.e. a single document might encompass manifold opinions even concerning the same entities [13]). The aspect level finds the target of the opinion indicating that every opinion has a target. The bag-of-words for SA wherein the relationships among words were not considered and a document is nothing but a compilation of words [14]. There are ‘2’ sorts of methods for SA: (i) semantic orientation, (ii) statistical Machine Learning (ML) approach. The former approach ascertains the document’s sentiment grounded upon the extracted sentimental words as well as phrases. In addition, the latter focuses upon the document’s sentiment grounded on the extracted sentimental features as well as the ML. The statistical one overcomes the semantic scheme regarding SA accuracy [15]. Semantic word spaces are extremely valuable; however, it can’t articulate the meaning of lengthy sentences on an moral method [16]. In order to interpret as well as understand human emotions in addition to feelings, the machines have to be dependable and efficient.

Most SA is grounded on supervised ML [17]. An vital role is played via the Feature extraction (FE) in addition to classifier design of texts. Term frequency, Term Occurrence, Binary term occurrence, and Terms Frequency-Inverse Documents Frequency (TF-IDF) are the disparate methods for Feature Selections (FS) [18]. The TF-IDF usually uses the sentiment lexicon to choose the feature words as well as calculate weights that were broadly applied to traditional NLP tasks [19].

Several methods for SA were proposed in the precedent decades, most of which are centered on computational linguistic approach and ML approach, for instance Naive Bayes (NB) Maximum Entropy along with Supports Vectors Machines (SVM) [20]. These models are trained on the feature vectors derived as an output as of the Latent Dirichlets Allocation (LDA) and the sentiment in the text is classified as positive or negative. From several methods, it can be stated that the ML approach exhibit higher performance than the computational linguistic approach [21].

As Deep Learning (DL) showed remarkable outcomes for an assortment of NLP tasks, it has captured the researchers’ attention [22]. DL is a division of ML and it encompasses manifold layers of perceptron that is stimulated by means of the brain [23]. Numerous DL models are present, for instance deep neural networks (DNN), convolutions neural networks (CNN) [24], deep CNN [25], deep Restricted Boltzmanns Machine (RBM), etc. Although, there are many propitious outcomes with DL in NLP, it hasn’t overcome the prevailing issues [26]. The below-mentioned restrictions affect the existing work that is centered on SA. The limitations include (1) the knowledge of hierarchical connections of product aspects is not completely used. (2) Sentences or reviews stating many aspects associated with complex sentiments aren’t dealt very well [27]. Also, the overall appraisal of the SA using ML hasn’t provided better accuracy and efficient training time. So, this paper proposed an efficient SA of online products reviews. The chief contribution of the proposed methodology is enlisted as follows,

  • The SA is done in ‘3’ scenarios: grade based, content-based and collaboration based.

  • The review is analyzed for the ‘3’ scenarios using the DLMNN classifier, which gives enhanced accuracy and low training time.

  • The future prediction of the product is done utilizing the IANFIS system.

The draft of this paper is prearranged as Sect. “Literature review” reviews the associated works concerning the technique proposed. Section “Proposed methodology”, proffers a concise discussion concerning the proposed methodology, Sect. “Results and discussion”, elucidates the Investigational outcome and Sect. “Conclusion” briefly concludes the paper.

Literature review

Feilong Tang et al. [28] suggested ‘2’ generative model, MaxEnt–JABST as well as JABST, that extracted typically the fine-grained opinions along with aspects as of reviews (online). The JABST model extracted particular and general opinions and aspects together with the sentiment polarity (SP). In addition, the MaxEnt–JABST design added a maximal entropy classifier for separating aspects or opinion words more precisely. Those designs were assessed on review regarding restaurants and electronic devices quantitatively as well as qualitatively. The experiential outcomes evinced that the designs outperformed existent baselines and were competent to recognize fine-grained aspects and opinions but the improvement was still needed.

Rajkumar et al. [29] rendered a ‘2’ ML approaches say Naïve Bayes (NB) and SVM for performing SA on reviews of a specific product. In those approaches, the dataset was gathered as of Amazon, which comprised reviews regarding Laptops, Cameras, Mobiles, Tablets, video surveillance, and TVs. Subsequently, stemming, stop word removal, and also punctuation marks removal were executed and it was transmuted into a bag of words. This dataset was contrasted to opinion lexicons, that is, 4783 negative and 2006 positive words with sentiment scores intended for every sentence were evaluated. Utilizing score and disparate features, the NB along with SVM were employed and diverse accurateness was computed. The ML approaches proffered the good outcomes to categorize product reviews. NB got 98.170% accuracy and SVM got 93.54% accuracy for Camera—related Reviews. The approach utilizes the SVM, which encompasses several key parameters that are required to be set properly for attaining the best classification outcomes. Thus, the SVM renders lower accuracy in classification.

Sumbal Riaz et al. [30] recommended an approach termed text mining for examining customer reviews to ascertain the customers’ opinions and executed the SA on the massive dataset of product (6 sorts) reviews proffered by disparate customers on the internet. In this approach, SA was employed at the phrase level instead of document-level for computing every term’s SP. Then key graph keyword extraction was used aimed at extracting keywords as of each document with high-frequency terms and the intensity of SP by gauging its strength was evaluated. The k-means clustering was utilized for grouping data on the base of sentiment strength value. Those values were contrasted to the star rating of the same data and the excellent and neutral sentiment toward products was examined. The approach uses the clustering which may bring about over clustering.

Satuluri Vanaja and Meena Belwal [31] rendered an Aspect-level SA, which was attained by Identification, aggregation, and Classification. The preprocessing includes Parts-of-Speech tagging to every word in each sentence, extracting frequently used words, removing stopping or unwanted words and adjective extraction from the sentences. The classification was executed utilizing ‘2’ ML algorithms, NB and SVM classification algorithm and the performance were contrasted centered on Recall, F1 measure, and Precision. The outcomes evinced that it attained more accurateness from the NB when weighed against the SVM. The SVM approach was not apt for large datasets.

Wei Zhang et al. [32] propounded an emotion classification algorithm grounded on SVM as well as latent-SA (LSA). Primarily, Psychology and NLP were integrated to divide the emotions in the online reviews onto ‘4’ categories: a. happiness, b. hope, c. disgust, and d. anxiety. Subsequently, the LSA approach was utilized for optimizing the text feature extraction and employed the SVM as a classifier for ameliorating the emotional classification accurateness and computational efficacy. The experiential outcomes evinced that the model could effectually compute online reviews. Context meanings of data with DL algorithms were utilized for combining the reviews theme, sentiment classification and product characteristics for further enhancing the multiple class emotional detection accurateness. The approach employs only a less number of data for analyzing, which is not efficient.

Barkha Bansal and Sangeet Srivastava [33] rendered a Hybridized Attribute-centric Sentiment Classification (HABSC) for infusing domain-specific knowledge and collecting the implicit word relations. This approach found the utmost frequent bi- gram as well as tri-gram in the corpus, followed by POS tagging for retaining opinion words and aspect descriptions. Subsequently, it has deployed TFIDF for signifying every document, followed by automatic extraction of an optimal topic. All the adverbs and adjectives were labeled utilizing pre-existing lexicon and domain-related knowledge. The method’s efficacy was tested utilizing datasets. The outcomes evinced that the classification accurateness of HABSC exceeded for disparate methods and also evinced less computational time as contrasted to distributed vectorization frameworks. The approach was not effective in detecting the attribution, and it has a high computational time.

Chonghui Guo et al. [34] examined a ranking approach via online reviews grounded on diverse aspects of variant products that integrated the subjective as well as objective sentiment values. Primarily, the product’s sentiment value was evaluated by ascertaining the weights of those aspects with the LDA topic design. At the time of this process, the realistic meaning of every single aspect was as well summarized. Subsequently, consumers’ personalized preferences were regarded whilst evaluating the total scores of variant products. Meanwhile, comparative superiority in-between every ‘2’ products also added into final scores. By utilizing the Page Rank algorithm, the attained final score of every product was evaluated as of the constructed graph. The outcome elucidated that whilst regarding only objective sentiment values of the product, the ranking outcome attained by this approach had a good correlation with the primary sales orders. But the system used the LDA, which was sensitive to overfit, and validation of LDA models was at least problematic.

Jian-Wu Bi et al. [35] offered a method for demonstrating the SA outcomes relied on the interval type-2 fuzzy numbers that considered the accuracy rates. Initially, the work showed the demonstration of SA outcomes attained from a large amount of online analyses as interval type-2 fuzzy numbers that were the initial effort to present the SA outcomes by considering its accuracy rates, and the first to get the decision data in a big data environment. This method had a clear logic as well as provided with a good foundation for conducting many types of management decision investigation that were relied on online reviews. Subsequently, the pertinent theoretical investigation was offered for the constructed interval type-2 fuzzy numbers. Finally, the system’s performance was estimated that rendered better outcome.

Proposed methodology

An imperative manner through which the meaningful detail is mined from online is by SA of the reviews (online). The human’s sentiments, emotions, opinions, et cetera concerning the products are expressed in the form of customer reviews as well as star ratings, which are being analyzed by a machine i.e. ML approach. The RA of online products will improve product quality as well as influence the purchase decisions of the consumers. Therefore, product review analysis is a universally accepted platform in which the consumer could effortlessly be conscious of their needs. For the SA of online products, though several ML techniques were suggested in the past, those techniques have only encompassed limited features and also didn’t focus on the future prediction of online products by considering the user review comments. To trounce such drawbacks, two methodologies are proposed i.e. DLMNN and IANFIS for RA and future prediction of online product. The FRD is employed for the proposed SA. The data values as of the dataset are separated into ‘3’ scenarios such as GB, CB, and CLB. Afterward, they are separated as positive, negative, as well as neutral with the help of DLMNN. Firstly, the efficient RA stage is performed for these three scenarios. For the initial one i.e. GB, centered on the score value of user ratings, the polarity score (PS) is computed followed by which it is classified as positive, negative, and neutral using DLMNN. After that, for CB and CLB, Preprocessing, FE, FS, and Review Classification are performed separately for both. In CB, only the comments given by the user are considered, whereas, CLB, user ratings along with comments are considered for the RA. The future prediction of the products is performed subsequent to these classifications (i.e. 3 scenarios). For which, the weighting factor of the pre-processed data is estimated by performing ‘5’ operations, like keyword frequency, identification positive and negative word, computation of support, computation of confidence, as well as entropy estimation. And finally, the future prediction of the product is done with the help of IANFIS. The proposed method’s architecture is exhibited in Fig. 1.

Fig. 1
figure 1

Architecture of the proposed method

Food review dataset

The FRD is taken as the input in the case of the proposed technique. And this dataset has around 5 lakhs records that are openly available online. The dataset in them consists of features like Product Id, Profile Name, User Id, Helpfulness Denominator, Helpfulness Numerator, and Score Time Summary Text. 80% of data is given for training and the remaining data (i.e. 20%) is taken for testing. The RA is done centered on three scenarios (i.e. are GB, CB, and CLB) of the dataset for the online product. The GB encompasses only the information regarding the ratings of the online products, which varies for each product in the dataset. The CB encompasses the information relating to the comments of the products written by the customer. Finally, the CLB encompasses ratings as well as customer written reviews. The product’s review was analyzed by utilizing these three. In the proposed technique, the RA is done separately for these three scenarios and inputted to the DLMNN for review classification. A meticulous elucidation of the scenarios is exhibited below.

GB scenario

In the GB scenario, the PS is computed for every product and later-on given to DLMNN for classification. Centered on the ratings (stars) that are clicked by the buyer for the certain product, the PS for that product is computed. If 4 or 5 stars are given to a product, then the PS will be 1; if it is 3, then the PS will be 0.5 and if it is 2, then the PS will be 0. The sentiment of the product is classified based on these PS. These computed PS of the product is given as input to the DLMNN classifier. DLMNN classifies it into (i) positive, (ii) negative, and (iii) neutral. A positive outcome indicates that the product encompasses lots of positive stars and also a good one. Negative results imply that the product has hordes of negative stars and is a bad one. Finally, neutral indicates that the product has positive as well as negative stars and is a neutral one.

CB scenario

For the RA of CB, the data values in the dataset are processed in four steps, such as (i) pre-processing, (ii) feature extraction, (iii) feature selection (iv) classification, which are elucidated briefly in the below subsection.


In this stage, the comments of the online products stored in the dataset are pre-processed by performing tokenization, stemming, stop word removal, and hashtag and username removal. First, the pre-processing step carried out the tokenization, which is fundamentally the procedure of splitting the text into a compilation of meaningful pieces (tokens). For instance, a chunk of text is split into words or sentences. Then, the common words that are not useful for learning will be removed, which is denoted as the stop word removal. A word, like “the” or “and”, can be removed by comparing text with a stop words list. Next, stemming process is taken. Stemming stands as a process in which the words are decreased to its root by means of eradicating the inflection via dropping redundant characters that is typically a suffix. Finally, URL, Hashtag and username are removed because Hashtags are particularly used in social networks to mark keywords in messages, which make it simple to find. In this phase, the hashtags marked with a number sign (#) in front of a word are removed from an entered text. Next, if any URL or username is present, then that will also be removed and finally, the elongated word is trimmed.

Feature extraction

Here, the features, for instance, positive emoticon count, negative emoticon count, exclamation mark count, question mark count, positive gazetteer words occurrence count, negative gazetteer words occurrence count, unigrams, bigrams, trigrams, n-grams, and part-of-speech tag from the preprocessed data are extracted.

Feature selection

After FE, by utilizing the Spider Monkey Optimization Algorithm (SMOA), the essential features are chosen centered on the fitness values of extracted features. The brief explanation about the SMOA is given as follows,

SMOA is a population-centered stochastic algorithm. SMOA is enthused by the smart food foraging behavior of the spider monkeys (SM). The SM’s foraging behavior shows that these SM comes under the class of fission–fusion social structure (FFSS) centered animals. Thus, the optimization algorithm centered on the SM’s foraging behavior could well be explained better with reference to FFSS. The subsequent are the chief features of the FFSS.

  1. 1.

    Female monkeys lead a pack of 40–50 members to forage food. The group leader is liable for searching the food sources.

  2. 2.

    And if the group leader couldn’t able to find adequate food for the entire group members, then she splits them into subgroups of 3 to 8 monkeys each to decrease the competition. These small groups search for food separately.

  3. 3.

    These Sub-groups will also be guided by a female (i.e. local leader). This local leader will make the decision for planning an effectual foraging route every day.

  4. 4.

    To exchange data on the subject of food availability as well as territorial boundaries, the sub-groups communicate with one another.

This algorithm executes six stages. They are local leader stage (LLS), global leader stage (GLS), global leader learning stage (GLLS), local leader learning stage (LLLS), local leader decision stage (LLDS), global leader decision stage (GLDS). Before executing these, the SM population is initialized. A meticulous explanation is provided below, Initialization: The solution of every monkey is a d-dimensional vector in which D implies the number of parameters (variables) to be optimized. The SM is initialized with the equivalently distributed values betwixt the minimum and maximum values by the SMO.

$$sm_{ij} = sm_{mnj} + rd\left( {0,1} \right) * \left( {sm_{mxj} - sm_{mnj} } \right)$$

Where, \(sm_{ij}\) is the \(j\)th dimension of the \(i\)th spider monkey, \(sm_{mxj}\) and \(sp_{mnj}\) signifies the maximum and minimum limits of that free parameter.

Local leader phase (LLP): The SM centered on the experience of the local leader and the monkeys belonging to the same sub-group update their values. The new solution’s fitness is calculated. If it is more than the original solution, then the monkey updates its solution. The position update of \(i\)th SM that is the part of \(m\)th group is stated as

$$sm_{newij} = sm_{ij} + rd[0,1] \times \left( {ll_{mj} - sm_{ij} } \right) + rd[ - 1,1] * \left( {sm_{rj} - sm_{ij} } \right).$$

Where \(sm_{ij}\) denotes \(i\) th SM in \(j\)th direction, \(ll_{mj}\) denotes ‘\(j\)th’ dimension of the \(m\)th local group leader position. \(sm_{rj}\) specifies the ‘\(j\)th’ dimension of the \(r\)th SM that is randomly selected from \(m\)th group in order that \(r \ne i\) in \(j\)th dimension.

Global leader phase (GLP): Subsequent to LLP, the SM centered on the GL along with local group member’s experience updates their positions. This is performed for better convergence. It is estimated by utilizing the below equation.

$$sm_{newij} = sm_{ij} + rd\left( {0,1} \right) \times \left( {gl_{j} - sm_{ij} } \right) + rd\left( { - 1,1} \right) \times \left( {sm_{rj} - sm_{ij} } \right).$$

Where \(gl_{j}\) denotes the GL location in ‘\(j\)th’ dimension and \(j \in \left\{ {1,2, \ldots .D} \right\}\) specifies the arbitrarily selected index. The SM probability is selected for updating their position, which is proportional to its fitness value in order that the best monkey encompasses more chance of being selected and improving itself. The probability is computed utilizing its fitness, which is shown as.

$$p_{ri} = 0.9 \times \frac{{F_{i} }}{{F_{\hbox{max} } }} + 0.1$$

Global leader learning (GLL): The global leader position is updated by searching all the solutions. The position of SM with the highest fitness function is taken as the global leader’s position. Also, it is checked that the global leader’s position has changed or not. If the position didn’t change, then the Global Limit Count’s value is increased by one.

Local leader learning (LLL): Here, the greedy search is performed within the subgroups. The SM with the uppermost fitness function is picked as the local leader. The old along with updated position of the local leader is also verified. If it isn’t changed, then the Local Limit Count is augmented by one.

Local leader decision (LLD): This phase aids in the re-initialization of a group if its local leader does not update its position of the specified local leader limit. Re-initialization of the group might cause a member of the group to enter into the infeasible region from a feasible region. The LL position is computed utilizing the formula.

$$sm_{Newij} = sm_{ij} + rd\left( {0,1} \right) \times \left( {gl_{j} - sm_{ij} } \right) + rd\left( { - 1,1} \right) \times \left( {sm_{ij} - ll_{mj} } \right).$$

Global leader decision (GLD): Here, the whole swarm is bifurcated into groups if the GL isn’t updated for the specified GL limit. Amid this phase, local leaders are decided for newly generated sub-groups utilizing the LLL process.

DLMNN classifier

After feature selection, rank the chosen features (words) utilizing the sentiwordnet dictionary. SentiWordNet, derived as of the WordNet database, is basically an opinion lexicon where every term is related to numerical scores signifying positive sentiment and negative sentiment information. The feature word encompasses positive and even negative ranking. These score values of the products are inputted to DLMNN and are classified as positive, neutral and negative. Positive signifies that the product is a good product and has more positive comments as of the customers. Negative signifies that the product is not a good one and receives lots of negative comments and the product has fewer stars. Also, neutral indicates that the product is an average product that received positive together with negative comments as of the customer.

Each input is sent to a discrete node existent in the input area of the DLMNN. The randomly assigned values called weights are associated to each input. The nodes in the hidden layer (HL) termed hidden nodes perform the function of adding the product of the input value and weight vector of all the input nodes which are connected to it. In DLNN, the weight values are effectively optimized utilizing the Hybrid Dragonfly-Genetic Algorithm (HDF-GA) which is called DLMNN. Random weight value gives a more back-propagation process to achieve the result, and hence the optimization is performed in the proposed method. The activation operation is then implemented and this layer’s output is transported to the consecutive layer. The steps in DLMNN classification are expounded below,

Step 1: Initially assign the ranked data values and their respective weights utilizing Eq. (6) and (7).

$$R_{i} \, = \,\{ R_{1} ,\,R_{2} ,\,R_{3} \ldots R_{n} \} .\,$$
$$w_{i} = \{ w_{1} ,w_{2} ,w_{3} \ldots ..w_{n} \} .$$

where \(R_{i}\) signifies the \(n\) number of ranked data’s like \(R_{1} ,R_{2} ,R_{3} \ldots ..R_{n}\) and \(w_{i}\) denotes the weight value of \(R_{i}\) which includes ‘\(n\)’number of weights namely \(w_{1} ,w_{2} ,w_{3} \ldots ..w_{n}\) for corresponding \(R_{1} ,R_{2} ,R_{3} \ldots ..R_{n}\).

Step 2: Multiply the ranked input data with the randomly chosen weight vectors and then summate those values, and it is expressed as,

$$S_{m} = \sum\limits_{i = 1}^{n} {R_{i} w{}_{i}}$$

where \(S_{m}\) indicates the summed value.

Step 3: Evaluate the activation function \(Af_{i}\) utilizing the Eq. (9),

$$Af_{i} = S_{i} (\sum\limits_{i = 1}^{n} {R_{i} w{}_{i})}$$


$$B_{i} = e^{{ - R_{i}^{2} }}$$

where \(B_{i}\) specifies the exponential of \(R_{i}\).

Step 4: Compute the next HL’s output utilizing Eq. (11).

$$Y_{i} = b_{i} + \sum {B_{i} } w_{i}$$

where, \(b_{i}\)–Bias value, \(w_{i}\)–Weight between the input layer and HLs.

Step 5: Perform the steps from 2 to 4 for every layer of DLMNN. Lastly, summate all the existent input signals’ weights for attaining the output layer neurons’ value which is expressed as.

$$U_{i} = b_{i} + \sum {O_{i} } w_{j} .$$

where, \(O_{i}\)–Value of the layer that precedes the output one, \(w_{j}\)–Weights of the HL, \(U_{i}\)–Output unit.

Step 6: Contrast the network output to the target value and find the error signal which is the difference of those ‘2’ values. This value is mathematically signified utilizing (13),

$$e_{s} = A_{i} - U_{i} .$$

where, \(e_{s}\)–Error signal, \(A_{i}\)–aimed target output.

Step 7: Here, the output unit is weighted against the targeted value. Determine the related error. Compute \(\delta_{i}\) centered on this error.

$$\delta_{i} = e_{s} [f(A_{i} )].$$

Step 8: assess the weight correction employing the backpropagation methodology utilizing Eq. (15).

$$C_{i} = \lambda \delta_{i} (R_{i} ).$$

where \(C_{i}\) implies the weight correction, \(\lambda\) signifies the momentum term, and \(\delta_{i}\) implies the error that is distributed in the network. The weight values are optimized utilizing an HDF-GA algorithm. The elucidation for HDF-GA is proffered below.

The Dragon fly (DF) algorithm is mainly inspired as of the natural static as well as dynamic swarming behaviors of DFs. The ‘2’ necessary phases of optimization like (i) exploration and (ii) exploitation are intended by designing the social interaction of DFs during navigation, food search, and avoidance of enemies while swarming. Here, ‘3’ main rules (nature of swarms) are followed by DFs that are, separation (\(S_{p}\))–The DFs avoid one another on account of collision in a stationary position as of the neighborhood, Alignment (\(A_{l}\))–Each DF’s velocity coordinates with another one in neighborhood and Cohesion (\(C_{h}\)) –The DFs fly towards the center of a group of neighborhoods.

The normal dragonfly algorithm encompasses the convergence speed problem. So in the proposed work, the crossover and mutation process of the Genetic Algorithm (GA) is hybridized with the conventional DF algorithm to attain effective optimization outcomes to form HDF-GA. The proposed hybridization algorithm renders a better optimum result with better convergence speed. The process of the HDF-GA are expounded below.

Initially assign the size of \(n\) DFs as \(N\) and the \(i\)th DF’s position is formulated as,

$$M_{i} = \left( {m_{i}^{1} ,m_{i}^{d} , \ldots .m_{i}^{N} } \right).$$

where,\(i = 1,2,3 \ldots .N\), \(m_{i}^{d}\)–Position of the \(i\)th DF in \(d\)th dimension of the search spaces \(N\)–Number of search agents.

After initialization, the separation, alignment, cohesion, attraction and distraction are computed. First, Compute \(S_{p}\) utilizing Eq. (17).

$$S_{p} \left( {i,t} \right) = - \sum\limits_{j = 1}^{N} {M\left( {i,t} \right)} - M\left( {j,t} \right)$$

where, \(S_{p} \left( {i,t} \right)\)–Separation motion for \(i\)th individual at the \(t\)th iteration \(M\left( {i,t} \right)\)–Current individual ‘\(i\)’s position at the \(t\)th iteration \(M\left( {j,t} \right)\)–Neighboring individual \(j\) ‘s position at the \(t\)th iteration.

Second, compute the velocity matching of individuals amongst the neighbourhood utilizing Eq. (18).

$$A_{l} \left( {i,t} \right) = \frac{{\sum\limits_{j = 1}^{N} {v\left( {j,t} \right)} }}{N}$$

where, \(A_{l} \left( {i,t} \right)\)–Alignment motion of the \(i\) at the iteration \(t\)\(v\left( {j,t} \right)\)–Velocity of \(j\) at the \(t\)th iteration.

Third, compute the cohesion of individuals in the direction of the center of mass of the neighbourhood utilizing Eq. (19).

$$C_{h} \left( {i,t} \right) = \frac{{\sum\limits_{j = 1}^{N} {M\left( {j,t} \right)} }}{N} - M\left( {i,t} \right)$$

Fourthly, compute the motion of attraction towards the food source \(A_{r} \left( {i,t} \right)\) using Eq. (20).

$$A_{r} \left( {i,t} \right) = M\left( {f,t} \right) - M\left( {i,t} \right)$$

Here, \(M\left( {f,t} \right)\) indicates the food source position at the iteration \(t\). Individual DFs with the best objective function (OF) up to the current iteration would be regarded as food.

Fifthly, compute the motion of distraction \(D_{r} \left( {i,t} \right)\) against the enemy utilizing (21).

$$D_{r} \left( {i,t} \right) = M\left( {e,t} \right) - M\left( {i,t} \right)$$

where, \(M\left( {e,t} \right)\) signifies the enemy distraction motion of \(i\) at iteration \(t\). Individual DFs with the worst OF up to the current iteration would be regarded as an enemy.

Then, 2 genetic operators “Crossover and mutation” are added and are applied when the DF does not have at least ‘1’ neighboring DF. This brings effective optimization. Here, the 2-point crossover type is used and is executed utilizing the crossover points.

$$c_{1} = \frac{{|X{}_{t + 1}|}}{3}$$
$$c_{2} = c_{1} + \frac{{|X{}_{t + 1}|}}{2}$$

where \(c_{1}\) and \(c_{2}\) indicates the selected ‘2’ crossover points. During mutation, replace the number of genes as of every chromosome with new genes. The replaced genes are arbitrarily created genes without any repetition in the chromosome. The chromosomes indicate a parameter set that gives the solution in this proposed system.

After crossover, mutation update the DFs’ position in a search space and simulate their movements utilizing ‘2’ vectors like position vector \(Y\) and step vector \(\Delta X\). The direction of the DFs’ movement is specified by \(\Delta X\) and is formulated as,

$$\Delta X_{t + 1} = (sS_{p} + aA_{l} + cC_{h} + fA_{r} + eD_{r} ) + w\Delta M_{t} .$$

where, \(t\) is the current iteration, \(s\) is the separation weight, \(S_{p}\) symbolizes the separation of the \(i\)th individual, \(a\) indicates the alignment weight, \(A_{l}\) alludes to the alignment of the \(i\)th individual, \(c\) cohesion weight, \(C_{h}\) signifies the cohesion of the \(i\)th individual, \(f\) is the food factor, \(A_{r}\) specifies the food source of the \(i\)th individual, \(e\) is the enemy factor, \(D_{r}\) signifies the position of the enemy of the \(i\)th individual, indicates the weight of inertia and \(t\) signifies the iteration counter. At last, the position vector could be evaluated as of the value of the step vector. It is computed as,

$$Y_{t + 1} = Y_{t} + \Delta Y_{t + 1}$$

where, \(\Delta Y\) is the Step Vector, \(t\) is the current iteration and \(Y\) is the Position Vector. The HDF-GA pseudo-code is proffered in Fig. 2.

Fig. 2
figure 2

Pseudo code for the proposed HDF-GA

CLB scenario

Here, the RA of online products is performed by collaborating GB with CB scenarios. Here, both grades and reviews given by the customer for a specific product are regarded. Contrasting the outcomes of both GB and CB, the CLB scenario is analyzed.

Future prediction

After RA, the future prediction of the online products is done with the help of the IANFIS technique. Firstly, the weighting factor of the online product has been gauged by performing five steps, such as, keyword frequency, identification, support, confidence and entropy. First, identify the frequent keyword that means the number of occurrences of a particular keyword on the dataset and is expressed as,

$$K_{{f_{i} }} \, = \,\{ K_{{f_{1} }} ,\,K_{{f_{2} }} ,\,K_{{f_{3} }} , \ldots \ldots \ldots K_{{f_{n} }} \}$$

After the extraction of frequent keywords, the positive and negative keywords are identified as of the previously found frequent keywords utilizing sentiwordnet dictionary. After that, the support, confidence and entropy values of those identified words are computed. The support of the keyword is extracted. The support signifies the percentage of transactions in the database which comprises every keyword on the database. For an association rule \(\left( {K_{1} \to K_{2} } \right)\) (\(K_{1}\), \(K_{2}\)-keywords), the support is formulated as,

$$S_{p} = Support\left( {K_{1} \to K_{2} } \right) = P\left( {K_{1} \cup K_{2}^{{}} } \right)$$

Then, the confidence is extracted for the keywords, which specify the percentage of transactions on the database with the keywords (\(K_{1}\), \(K_{2}\)). The confidence is evaluated utilizing the conditional probability which is further expressed in respect of keyword support and is proffered as,

$$C_{f} = Confidence\left( {K_{1} \to K_{2} } \right) = P\left( {{{K_{1} } \mathord{\left/ {\vphantom {{K_{1} } {K_{2} }}} \right. \kern-0pt} {K_{2} }}} \right) = \frac{{P\left( {K_{1} \cup K_{2} } \right)}}{{P\left( {K_{1} } \right)}}$$

where, \(P\left( {K_{1} \cup K_{2} } \right)\)–Number of transactions with the keywords \(K_{1}\) and \(K_{2}\), \(P\left( {K_{1} } \right)\)–Number of transactions containing a keyword \(K_{1}\).

Finally the entropy, which indicates the average of the information attribute. The information quantity of every attribute generates an arbitrary variable, which may be the anticipated or average value and is regarded as entropy. Entropy calculates as,

$$E_{i} = - \sum\limits_{p,f = 1}^{n} {S_{p} \,\,\log_{2} C_{f} }$$

where, \(S_{p} \,\) denotes support and \(C_{f}\) denotes the confidence. These computed entropy values are inputted to the IANFIS classifier for future prediction.


The IANFIS algorithm is employed for classifying the future prediction of the product into high and low. High indicates that the future demand is high for the product, whereas, low symbolizes that the future demand is low for the product. IANFIS takes the entropy values of frequent positive keywords and negative keywords as input. The positive keyword with the maximal entropy value signifies that the product has higher future demand. Similarly, the negative keyword with the maximal entropy value signifies that the product has lower future demand. Grounded on this future demand of a specific product, all high-quality reviews of that product are visible on the top to the customers and also that product is suggested for them on the top of the existent product category list. The IANFIS is briefly explained below.

A sort of artificial neural network termed ANFIS (Adaptives Neuro-Fuzzy Inferences System) is centered on the Takagi–Sugenos fuzzy inference system. As it incorporates the neural networks as well as fuzzy logic principles, it comprises the potential of capturing their merits into a single model. Its inference system agrees with a compilation of “fuzzy IF–THEN rules” that have the learning competency of approximating nonlinear functions. In its architecture, five layers could be seen. Each layer is explained below.

First layer: It is the fuzzification layer, which takes the input and finds the membership functions (MFs) that belong to them.

Second layer: It is the rule layer, which is accountable for producing the Firing Strengths (FS) aimed at the rules.

Third layer: It normalizes the computed FSs by diving each value with the total FS.

Fourth layer: here, the normalized values are given as input (consequence parameter set) and the defuzzificated values returns as the ouput.

Fifth layer: It regards the defuzzificated values as input for returning the final output.

The conventional ANFIS model utilizes the bell MF. The bell MF has a symmetric form and cannot easily calculate the operations. So the proposed technique uses the Gaussian kernel Membership Function (GMF) for ameliorating the rule generation process’s performance. The GMF has the smoothness along with concise notation. The ‘2’ basic rules of IANFIS are,

Rule 1: If \(E_{1}\) is \(P_{i}\) as well as \(E_{2}\) is \(Q_{i}\) then,

$$Rules_{i} = sE_{i} + t_{i} E_{i + 1} + u_{i}$$

Rule 2: If \(E_{1}\) is \(P_{i + 1}\) as well as \(E_{2}\) is \(Q_{i + 1}\) then,

$$Rules_{i + 1} = s_{i + 1} E_{i} + t_{i + 1} E_{i + 1} + u_{i + 1}$$

where \(P_{i}\),\(Q_{i}\), \(P_{i + 1}\) and \(Q_{i + 1}\) specifies the fuzzy sets. \(E_{i}\) and \(E_{i + 1}\) values represent the disparate entropy values attained as of the former step. \(s_{i}\), \(t_{i}\), \(u_{i}\), \(s_{i + 1}\), \(t_{i + 1}\) and \(u_{i + 1}\) values indicates the parameter set. The layers in IANFIS are expounded below individually.

Layer 1: Each adaptive node of layer-1 has a node function and they are adapted to a function parameter. It is formulated as,

$$IA_{1,i} = \mu_{{f_{i} }} \left( {E_{i} } \right)$$


Here, \(E_{i}\)–Input to ‘\(i\)’node.

The input of MF gives the degree of member-ship value as the output for each node. The Gaussian kernel MF is the MF used in the proposed work and is specified in the succeeding equation.

$$\mu_{{f_{i} }} \, = \,\exp \,\left( { - \frac{{\left\| {s_{i} - t_{i} } \right\|^{2} }}{{2u_{i}^{2} }}} \right)$$

where,\(s_{i}\), \(t_{i}\) and also \(u_{i}\) indicates the MFs’ parameters that could alter the shape of the MF. The parameters are alluded to as the premise parameters.

Layer 2: Its fixed nodes produce the output in the form of the product of all existent incoming signals

$$IA_{2,i} = K_{i} = \mu_{{f_{i} }} (E_{i} ) \times \mu_{{f_{i} }} (E_{i + 1} ).$$

The FS of a rule is the output for \(IA_{2,i}\).

Layer 3: Its fixed nodes are tagged as N. The \(i\)th node evaluates the ratio of the \(i\)th rule’s FS to the total of all rules’ FSs.

$$IA_{3,i} = \overline{K}_{i} = \frac{{K_{i} }}{{K_{i} }},\,\,\,\,\,\,i = 1,\,2 \ldots .6$$

The outputs are termed normalized FSs for convenience.

Layer 4: It comprises adaptive nodes with node function and is formulated as,

$$IA_{4,i} = \overline{K}_{i} .\,\,Rules_{i}$$

Here, \(\overline{K}_{i}\) implies the normalized FS as of the preceding layer and \(Rules_{i}\) signifies the rule of the system. The parameters that are employed are termed as succeeding parameters.

Layer 5: It has a single fixed node and it produces the overall output by summating the existing incoming signals. Here, the circle node is labeled as \(\sum {}\).

$$IA_{5,i} = \sum\limits_{i} {K_{i} } Rules_{i} = \frac{{\sum\nolimits_{i} {K_{i} Rules_{i} } }}{{\sum\nolimits_{i} {K_{i} } }}$$

Results and discussion

The proposed DLMNN for SA of online product reviews and IANFIS for future predictions are implemented in the working platform of JAVA. Here, the three scenarios like GB, CB, and CLB, which are utilized for RA of online product-reviews, are contrasted during performance analysis. The IANFIS approach used for future prediction of online product is weighed against the existing ANFIS. For both RA and future predictions, the ML approaches are implemented. The performance metrics like precision (\(p_{s}\)), f-score (\(f_{s}\)), recall (\(r_{k}\)), and accuracy (\(a_{c}\)) is used to contrast the proposed schemes’ performance.

Performance analysis of GB, CB, and CLB using DLMNN

Here, the performance analysis of GB, CB, and CLB scenarios using DLMNN is made in respect of the performance measures say \(p_{s}\), \(r_{k}\), \(f_{s}\), and \(a_{c}\) which is evinced in Table 1.

Table 1 Performance comparison of GB, CB, and CLB

Table 1 compares the performance of the GB, CB, CLB scenarios of RA using DLMNN regarding (a) \(p_{s}\), and \(r_{k}\), and (b) \(f_{s}\), and \(a_{c}\). For comparing those three scenarios, 5000 data are regarded. For 1000 data, the GB and CB gives the \(p_{s}\) of 86.3266 and 87.9988, \(r_{k}\) of 92.4555 and 92.1125, \(f_{s}\) of 90.3324 and 91.0455, and \(a_{c}\) of 96.8543 and 89.7764, whereas, the CLB scenario gives the values of 95.4534, 96.1128, 95.0455, and 95.7764 for \(p_{s}\), \(r_{k}\), \(f_{s}\), and \(a_{c}\) respectively, which are higher than GB and CB scenarios. The chief aim of the proposed methodology is to ameliorate the SA system’s accuracy, and in this way, the system can attain higher accuracy centered on the CLB scenario. Likewise, for 5000 data, the CLB scenario gives the values of 96.4555, 96.8322, 96.8543, and 96.6654 for \(p_{s}\), \(r_{k}\), \(f_{s}\), and \(a_{c}\) respectively but the GB and CB scenarios gives 88.3447 and 88.8455 for \(p_{s}\), 91.8876 and 90.8322 for \(r_{k}\), 91.6355 and 90.8541 for \(f_{s}\), and 86.67,845 and 96.6654 for \(a_{c}\) respectively, which are lower than CLB scenario. Contrasted to GB, the CB scenario attains good outcomes for all performance measures. Similarly, for the remaining number of data (i.e. 2000, 3000 and 4000), the proposed system gives higher accuracy centered on the CLB scenario. Thus, it inferred that the proposed system attains better performance centered on the CLB scenario. The Table 1 is graphically evinced in Fig. 3.

Fig. 3
figure 3

Performance graph for the GB, CB, and CLB scenario using DLMNN regarding a precision and recall, and b f-score and accuracy

Performance analysis of IANFIS

Here, the IANFIS is used for future forecast of online product. For performance analysis, the proposed IANFIS is contrasted to the existing ANFIS, Artificial Neural Network (ANN), as well as Deep Neural Network (DNN) regarding \(p_{s}\), \(r_{k}\), \(f_{s}\), and \(a_{c}\) which is displayed in Fig. 4.

Fig. 4
figure 4

Performance graph for the IANFIS with existing ANFIS

Figure 4 evinces the performance comparison graph for the proposed IANFIS, ANFIS, ANN and the DNN concerning the performance measures say (a)\(p_{s}\), and \(r_{k}\) and (b)\(f_{s}\), and \(a_{c}\). Totally 5000 data are taken for performance comparison of the proposed and existing methods. The graph is plotted for 1000–5000 data. For 1000 data, the proposed IANFIS gives 86.4534 of \(p_{s}\), 91.1128 of \(r_{k}\), 90.0455 of \(f_{s}\), and 93.7734 of \(a_{c}\). But the existing systems, such as ANFIS, ANN, and DNN have poor performance than the proposed system centered on the recall, precision, f-measure as well as accuracy metrics. And also for the remaining 2000, 3000, along with 4000 data, the IANFIS attains the best results. Hence, from the comparison, it is deduced that the proposed IANFIS attains pre-eminent performance for the future prediction of online products when weighed against the existing ANFIS.


A DLMNN methodology is proposed aimed at SA of online products review and an IANFIS methodology is proposed aimed at future prediction of online product. The performance of both the proposed methodologies is analyzed. The proposed DLMNN is employed for three scenarios (GB, CB, and CLB) of RA. The comparison of those three scenarios for disparate numbers of data (from 1000 to 5000) concerning the performance measures of \(p_{s}\),\(r_{k}\), \(f_{s}\), and \(a_{c}\), is done. While comparing the ‘3’ scenarios, the CLB scenario attain the best outcomes for product RA. And, while contrasting the IANFIS for future prediction against the existing ANFIS, the proposed IANFIS attains the highest values for \(p_{s}\), \(r_{k}\), \(f_{s}\), and \(a_{c}\). Hence, from the performance analysis, the paper infers that the proposed CLB scenario and IANFIS performed-well for SA and future prediction of online products. The system has a shortcoming such that the keyword processing only identifies the sentiment reflected in a particular word; it typically fails at providing all of the elements necessary to understand the complete context of the entire piece. In the future, the proposed system can be extended by solving the keyword processing problem and improve the performance using a hybridization algorithm in the future prediction process.

Availability of data and materials

The datasets used and/or analysed during the current study are available from the corresponding author on reasonable request.



Content based


Collaboration based


Deep learning modified neural network


Deep neural network


Grade based


Improved adaptive neuro fuzzy inference system


Natural language processing


Opinion mining


Review analysis


Sentiment analysis


  1. Verma JP, Patel B, Patel A. Big data analysis: recommendation system with Hadoop framework. IEEE. 2015.

    Google Scholar 

  2. Choudhary M, Choudhary PK. Sentiment analysis of text reviewing algorithm using data mining, In International Conference on Smart Systems and Inventive Technology (ICSSIT), pp. 532–538, 2018.

  3. Khuc VN, Shivade C, Ramnath R, Ramanathan J. Towards building large-scale distributed systems for twitter sentiment analysis. Proceedings of the 27th annual ACM symposium on applied computing, ACM, 2012.

  4. Vijayakumar S, Vijayakumar V, Logesh R, Indragandhi V. Unstructured data analysis on big data using map reduce. Procedia Computer Sci. 2015;50:456–65.

    Google Scholar 

  5. Gondaliya V, Mandaviya K. An improved approach for online trending forum detection based on sentiment analysis. Int Conference Inventive Comput Technol (ICICT). 2016;3:1–5.

    Google Scholar 

  6. Fang Xing, Zhan Justin. Sentiment analysis using product review data. J Big Data. 2015;2(1):5.

    Google Scholar 

  7. Vinodhini G, Chandrasekaran RM. Sentiment analysis and opinion mining: a survey. Int J. 2012;2(6):282–92.

    Google Scholar 

  8. Severyn A, Moschitti A. Twitter sentiment analysis with deep convolutional neural networks. Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, 2015.

  9. Kumar KS, Desai J, Majumdar J. Opinion mining and sentiment analysis on online customer review. In IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), pp. 1–4, 2016.

  10. Jagbir Kaur, and Meenakshi Bansal, “Multi-layered sentiment analytical model for product review mining”, In Fourth International Conference on Parallel, Distributed and Grid Computing (PDGC), pp. 415-420, 2016.

  11. Singla Z, Randhawa S, Jain S. Statistical and sentiment analysis of consumer product reviews. In 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1–6, 2017.

  12. Hemmatian F, Sohrabi MK. A survey on classification techniques for opinion mining and sentiment analysis. Artificial Intelligence Review, pp. 1–51, 2017.

  13. Feldman Ronen. Techniques and applications for sentiment analysis. Commun ACM. 2013;56(4):82–9.

    Google Scholar 

  14. Trupthi M, Suresh P, Narasimha G, Sentiment analysis on twitter using streaming API. In IEEE 7th International Advance Computing Conference (IACC), pp. 915–919, 2017.

  15. Zheng Lijuan, Wang Hongwei, Gao Song. Sentimental feature selection for sentiment analysis of Chinese online reviews. Int J Mach Learning Cybernetics. 2018;9(1):75–84.

    Google Scholar 

  16. Richard S et al. Recursive deep models for semantic compositionality over a sentiment treebank. Proceedings of the conference on empirical methods in natural language processing, 2013.

  17. Xavier G, Antoine B, Yoshua B. Domain adaptation for large-scale sentiment classification: A deep learning approach. Proceedings of the 28th international conference on machine learning (ICML-11), 2011.

  18. Rajalaxmi H, Seema S. Aspect based feature extraction and sentiment classification of review data sets using Incremental machine learning algorithm. In Third International Conference on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics (AEEICB), pp. 122–125, 2017.

  19. Saleh MR, Martín-Valdivia MT, Montejo-Ráez A, Ureña-López LA. Experiments with SVM to classify opinions in different domains. Expert Syst Appl. 2011;38(12):14799–804.

    Google Scholar 

  20. Krishna MH, Rahamathulla K, Akbar A. A feature based approach for sentiment analysis using SVM and coreference resolution. In International Conference on Inventive Communication and Computational Technologies (ICICCT), IEEE, pp. 397–399, 2017.

  21. Rana S, Singh A.Comparative analysis of sentiment orientation using SVM and Naive Bayes techniques. In 2nd International Conference on Next Generation Computing Technologies (NGCT), IEEE, pp. 106–111, 2016.

  22. Vamshi KB, Pandey AK, Siva KA. Topic model based opinion mining and sentiment analysis. In International Conference on Computer Communication and Informatics (ICCCI), IEEE, pp. 1–4, 2018.

  23. Du X, Cai Y, Wang S, Zhang L. Overview of deep learning. In 31st Youth Academic Annual Conference of Chinese Association of Automation (YAC), IEEE, pp. 159–164, 2016.

  24. Yoon K. Convolutional neural networks for sentence classification, arXiv preprint arXiv, pp. 1408.5882, 2014.

  25. Dos Santos C, Gatti M. Deep convolutional neural networks for sentiment analysis of short texts. Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers, 2014.

  26. Asad A, Siti MS, Shafaatunnur H, Jalil P. Deep learning-based sentiment classification of evaluative text based on multi-feature fusion. Inf Process Manage. 2019;6(4):1245–59.

    Google Scholar 

  27. Wei W, Gulla JA. Sentiment learning on product reviews via sentiment ontology tree. Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, 2010.

  28. Tang Feilong, Luoyi Fu, Yao Bin, Wenchao Xu. Aspect based fine-grained sentiment analysis for online reviews. Inf Sci. 2019;488:190–204.

    Google Scholar 

  29. Jagdale RS, Shirsat VS, Deshmukh SN. Sentiment analysis on product reviews using machine learning techniques. In Cognitive Informatics and Soft Computing, Springer, Singapore, pp. 639–647, 2019.

  30. Riaz S, Fatima M, Kamran M, Nisar MW. Opinion mining on large scale data using sentiment analysis and k-means clustering. Cluster Comput. 2019;22(3):7149–64.

    Google Scholar 

  31. Vanaja S, Belwal M. Aspect-level sentiment analysis on e-commerce data. In: international conference on inventive research in computing applications (ICIRCA), IEEE, pp. 1275–1279, 2018.

  32. Zhang W, Kong SX, Zhu YC. Sentiment classification and computing for online reviews by a hybrid SVM and LSA based approach. Cluster Computing. 2018. pp. 1–14

  33. Bansal Barkha, Srivastava Sangeet. Hybrid attribute based sentiment classification of online reviews for consumer intelligence. Appl Intell. 2019;49(1):137–49.

    Google Scholar 

  34. Guo Chonghui, Zhonglian Du, Kou Xinyue. Products ranking through aspect-based sentiment analysis of online heterogeneous reviews. J Syst Sci Syst Eng. 2018;27(5):542–58.

    Google Scholar 

  35. Bi Jian-Wu, Liu Yang, Fan Zhi-Ping. Representing sentiment analysis results of online reviews using interval type-2 fuzzy numbers and its application to product ranking. Inf Sci. 2019;504:293–307.

    Google Scholar 

Download references


The authors thank the anonymous reviewers for their helpful suggestions and comments.


The research received no external funding.

Author information

Authors and Affiliations



SK designed the idea, prepared the draft of manuscript and performed experiments. SK and MIS wrote the article. Both authors read and approved the final manuscript.

Corresponding author

Correspondence to P. Sasikala.

Ethics declarations

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher's Note

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

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Sasikala, P., Mary Immaculate Sheela, L. Sentiment analysis of online product reviews using DLMNN and future prediction of online product using IANFIS. J Big Data 7, 33 (2020).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:


  • Sentiment analysis
  • Sentiment analysis of online product reviews
  • Review analysis
  • Deep learning modified neural network (DLMNN)
  • Adaptive neuro-fuzzy inference system (ANFIS)
  • Improved ANFIS (IANFIS)