<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Machine Learning Based Drug Recommendation from Sentiment Analysis of Drug Rating and Reviews</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Koteswara</forename><surname>Kodepogu</surname></persName>
						</author>
						<author>
							<persName><surname>Rao</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Dept of CSE</orgName>
								<orgName type="institution">PVP Siddhartha Institute of Institute of Technology</orgName>
								<address>
									<settlement>Vijayawada</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Kona</forename><surname>Sravya</surname></persName>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Bachelor of Technology</orgName>
								<orgName type="department" key="dep2">Dept of CSE</orgName>
								<orgName type="institution">PVP Siddhartha Institute of Institute of Technology</orgName>
								<address>
									<settlement>Vijayawada</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Kadamati</forename><surname>Jaya</surname></persName>
						</author>
						<author>
							<persName><forename type="first">Phanidra</forename><surname>Sai</surname></persName>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Bachelor of Technology</orgName>
								<orgName type="department" key="dep2">Dept of CSE</orgName>
								<orgName type="institution">PVP Siddhartha Institute of Institute of Technology</orgName>
								<address>
									<settlement>Vijayawada</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Gummadi</forename><surname>Giri</surname></persName>
						</author>
						<author>
							<persName><forename type="first">Ratna</forename><surname>Sai</surname></persName>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Bachelor of Technology</orgName>
								<orgName type="department" key="dep2">Dept of CSE</orgName>
								<orgName type="institution">PVP Siddhartha Institute of Institute of Technology</orgName>
								<address>
									<settlement>Vijayawada</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author role="corresp">
							<persName><forename type="first">Geetha</forename><surname>Ganesan</surname></persName>
							<email>geetha@advancedcomputingresearchsociety.org</email>
							<affiliation key="aff2">
								<orgName type="department">Advanced Computing Research Society</orgName>
								<address>
									<settlement>Chennai</settlement>
									<region>Tamilnadu</region>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Machine Learning Based Drug Recommendation from Sentiment Analysis of Drug Rating and Reviews</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">B84ECC970FA950A01FAEE5859A15FCD5</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-23T20:40+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Drug rating</term>
					<term>Sentiment</term>
					<term>machine Learning</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>A suggestion framework can help the client to make an arrangement out of necessities and propose educated choices from a great deal regarding confounded information. Suggestion from an investigation of feelings is by all accounts an incredible test as client created content is addressed involving human language in more ways than one. Many examinations have zeroed in on normal fields like surveys of electrical things, movies, and cafés, yet insufficient on wellbeing and clinical issues. Feeling examination of medical care overall and that of the medication encounters of people, specifically, may reveal extensive insight into how to zero in on working on general wellbeing and arrive at the right choice. In this work, we plan in addition carry out a medication recommender framework scheme that spread on feeling examination advancements taking place drug audits. The target of this examination is to construct a dynamic help stage to assist patients with accomplishing more huge decisions in drug determination. First and foremost, we propose a wistful estimation way to deal with drug surveys and produce evaluations on drugs. Furthermore, we receipts by what means much the medication audits are helpful to clients, patient's situations, and word reference opinion extremity of medication surveys into thought. Then, at that point, we intertwine those factors into the proposal framework to list suitable meds. Tests have been done utilizing Decision Tree, K Nearest Neighbours, and Linear Support Vector Classifier calculation in rating age and Hybrid model in proposal in light of the given open dataset. The investigation is kept out to melody the boundaries for every calculation to accomplish more prominent execution. At long last, Linear Support Vector Classifier is chosen intended for rating age to get a decent compromise in the middle of model exactness, model effectiveness, then model versatility.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>With the impact of Web 2.0 stages, there are enormous measures of content made by customers, called internet-based media. Consequently, an excessive number of researchers have been investigating capable calculations for feeling examination of content made by purchasers throughout the most recent ten years. The area of feeling investigation, otherwise called assessment mining, examinations the conclusions, insights, convictions, decisions, perspectives, and feelings of individuals, including items, administrations, associations, characters, occasions and points. Lately, these two spaces of utilization have gotten extraordinary interest. In nostalgic exploration, the investigations are by and large partitioned into two classes, positive and negative. Yet, in the event that every one of up-and-comers' items reflect good or gloomy sentiments it is hard for individuals to decide. To settle on a choice, individuals need not exclusively to know whether the item is great yet in addition how great it is. It is additionally acknowledged that different individuals have various inclinations for nostalgic articulation. Thus, it is additional essential to offer mathematical notches rather than paired choices in numerous useful cases, for example, drug suggestion and fabricates an arrangement of choice help that helps individuals in choosing items. This new application field presents the two difficulties and examination valuable open doors in clinical wellbeing. A proposal system intends to anticipate the inclinations of clients and make ideas that would bear some significance with clients. Cooperative sifting (CF), content based (CB), and information based (KB), and half-breed proposal advancements, all of which have specific limits, are closed by conventional suggestion innovation. CB has overspecialized suggestions and CF dislikes sparsity, adaptability, and cold-start issue. Yet, a few scientists zeroed in on drug proposal framework from client audits, and have demonstrated that the opinion investigation of medical services overall and that of client's medication experience, specifically, could reveal critical insight into the interaction to work on general wellbeing and settle on the best choices, and this framework joins with customary suggestion framework is more successful. In our exploration, we are centered on assessment mining in drug audits, in which patients share their encounters and conclusions about prescriptions and afterward group the suppositions into appraisals, and even suggest a medicine list that would be generally suitable for the patient. Executing the proposed way to deal with feeling examination won't simply be helpful to patients yet in addition to drug specialists and clinicians for significant popular assessment synopses.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Problem Statement</head><p>Proposal from an investigation of opinions is by all accounts an incredible test as client produced content is addressed involving human language in more than one way. Feeling investigation of medical services overall and that of the medication encounters of people, specifically, may reveal significant insight into how to zero in on working on general wellbeing and arrive at the right choice. For our situation, we are executing directed AI calculations which remain utilized to create assessment from drug audit and suggestion model that recommend a suitable prescription to eliminate the particular condition.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Objective</head><p>Suggestions procedures expect to give buyers customized labour and products to adapt to the developing issue of over-burdening on the web data. Reads up involved various techniques for feeling examination, and since the mid1990s, recommender model procedures have been suggested. Many early explores focus on report level review and allude to e-business, e-government, e-learning, web based business/e-shopping, e-the travel industry, and so on Notwithstanding, the universe of medication contains uncommon suggesting advances. This task expects to introduce a medication recommender framework that can radically diminish expert's load. AI has been important in in numerous applications, and there is an expansion in inventive work for computerization. In this examination, we fabricate a medication proposal framework that utilizes patient surveys to anticipate the opinion utilizing different vectorization processes like Manual Feature Analysis, which can assist with suggesting the top medication for a given infection by various characterization calculations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Proposed Work</head><p>Our medication rating age and recommender framework system essentially comprises five modules, should be visible in Figure <ref type="figure">beneath</ref>, which be situated information pre-handling building block (including highlight taking out), rating age module, model assessment module, word reference feeling investigation module, and proposal model module. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Data Pre-processing</head><p>Information cleaning is the strategy for finding and fixing (or eliminating) harmed or blemished data from a record set, which alludes to finding absent, mistaken, deficient, or insignificant segments of the information and afterward adding, changing, or erasing filthy or coarse information. Legitimate information planning is a necessary advance, for a substantial trial as well as in any case to permit the mining of a dataset utilizing the method for AI. An assortment of pre-handling steps expected to permit the AI framework and calculations to peruse and investigate the information, just as to diminish the dataset to contain the essential items and qualities for the examination. Essentially, the creation or estimation of extra ascribes from the information could likewise be significant assuming such determined traits may help the examination and in this manner permit better forecasts. At the point when we've utilized online media information, the informational indexes should be cleaned astutely. Basically, online media information can't be handled in a solitary manner. Consequently, we involved our procedures for appropriately investigating opinions to tidy up that information.</p><p>These are the subsequent tools we rummage-sale for pre-processing our drug dataset:</p><formula xml:id="formula_0">• Tokenization • Stop word • Handling Negative Adjectives • Stemming</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Feature Extraction</head><p>Machines can't get characters and words. So, when managing message information we really want to address it in numbers to be perceived by the machine</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Count Vectorizer</head><p>Count Vectorizer is a technique to change text over to mathematical information. It makes a grid in which every extraordinary word is addressed by a segment of the framework, and every text test from the report is a line in the lattice. The worth of every cell is only the include of the word in that specific message test.</p><p>Machines can't get characters and words. So, when managing message information, we really want to address it in numbers to be perceived by the machine. Count vectorizer is a technique to change text over to mathematical information.</p><p>CountVectorizer is an exceptional gadget given by the scikit-learn library in Python. It is used to change a given text into a vector in light of the repeat (count) of each word that occurs in the entire text. This is useful when we have different such texts, and we wish to change over each word in every text into vectors (for utilizing in additional text examination). Count Vectorization includes counting the quantity of events each words shows up in a report (unmistakable text like an article, book, even a passage). It likewise empowers the pre-handling of message information preceding creating the vector portrayal. This usefulness makes it a profoundly adaptable component portrayal module for text. Count Vectorizer makes it simple for text information to be utilized straightforwardly in AI and profound learning models like text order.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Method</head><p>The 3 administered AI calculations which be situated utilized to create rating from drug audit in addition proposal model that prescribe a suitable prescription to eliminate the particular condition are as per the following:</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Decision Tree (DT)</head><p>Perhaps the most broadly involved progressive models for directed discovering that distinguishes neighborhood districts as series of recursive partition through choice hubs in the test work. The instinct behind the calculation of the choice tree is straightforward, yet at the same time very strong. It segments data into two subsections to keep the information in each fragment extremely homogeneous (all information in the section is of a comparative objective class) than the prior/substitute subsections; the two subsections can then be disconnected again before the homogeneity or later based halting edges are met. In extending the decision tree, a comparable marker limit can be applied to many spots. An authoritative place of parcel is to survey the right element associated with the legitimate edge to assemble subgroup/branch homogeneity.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Naïve-Bayes (NB)</head><p>It is a characterization strategy in light of Bayes' Theorem with an assumption of opportunity among pointers. In clear terms, a Naive Bayes classifier acknowledges that the presence of a particular part in a class is immaterial to the presence of another component. Gullible Bayes model is easy to gather and particularly significant for very gigantic educational assortments. Close by ease, Naive Bayes is known to outmaneuver even astoundingly present day gathering systems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Gaussian naïve Bayes 2. Multinomial naïve Bayes</head><p>Bayes theorem provides a way of calculating posterior probability P(c|x) from P(c), P(x) and P(x|c). Look at the equation below: P(c|x) = (P(x|c)*P(c))/P(x)</p><p>Where, P(c|x) is the posterior probability of class (c, target) given predictor (x, attributes). P(c) is the prior probability of class. P(x|c) is the probability which is the likelihood of indicator given class. P(x) is the earlier likelihood of indicator. Exactly when doubt of independence holds, a Naive Bayes classifier performs better differentiation with various models like determined backslide and you truly need less planning data. It performs well in the event that there ought to emerge an event of full scale input factors diverged from numerical variable(s). For numerical variable, normal allotment is acknowledged (ring twist, which is a strong speculation).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Support Vector Machine (SVM)</head><p>The SVM thought relies upon the Structural Risk Minimization rule of computational learning speculation <ref type="bibr">[24]</ref> and conceivably the most strong and convincing strategy used in AI. In this speculation, data is evaluated and the restrictions of decisions are portrayed by having hyper planes. By virtue of data that can't be easily disengaged, it utilizes 4 section structures for request tasks including straight, polynomial, outspread based, and sigmoid limits by arranging the information data into highlayered component space to allow the data supportively particular. The hyper plane parcels the text vectors of each class with the end goal that the capability is held as broad as could be anticipated. Straight SVC is undifferentiated from SVC with limit kernel='linear'. Learning the hyper plane in straight SVM occurs by using direct polynomial math to change the issue. Clear information is that, rather than using insights themselves, the direct SVM is generally rephrased using inward thing with any two components. A measure of the expansion of the data regards for each pair is the inward thing between two vectors. The condition for making a gauge for data using the spot thing between the information (X) and each help vector not entirely settled as follows:</p><formula xml:id="formula_2">F(X) = Bo + ∑ Ai(X, Xi)<label>(2)</label></formula><p>The condition no. 1 includes the working out of the internal results of another info vector (X) with all help vectors in preparing information. From the preparation information on the learning calculation, coefficients Bo and Ai (for each information) should be determined. The dab item is known as the piece and can be re-composed as:</p><formula xml:id="formula_3">K(X, Xi) = ∑ (X*Xi)<label>(3)</label></formula><p>The piece chooses the equivalence or distance of new data from help vectors. The bit thing is an extent of similarity used for straight SVM or an immediate part since the distance between the information sources is immediate show <ref type="bibr">[24]</ref>. Proposition Model: We are familiar with anticipating what a purchaser will give the "rate" or "tendency." Recommendation engines are mechanical assemblies for data filtering that use computations and data to enlighten a lone customer in regards to the primary things. Then again they are only a motorized sort of a "shop counterman". For a thing, you ask him, he shows the prescription just as the things you would purchase. They are particularly ready in decisively pitching and up selling. As there is growing data on the Internet and the amount of customers has extended essentially, looking, arranging, and outfitting associations with the information they need, according to their tendencies and tastes, is huge.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Dictionary Sentiment Analysis</head><p>In the examination of word reference feeling, we performed enthusiastic investigation utilizing a passionate word reference to determine the constraints of the bundle worked with the information from motion pictures. To compensate for this, we utilized the Harvard enthusiastic word reference to play out extra passionate evaluations. To begin with, we count the quantity of words remembered for the word reference and determined positive proportion in pre-handled information.</p><p>Positive Ratio = n(P)/(n(P)+n(N)) (4)</p><p>Where: n(P) is the number of positive words in the review and n(N) is the number of negative words in the review Assuming the proportion is under 0.5, we have ordered it as negative and in the event that it is more noteworthy than 0.5, we have grouped it as certain. We reviewed it as nonpartisan with leftovers, which incorporates the sentence with no sure or negative terms.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Experimental Results</head><p>For building this model, we use the dataset of drug reviews. The dataset contains data like the drug name, the condition the patient is in while using the drug, date the review collected on, useful count which is the number of people found the review helpful, rating given by the user for the drug and finally, the detailed review given by the user.</p><p>Since the rating is on the scale 1-10 in the dataset, to reduce the number of classes a review falls in, we brought down the rating to the scale For removing stop words, we used the Natural Language Toolkit (NLTK) in Python. The NLTK library contains stop words from 16 different languages. Since the reviews are in English, we used the list of English stop words. Since sets in Python provide better Time Complexity for searching, we converted the list into a Python set before searching for a word in stop words.</p><p>For Tokenization, we used the Regular Expression(re) module in python. Also, instead of dealing with alphabets of uppercase and lowercase separately, we converted all uppercase alphabets to lowercase.</p><p>For Stemming, we used the Porter Stemmer algorithm in the NLTK module. Porter Stemmer is the widely used algorithm for stemming words in English language.</p><p>The following image includes all the steps we used for pre-processing We stored the result of the pre-processing steps in a Python list "corpus". The 'corpus' list contains the refined reviews, which is then used for the further steps.</p><p>After Pre-processing, we extracted features using the CountVectorizer from the Scikit-learn library. We limited the maximum allowed features to 10,000 which is the nearest round figure to eliminate the less-frequent words that are likely to be un-useful. Also, we used only the first 10,400 reviews, considering the size of the dataset, which approximately contains 53,000 reviews.     For Dictionary Sentiment Analysis, we refined the Harvard emotional dictionary csv file into 2 files-one consisting of positive words and the other consisting of negative words. We imported the csv files and stored in 2 Python sets. Later, we had added some code to count the number of positive and negative words in each review and to calculate Dictionary Sentiment polarity of the review.   The next step we did is to create a dictionary containing conditions and drug names and the mean of scores of each drug for the specified condition.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Gaussian Naïve Bayes Classifier</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 12: Creating dictionary</head><p>The last step is to prescribe take the list of conditions the patient is suffering from and to recommend the top-3 drugs for each condition along with the recommended score for each drug. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Input and Output Parameters</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Implementation Results</head><p>Reducing the Scale of Ratings After pre-processing the following review, the refined review generated is shown below:</p><p>"This med was given as a result of a deep gouge from a dog nail. healing was not occurring after 4 weeks including a trip to an ambulatory care. my doc said they treated it incorrectly. he prescribed this. i have an appointment at the wound center Tues. dr also said it needed debriding. after 5 days i see no improvement. if anything, the area is more red and sore."   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>At last, the Naïve Bayes model is chosen for rating age to get a decent compromise among model exactness (60.0%), model productivity, and model versatility where this outcome is utilized in Hybrid Recommendation Model to list proper meds.</p><p>• Notwithstanding it, we directed the passionate investigation utilizing an enthusiastic word reference to defeat constraints of the medication information utilized.</p><p>• In the last investigation this study shows that the wistful qualities contribute significantly to the expectation of medication rating, just as suggestions. It additionally shows huge enhancements for a genuine world dataset contrasted with current techniques.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Future Scope</head><p>The scope of this task is that while assessing the unique circumstance, we can track down more phonetic standards, and to fuse state level opinion examination, we might adjust or fabricate half and half factorization models like tensor factorization, or profound learning strategies. The venture can likewise be stretched out to improve the exactness and unwavering quality of the proposal model further.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Proposed methodologies</figDesc><graphic coords="3,119.15,72.00,356.55,236.44" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Removing Stop words</figDesc><graphic coords="6,180.40,280.18,232.25,136.49" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Pre Processing</figDesc><graphic coords="6,143.55,619.83,308.20,123.75" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Features Extraction</figDesc><graphic coords="7,116.65,173.19,359.60,84.75" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Train data and test data We used 3 classification algorithms namely-Gaussian Naïve Bayes Classifier, Decision Tree Classier and Support Vector Classifier for generating rating.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: Gaussian Naïve Bayes Classifier</figDesc><graphic coords="7,113.93,447.39,367.45,57.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 7 :Figure 8 :</head><label>78</label><figDesc>Figure 7: Decision Tree Classifier</figDesc><graphic coords="7,123.40,548.86,348.43,64.70" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 9 :</head><label>9</label><figDesc>Figure 9: Calculate Dictionary Sentiment polarity</figDesc><graphic coords="8,154.90,296.57,285.50,134.25" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 10 :</head><label>10</label><figDesc>Figure 10: Dictionary Sentiment polarity calculation</figDesc><graphic coords="8,165.65,458.42,263.65,152.99" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Figure 11 :</head><label>11</label><figDesc>Figure 11: Score Calculation</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_10"><head>Figure 13 :</head><label>13</label><figDesc>Figure 13: Reducing the scale of ratings Pre-Processing:</figDesc><graphic coords="10,96.15,298.77,401.07,82.75" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_11"><head>Figure 14 :Figure 15 :Figure 16 :</head><label>141516</label><figDesc>Figure 14: Import text wrap</figDesc><graphic coords="10,97.85,503.04,397.50,62.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_12"><head>Figure 17 :</head><label>17</label><figDesc>Figure 17: Score calculation</figDesc><graphic coords="11,72.00,220.37,451.15,100.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_13"><head>FigureFigure 19 :</head><label>19</label><figDesc>Figure 18: Grouping Conditions</figDesc><graphic coords="11,113.15,439.92,368.25,105.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="9,75.65,109.95,444.00,126.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 :</head><label>1</label><figDesc>Accuracy</figDesc><table><row><cell>Classifier</cell><cell>Accuracy (%)</cell></row><row><cell>Naïve Bayes</cell><cell>60.41</cell></row><row><cell>Decision Tree Classifier</cell><cell>56.63</cell></row><row><cell>Support Vector Classifier</cell><cell>56.83</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Reducing the Scale of Ratings:</head><label></label><figDesc></figDesc><table><row><cell cols="3">Calculating Score of Each Review:</cell></row><row><cell>INPUT</cell><cell>:</cell><cell>Data frame containing Dictionary Sentiment Polarity and ratings</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Data frame containing score for each review.</cell></row><row><cell cols="3">Grouping Conditions and Drugs:</cell></row><row><cell>INPUT</cell><cell>:</cell><cell>Data frame containing score or each review</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>A Python Dictionary containing conditions, drugs and the mean</cell></row><row><cell></cell><cell></cell><cell>score of drugs</cell></row><row><cell cols="2">Recommending Drugs:</cell><cell></cell></row><row><cell>INPUT</cell><cell>:</cell><cell>A Python list containing the conditions patients has.</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Recommended Drugs in decreasing order of their scores</cell></row><row><cell>INPUT</cell><cell>:</cell><cell>Data frame with ratings on the scale of 1-10</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Data frame with ratings on the scale of 1-5</cell></row><row><cell>Pre-Processing</cell><cell></cell><cell></cell></row><row><cell>INPUT</cell><cell>:</cell><cell>Data frame with unprocessed data</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>A Python list containing the reviews that are tokenized, stemmed and</cell></row><row><cell></cell><cell></cell><cell>free from stop words.</cell></row><row><cell>Count Vectorizer:</cell><cell></cell><cell></cell></row><row><cell>INPUT</cell><cell>:</cell><cell>The Python list containing reviews.</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>A matrix of with each cell containing the number of</cell></row><row><cell></cell><cell></cell><cell>occurrences of a word(column) in each review(row)</cell></row><row><cell cols="2">Naïve Bayes Classifier:</cell><cell></cell></row><row><cell>INPUT</cell><cell>:</cell><cell>The count vectorizer matrix with 7000 rows</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Naïve Bayes classifier</cell></row><row><cell cols="2">Decision Tree Classifier:</cell><cell></cell></row><row><cell>INPUT</cell><cell>:</cell><cell>The count vectorizer matrix with 7000 rows</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Decision Tree classifier</cell></row><row><cell cols="2">Support Vector Classifier:</cell><cell></cell></row><row><cell>INPUT</cell><cell>:</cell><cell>The count vectorizer matrix with 7000 rows</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Support Vector classifier</cell></row><row><cell cols="3">Dictionary Sentiment Polarity:</cell></row><row><cell>INPUT</cell><cell>:</cell><cell>Data frame containing reviews</cell></row><row><cell>OUTPUT</cell><cell>:</cell><cell>Data frame containing Dictionary Sentiment Polarity of each review.</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">B</forename><surname>Liu</surname></persName>
		</author>
		<title level="m">Sentiment Analysis (Introduction and Survey) and Opinion Mining</title>
				<imprint>
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Rating Prediction Based on Social Sentiment from Textual Reviews</title>
		<author>
			<persName><forename type="first">X</forename><surname>Lei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Qian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Zhao</surname></persName>
		</author>
		<idno type="DOI">10.1109/TMM.2016.2575738</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Multimed</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="issue">9</biblScope>
			<biblScope unit="page" from="1910" to="1921" />
			<date type="published" when="2016-09">Sep. 2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">An intelligent medicine recommender system framework</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Bao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Jiang</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICIEA.2016.7603801</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2016 IEEE 11th Conference on Industrial Electronics and Applications</title>
				<meeting>the 2016 IEEE 11th Conference on Industrial Electronics and Applications<address><addrLine>ICIEA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2016-10">2016. Oct. 2016</date>
			<biblScope unit="page" from="1383" to="1388" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">PeopleSave: Recommending effective drugs through web crowdsourcing</title>
		<author>
			<persName><forename type="first">R</forename><surname>Majethia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Mishra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Singhal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lakshmi Manasa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Sahiti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Nandwani</surname></persName>
		</author>
		<idno type="DOI">10.1109/COMSNETS.2016.7440000</idno>
	</analytic>
	<monogr>
		<title level="m">2016 8th International Conference on Communication Systems and Networks</title>
				<meeting><address><addrLine>COMSNETS</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2016-03">2016. Mar. 2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">A recommendation system based on domain ontology and SWRL for anti-diabetic drugs selection</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">C</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">H</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">T</forename><surname>Bau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Chen</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2011.09.061</idno>
	</analytic>
	<monogr>
		<title level="j">Expert Syst. Appl</title>
		<imprint>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="3995" to="4006" />
			<date type="published" when="2012-03">Mar. 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Sentiment Analysis of User-Generated Content on Drug Review Websites</title>
		<author>
			<persName><forename type="first">J.-C</forename><surname>Na</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">Y M</forename><surname>Kyaing</surname></persName>
		</author>
		<idno type="DOI">10.1633/jistap.2015.3.1.1</idno>
	</analytic>
	<monogr>
		<title level="j">J. Inf. Sci. Theory Pract</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="6" to="23" />
			<date type="published" when="2015-03">Mar. 2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">A novel method for sentiment classification of drug reviews using fusion of deep and machine learning techniques</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">E</forename><surname>Basiri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Abdar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Cifci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Nemati</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><forename type="middle">R</forename><surname>Acharya</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.knosys.2020.105949</idno>
	</analytic>
	<monogr>
		<title level="j">Knowledge-Based Syst</title>
		<imprint>
			<biblScope unit="volume">198</biblScope>
			<biblScope unit="page">105949</biblScope>
			<date type="published" when="2020-06">Jun. 2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">Sentiment Analysis in Drug Reviews using Supervised Machine Learning Algorithms</title>
		<author>
			<persName><forename type="first">S</forename><surname>Vijayaraghavan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Basu</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/2003.11643" />
		<imprint>
			<date type="published" when="2020-03">Mar. 2020. Nov. 20, 2020</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Automated Drug Suggestion Using Machine Learning</title>
		<author>
			<persName><forename type="first">V</forename><surname>Doma</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-39442-4_42</idno>
	</analytic>
	<monogr>
		<title level="m">Advances in Intelligent Systems and Computing</title>
				<imprint>
			<publisher>AISC</publisher>
			<date type="published" when="2020-03">Mar. 2020</date>
			<biblScope unit="volume">1130</biblScope>
			<biblScope unit="page" from="571" to="589" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">TRecs: Time-aware twitter-based drug recommender system</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">A</forename><surname>Hamed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Roose</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Branicki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rubin</surname></persName>
		</author>
		<idno type="DOI">10.1109/ASONAM.2012.178</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012</title>
				<meeting>the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012</meeting>
		<imprint>
			<date type="published" when="2012">2012</date>
			<biblScope unit="page" from="1027" to="1031" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">A epilepsy drug recommendation system by implicit feedback and crossing recommendation</title>
		<author>
			<persName><forename type="first">C</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Fan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Liu</surname></persName>
		</author>
		<idno type="DOI">10.1109/SmartWorld.2018.00197</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings -2018 IEEE SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People and Smart City Innovations</title>
				<meeting>-2018 IEEE SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People and Smart City Innovations</meeting>
		<imprint>
			<publisher>SmartWorld/UIC/ATC/ScalCom/CBDCo</publisher>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">ContextAwareness Based Personalized Recommendation of AntiHypertension Drugs</title>
		<author>
			<persName><forename type="first">D</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">T</forename><surname>Goh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wei</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10916-016-0560-z</idno>
	</analytic>
	<monogr>
		<title level="j">J. Med. Syst</title>
		<imprint>
			<biblScope unit="volume">40</biblScope>
			<biblScope unit="issue">9</biblScope>
			<biblScope unit="page" from="1" to="10" />
			<date type="published" when="2016-09">Sep. 2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">A method for inferring medical diagnoses from patient similarities</title>
		<author>
			<persName><forename type="first">A</forename><surname>Gottlieb</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">Y</forename><surname>Stein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Ruppin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">B</forename><surname>Altman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Sharan</surname></persName>
		</author>
		<idno type="DOI">10.1186/1741-7015-11-194</idno>
	</analytic>
	<monogr>
		<title level="j">BMC Med</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page">194</biblScope>
			<date type="published" when="2013-09">Sep. 2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">Antioxidative Properties of Xanthan on the Autoxidation of Soybean Oil in Cyclodextrin Emulsion</title>
		<author>
			<persName><forename type="first">K</forename><surname>Shimada</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Fujikawa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Yahara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Nakamura</surname></persName>
		</author>
		<ptr target="https://pubs.acs.org/sharingguidelines" />
		<imprint>
			<date type="published" when="1992-07-29">1992. Jul. 29, 2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">A framework of hybrid recommender system for personalized clinical prescription</title>
		<author>
			<persName><forename type="first">Q</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Lu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Wu</surname></persName>
		</author>
		<idno type="DOI">10.1109/ISKE.2015.98</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings -The 2015 10th International Conference on Intelligent Systems and Knowledge Engineering</title>
				<meeting>-The 2015 10th International Conference on Intelligent Systems and Knowledge Engineering<address><addrLine>ISKE</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2015-01">2015. Jan. 2016</date>
			<biblScope unit="page" from="189" to="195" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
