<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="4.4.2" xmlns="http://www.crossref.org/schema/4.4.2" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xsi:schemaLocation="http://www.crossref.org/schema/4.4.2 http://www.crossref.org/schema/deposit/crossref4.4.2.xsd">
<head>
<doi_batch_id>19c96fd517d854497e8-3854</doi_batch_id>
<timestamp>20220131051905096</timestamp>
<depositor>
  <depositor_name>beie:beie</depositor_name> 
  <email_address>director@blueeyesintelligence.org</email_address>
</depositor>
<registrant>WEB-FORM</registrant> 
</head>
<body>
<journal>
<journal_metadata>   <full_title>International Journal of Innovative Technology and Exploring Engineering</full_title>   <abbrev_title>IJITEE</abbrev_title>   <issn media_type='electronic'>22783075</issn>   <doi_data>     <doi>10.35940/ijitee</doi>     <resource>https://www.ijitee.org/</resource>   </doi_data> </journal_metadata> <journal_issue>  <publication_date media_type='online'>     <month>01</month>     <day>30</day>     <year>2022</year>   </publication_date>   <journal_volume>     <volume>11</volume>   </journal_volume>   <issue>3</issue> </journal_issue> <!-- ============== --> <journal_article publication_type='full_text'>   <titles>     <title>Machine Learning Models in Stock Market Prediction</title> </titles>   <contributors>      <organization sequence='first' contributor_role='author'>Associate Professor &amp; Dean, Department of Lords School of Computer Applications &amp; IT, Lords University, Alwar, Rajasthan, India.</organization>    <person_name sequence='first' contributor_role='author'>      <given_name>Dr. Gurjeet</given_name>      <surname>Singh</surname>    </person_name>  </contributors>     <jats:abstract xml:lang='en'>         <jats:p>The paper focuses on predicting the Nifty 50 Index by using 8 Supervised Machine Learning Models. The techniques used for empirical study are Adaptive Boost (AdaBoost), k-Nearest Neighbors (kNN), Linear Regression (LR), Artificial Neural Network (ANN), Random Forest (RF), Stochastic Gradient Descent (SGD), Support Vector Machine (SVM) and Decision Trees (DT). Experiments are based on historical data of Nifty 50 Index of Indian Stock Market from 22nd April, 1996 to 16th April, 2021, which is time series data of around 25 years. During the period there were 6220 trading days excluding all the non trading days. The entire trading dataset was divided into 4 subsets of different size-25% of entire data, 50% of entire data, 75% of entire data and entire data. Each subset was further divided into 2 parts-training data and testing data. After applying 3 tests- Test on Training Data, Test on Testing Data and Cross Validation Test on each subset, the prediction performance of the used models were compared and after comparison, very interesting results were found. The evaluation results indicate that Adaptive Boost, k- Nearest Neighbors, Random Forest and Decision Trees under performed with increase in the size of data set. Linear Regression and Artificial Neural Network shown almost similar prediction results among all the models but Artificial Neural Network took more time in training and validating the model. Thereafter Support Vector Machine performed better among rest of the models but with increase in the size of data set, Stochastic Gradient Descent performed better than Support Vector Machine.</jats:p>     </jats:abstract>  <publication_date media_type='online'>     <month>01</month>     <day>30</day>     <year>2022</year>   </publication_date>   <pages>     <first_page>18</first_page>     <last_page>28</last_page>   </pages>   <crossmark>     <crossmark_version>CC BY-NC-ND 4.0</crossmark_version>     <crossmark_policy>10.35940/BEIESP.CrossMarkPolicy</crossmark_policy>     <crossmark_domains>       <crossmark_domain>          <domain>www.ijitee.org</domain>       </crossmark_domain>     </crossmark_domains>     <crossmark_domain_exclusive>true</crossmark_domain_exclusive>   </crossmark>   <doi_data>     <doi>10.35940/ijitee.C9733.0111322</doi>     <resource>https://www.ijitee.org/portfolio-item/c97330111322/</resource>   </doi_data> </journal_article> <!-- ============== --> <journal_article publication_type='full_text'>   <titles>     <title>A Distinctive Approach for Detecting Fake News using Machine Learning</title> </titles>   <contributors>      <organization sequence='first' contributor_role='author'>Department of Information and Communication Technology, Comilla University, Cumilla, Bangladesh.</organization>    <person_name sequence='first' contributor_role='author'>      <given_name>Md. Rakib</given_name>      <surname>Hasan</surname>    </person_name>    <person_name sequence='additional' contributor_role='author'>       <given_name>Ismath Ara</given_name>       <surname>Itu</surname>     </person_name>     <organization sequence='additional' contributor_role='author'>Department of Management Information Systems, University of Dhaka, Dhaka, Bangladesh.</organization>   </contributors>     <jats:abstract xml:lang='en'>         <jats:p>Nowadays, social media platforms have evolved into an esoteric method for audiences to consume information. News spreading through the social network are also a great source of information as well. For the advancement of Internet access, the information consumption pattern is dramatically changing. As a consequence of those, fake news has become one of the prime concerns because of its potentiality to endanger a society in different perspectives as well as has a political and social impact. Because false news causes so much confusion among people, we will train a model to identify all types of fake news in response to public demand. For this respective research, we collect real data from many reliable and reputed online news portals and fake news from unreliable resources. For converting text to vector format Bag of Words is used. Besides TF-IDF is used for extracting the feature and then CNN is used for classification. With an 83.14% accuracy our model can efficiently detect fake and real news. This work paves a path for an easy automatic fake news detection system which will be very helpful for us to prevent spreading the false information and helps to find the truth.</jats:p>     </jats:abstract>  <publication_date media_type='online'>     <month>01</month>     <day>30</day>     <year>2022</year>   </publication_date>   <pages>     <first_page>29</first_page>     <last_page>35</last_page>   </pages>   <crossmark>     <crossmark_version>CC BY-NC-ND 4.0</crossmark_version>     <crossmark_policy>10.35940/BEIESP.CrossMarkPolicy</crossmark_policy>     <crossmark_domains>       <crossmark_domain>          <domain>www.ijitee.org</domain>       </crossmark_domain>     </crossmark_domains>     <crossmark_domain_exclusive>true</crossmark_domain_exclusive>   </crossmark>   <doi_data>     <doi>10.35940/ijitee.C9640.0111322</doi>     <resource>https://www.ijitee.org/portfolio-item/c97400111322/</resource>   </doi_data> </journal_article><!-- ============== --> <journal_article publication_type='full_text'>   <titles>     <title>Analysis of Variable Viscosity and Thermal Conductivity of MHD flow of Mixed Convection over a Nonlinear Vertical Stretching Sheet</title>   </titles>   <contributors>      <organization sequence='first' contributor_role='author'>Department of Mathematics, Assam University, Assam, India.</organization>    <person_name sequence='first' contributor_role='author'>      <given_name>Geeti</given_name>      <surname>Gogoi</surname>    </person_name>  </contributors>    <jats:abstract xml:lang='en'>         <jats:p>In this present study we examine analytically the MHD flow problem close by a stagnation point on a stretching sheet which is nonlinear. Similarity transformation is used to modify the fluid flow governing equations into a system of ordinary differential equations .The modified equations are resolved with the assist of MATLAB bvp4c. The influence of viscosity parameter, thermal conductivity parameter, suction parameter and magnetic parameter on velocity and temperature are computed and presented through graphs.</jats:p>     </jats:abstract>  <publication_date media_type='online'>     <month>01</month>     <day>30</day>     <year>2022</year>   </publication_date>   <pages>     <first_page>36</first_page>     <last_page>41</last_page>   </pages>   <crossmark>     <crossmark_version>CC BY-NC-ND 4.0</crossmark_version>     <crossmark_policy>10.35940/BEIESP.CrossMarkPolicy</crossmark_policy>     <crossmark_domains>       <crossmark_domain>          <domain>www.ijitee.org</domain>       </crossmark_domain>     </crossmark_domains>     <crossmark_domain_exclusive>true</crossmark_domain_exclusive>   </crossmark>   <doi_data>     <doi>10.35940/ijitee.C9743.0111322</doi>     <resource>https://www.ijitee.org/portfolio-item/c97430111322/</resource>   </doi_data> </journal_article>
</journal>
</body>
</doi_batch>
