<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">reapress</journal-id>
      <journal-id journal-id-type="publisher-id">null</journal-id>
      <journal-title>reapress</journal-title><issn pub-type="ppub">3042-2248</issn><issn pub-type="epub">3042-2248</issn><publisher>
      	<publisher-name>reapress</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">https://doi.org/10.48313/maa.vi.57</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Efforts that disregard outcome, Efforts to raise outcome, Efforts to steel outcome, Effort based outlook learning model, Information set, Pervasive information set.</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Development of the Efforts-Based Outlook Learning Models Using Information Set Theory</article-title><subtitle>Development of the Efforts-Based Outlook Learning Models Using Information Set Theory</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Hanmandlu</surname>
		<given-names>Madasu </given-names>
	</name>
	<aff>Department of Electrical Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016, India.</aff>
	</contrib><contrib contrib-type="author">
	<name name-style="western">
	<surname>Grover</surname>
		<given-names>Jyotsana </given-names>
	</name>
	<aff>Birla Institute of Technology and Science, Pilani, India.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>06</month>
        <year>2024</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>19</day>
        <month>06</month>
        <year>2024</year>
      </pub-date>
      <volume>1</volume>
      <issue>2</issue>
      <permissions>
        <copyright-statement>© 2024 reapress</copyright-statement>
        <copyright-year>2024</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.5/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p></license>
      </permissions>
      <related-article related-article-type="companion" vol="2" page="e235" id="RA1" ext-link-type="pmc">
			<article-title>Development of the Efforts-Based Outlook Learning Models Using Information Set Theory</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			This paper presents the conceptualization of efforts in the formulation of Effort Based Outlook Learning Models (EB-OLMs), named as Efforts that Disregard Outcome (EDO), Efforts to Raise Outcome (ERO), and Efforts to Steel Outcome (ESO). The efforts are put in achieving a goal or an objective by a contender for success. The outlook of each contender is modelled by the way efforts are contemplated. We have used some of elements of the information set theory in the construction of EB-OLMs. The superiority of these models over some well-known Meta-heuristic techniques is demonstrated on some standard optimization functions.  The design of both the classifier and predictor showcases the applicability of EB-OLMS in learning their parameters through two case studies. The first case study presents the formulation of a classifier for the detection of retinal diseases whereas the second case study is that of a predictor for the prediction of heart diseases.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>null</p>
    </ack>
  </back>
</article>