Predicting and Prohibiting the Risk of Heart Failure Using Machine Learning

[{“box”:0,”content”:”

Year : July 6, 2023 | Volume : 01 | Issue : 01 | Page : 15-20

n

n

n

n

n

n

By

n

n

    n t

  1. [foreach 286]
  2. n

n

n

Sumit Mali, Aashish Gaike, Sanskriti Sharma, Shruti Tomake, Aishwarya Sapre

n

n

    n t

  1. n

n[/foreach]

n

n

    [foreach 286] [if 1175 not_equal=””]n t

  1. Assistant Professor, Student, Student, Student, Student,NBN Sinhgad School of Engineering, NBN Sinhgad School of Engineering, NBN Sinhgad School of Engineering, NBN Sinhgad School of Engineering, NBN Sinhgad School of Engineering,Maharashtra, Maharashtra, Maharashtra, Maharashtra, Maharashtra,India, India, India, India, India
  2. n[/if 1175][/foreach]

n

n

n

n

n

Abstract

nIt is challenging to estimate the likelihood of complex chronic disease while treating conditions like heart failure. The application of machine learning (ML), an area of artificial intelligence (AI), in cardiovascular care is growing quickly. In essence, it defines how computers classify and understand data, or choose a task with or without human intervention. The theoretical underpinnings of machine learning (ML) are models that accept input data (such as images or text) and forecast results using a combination of mathematical optimisation and statistical analysis (e.g., favourable, unfavourable, or neutral). Aiming to deliver results with an accuracy of 97.5%, the Heart Failure Prediction Model is based on machine learning algorithms like Random Forest and Logistic Regression. It includes sections that list the symptoms of cardiovascular diseases, offer preventative measures, and allow users to schedule doctor appointments. In order to create a prediction model based on machine learning, this document tries to capture the system needs and features. By using that, we can estimate the risk of heart disease. Heart disease sym ptoms can be reduced and understood with the help of machine learning (ML). choosing particular qualities. Additionally, the website is a subscription-based model with a unique attribute that includes several courses at various price points that are offered on the website related to their everyday activities. It consists of a yoga instructor and a nutritionist who will advise the customer on correct diet plans and exercise regimens.

n

n

n

Keywords: ML (Machine Learning), AI (Artificial Intelligence), Random forest, Logistic Regression, heart failure prediction models,

n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Computer Science Languages(ijcsl)]

n

[/if 424][if 424 equals=”Special Issue”][This article belongs to Special Issue under section in International Journal of Computer Science Languages(ijcsl)][/if 424][if 424 equals=”Conference”]This article belongs to Conference [/if 424]

n

n

n

How to cite this article:
nSumit Mali, Aashish Gaike, Sanskriti Sharma, Shruti Tomake, Aishwarya Sapre Predicting and Prohibiting the Risk of Heart Failure Using Machine Learning ijcsl July 6, 2023; 01:15-20

n

How to cite this URL:nSumit Mali, Aashish Gaike, Sanskriti Sharma, Shruti Tomake, Aishwarya Sapre Predicting and Prohibiting the Risk of Heart Failure Using Machine Learning ijcsl July 6, 2023 {cited July 6, 2023};01:15-20. nAvailable from: https://journals.stmjournals.com/ijcsl/article=July 6, 2023/view=0/

n


nn

Full Text

n[if 992 equals=”Open Access”]https://storage.googleapis.com/journals-stmjournals-com-wp-media-to-gcp-offload/2023/07/a4a8ad56-15-20-predicting-and-prohibiting-the-risk-of-heart-failure-using-machine.pdf [else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {ndocument.write(‘‘);ndocument.write(‘https://storage.googleapis.com/journals-stmjournals-com-wp-media-to-gcp-offload/2023/07/a4a8ad56-15-20-predicting-and-prohibiting-the-risk-of-heart-failure-using-machine.pdf’);n} else if (fieldValue === ‘administrator’) {ndocument.write(‘‘);ndocument.write(”);n}else if (fieldValue === ‘ijcsl’) {n document.write(‘‘);n} else {n document.write(‘ ‘);n}n [/if 992]nn


nn[if 379 not_equal=””]n

Browse Figures

n

n

[foreach 379]n

n[/foreach]n

nn

n

n[/if 379]n

n

References

n[if 1104 equals=””]n

1. Singh A, Kumar R. Heart disease prediction using machine learning algorithms. In 2020 international conference on electrical and electronics engineering (ICE3) 2020 Feb 14 (pp. 452–457). IEEE.
2. Anuja Bhosale, Gayatri Gadas, et al. Detection of Phishing Websites Using Machine Learning. International Journal of Advanced Research in Computer and Communication Engineering. 2022;11(6):490–494.
3. Beck DE, Roberts PL, Rombeau JL, Stamos MJ, Wexner SD. Colon and Rectal Trauma and Rectal Foreign Bodies. 2009.
4. Singhal N, Konguvel E. An Approach for Restaurant Management System during Covid-19. In 2022 International Conference on Computer Communication and Informatics (ICCCI) 2022 Jan 25 (pp. 1–6). IEEE.
5. Chang V, Bhavani VR, Xu AQ, Hossain MA. An artificial intelligence model for heart disease detection using machine learning algorithms. Healthcare Analytics. 2022 Nov 1;2:100016.
6. Greenberg B, Brann A, Campagnari C, Adler E, Yagil A. Machine Learning Applications in Heart Failure Disease Management: Hype or Hope?. Current Treatment Options in Cardiovascular Medicine. 2021 Jun;23(6):35.
7. Ho IM, Cheong KY, Weldon A. Predicting student satisfaction of emergency remote learning in higher education during COVID-19 using machine learning techniques. Plos one. 2021 Apr 2;16(4):e0249423.
8. Wang T, Hansen KR, Loving J, Paschalidis IC, van Aggelen H, Simhon E. Predicting Antimicrobial Resistance in the Intensive Care Unit. arXiv preprint arXiv:2111.03575. 2021 Nov 5.
9. Machine Learning Optimization: Basics & 7 Essential Techniques. Aporia. 2023. Available from: https://www.aporia.com/learn/machine-learning-model/machine-learning-optimization-basics-7-essential-techniques/
10. learning machine. Random Forest. Learning Machine Learning. 2023. Available from: https://learningmachine.hashnode.dev/random-forest

nn[/if 1104][if 1104 not_equal=””]n

    [foreach 1102]n t

  1. [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
  2. n[/foreach]

n[/if 1104]

nn


nn[if 1114 equals=”Yes”]n

n[/if 1114]

n

n

Regular Issue Subscription Review Article

n

n

n

n

n

International Journal of Computer Science Languages

n

[if 344 not_equal=””]ISSN: [/if 344]

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

Volume 01
Issue 01
Received June 7, 2023
Accepted June 20, 2023
Published July 6, 2023

n

n

n

[if 1190 not_equal=””]n

Editor

n

[foreach 1188]n

n[/foreach]

n[/if 1190] [if 1177 not_equal=””]n

Reviewer

n

[foreach 1176]n

n[/foreach]

n[/if 1177]

n

Edit n function myfun() {n x=document.getElementById(“editor”);n y=document.getElementById(“down”);n z=document.getElementById(“up”);n if(x.style.display==”none”){n x.style.display=”block”;n }n else {n x.style.display=”none”;n }n if(y.style.display==”none”){n y.style.display=”block”;n }n else {n y.style.display=”none”;n }n if(z.style.display==”none”){n z.style.display=”block”;n }n else {n z.style.display=”none”;n }n }n function myfun2() {n x=document.getElementById(“reviewer”);n y=document.getElementById(“down2”);n z=document.getElementById(“up2″);n if(x.style.display==”none”){n x.style.display=”block”;n }n else {n x.style.display=”none”;n }n if(y.style.display==”none”){n y.style.display=”block”;n }n else {n y.style.display=”none”;n }n if(z.style.display==”none”){n z.style.display=”block”;n }n else {n z.style.display=”none”;n }n }n

n

n

n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;}n else {x.style.display = “Block”;}}n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);});n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);});n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));}n function currentSlide(n) {n showSlides((slideIndex = n));}n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) {slideIndex = 1;}n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n

“}]