Heart <span>diseases have a severe impact on human life and health. Cardiovascular deaths and diseases have increased at a fast rate worldwide. The early prediction of these diseases is necessary to prevent deaths. Now a day; a considerable amount of medical information is available and collected as databases. An efficient technique is required to analyse this data and predict the disease. Clustering can help medical practitioners in diagnosis by classifying the patient’s data collected for a disease. Clustering techniques can analyse such data based on each patient-generated and predict disease. A new prediction model based on salp swarm algorithm and support vector machine is proposed in this research for predicting heart diseases. Salp swarm algorithm is used to select the useful features from the database. Support vector machine classifier is used to predict heart diseases. Results obtained are compared with the other algorithms available in the literature. It is observed that the proposed approach produces better results with accuracy 98.75% and 98.46% with the dataset 1 and 2, respectively. In addition to this, the algorithm converges in significantly less time in comparison to other algorithms. This algorithm might become a perfect supporting tool for medical </span>practitioners.
Abstract-Nature is there since millenniums. Natural elements have withstood harsh complexities since years and have proved their efficiency in tackling them. This aspect has inspired many researchers to design algorithms based on phenomena in the natural world since the last couple of decades. Such algorithms are known as natural computing algorithms or nature inspired algorithms. These algorithms have established their ability to solve a large number of real-world complex problems by providing optimal solutions within the reasonable time duration. This paper presents an investigation by assessing the performance of some of the well-known natural computing algorithms with their variations. These algorithms include Genetic Algorithms, Ant Colony Optimization, River Formation Dynamics, Firefly Algorithm and Cuckoo Search. The Traveling Salesman Problem is used here as a test bed problem for performance evaluation of these algorithms. It is a kind of combinatorial optimization problem and known as one the most famous NP-Hard problems. It is simple and easy to understand, but at the same time, very difficult to find the optimal solution in a reasonable time -particularly with the increase in a number of cities. The source code for the above natural computing algorithms is developed in MATLAB R2015b and applied on several TSP instances given in TSPLIB library. Results obtained are analyzed based on various criteria such as tour length, required iterations, convergence time and quality of solutions. Conclusions derived from this analysis help to establish the superiority of Firefly Algorithms over the other algorithms in comparative terms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.