Clinical Data Analysis for Prediction of Cardiovascular Disease Using Machine Learning Techniques

Cardiovascular disease is difficult to detect due to several risk factors, including high blood pressure, cholesterol, and an abnormal pulse rate. Accurate decision-making and optimal treatment are required to address cardiac risk. As machine learning technology advances, the healthcare industry’s clinical practice is likely to change. As a result, researchers and clinicians must recognize the importance of machine learning techniques. The main objective of this research is to recommend a machine learning-based cardiovascular disease prediction system that is highly accurate. In contrast, modern machine learning algorithms such as REP Tree, M5P Tree, Random Tree, Linear Regression, Naive Bayes, J48, and JRIP are used to classify popular cardiovascular datasets. The proposed CDPS’s performance was evaluated using a variety of metrics to identify the best suitable machine learning model. When it came to predicting cardiovascular disease patients, the Random Tree model performed admirably, with the highest accuracy of 100%, the lowest MAE of 0.0011, the lowest RMSE of 0.0231, and the fastest prediction time of 0.01 seconds.

A Comparison of the Effectiveness of the RRT, PRM, and Novel Hybrid RRT-PRM Path Planners

Sampling-based path planners develop paths for robots to journey to their destinations. The two main types of sampling-based techniques are the probabilistic roadmap (PRM) and the Rapidly Exploring Random Tree (RRT). PRMs are multi-query methods that construct roadmaps to find routes, while RRTs are single-query techniques that grow search trees to find paths. This investigation evaluated the effectiveness of the PRM, the RRT, and the novel Hybrid RRT-PRM methods. This novel path planner was developed to improve the performance of the RRT and PRM techniques. It is a fusion of the RRT and PRM methods, and its goal is to reduce the path length. Experiments were conducted to evaluate the effectiveness of these path planners. The performance metrics included the path length, runtime, number of nodes in the path, number of nodes in the search tree or roadmap, and the number of iterations required to obtain the path. Results showed that the Hybrid RRT-PRM method was more effective than the PRM and RRT techniques because of the shorter path length. This new technique searched for a path in the convex hull region, which is a subset of the search area near to the start and end locations. The roadmap for the Hybrid RRT-PRM could also be re-used to find pathways for other sets of initial and final positions. Keywords: Path Planning, Sampling-based algorithms, search tree, roadmap, single-query planners, multi-query planners, Rapidly Exploring Random Tree (RRT), Probabilistic Roadmap (PRM), Hybrid RRT-PRM

Characterization based machine learning modeling for the prediction of the rheological properties of water-based drilling mud: an experimental study on grass as an environmental friendly additive

The successful drilling operation depends upon the achievement of target drilling attributes within the environmental and economic constraints but this is not possible only on the basis of laboratory testing due to the limitation of time and resources. The chemistry of the mud decides its rheological potential and selection of the techniques required for recycling operations. Conductivity, pH, and photometer testing were performed for the physio-chemical characterization of the grass to be used as an environmental friendly drilling mud additive. In this study, different particle sizes (75, 150, and 300 µm) of grass powder were mixed in mud density of 8.5, 8.6, and 8.7 ppg in the measurement of gel strength and viscosity of drilling mud. The grass additive was added in different weight conditions considering no additive, 0.25, 0.5, and 1 g to assess the contribution of grass on the gel strength and viscosity of the drilling mud. The machine learning techniques (Multivariate Linear Regression Analysis, Artificial Neural Network, Support Vector Machine Regression, k-Nearest Neighbor, Decision Stump, Random Forest, and Random Tree approaches) were applied to the generated rheological data. The results of the study show that grass can be used for the improvement of the gel strength and viscosity of the drilling mud. The highest improvement of the viscosity was seen when grass powder of 150 µm was added in the 8.7 ppg drilling mud in 0.25, 0.5, and 1 g weights. The gel strength of the drilling mud was improved when the grass additive was added to the drilling mud 8.7 ppg. Random forest and Artificial Neural Network had the same results of 0.72 regression coefficient (R2) for the estimation of viscosity of the drilling mud. The random tree was found as the most effective technique for the modeling of gel strength at 10 min (GS_10min) of the drilling mud. The predictions of Artificial Neural Network had 0.92 R2 against the measured gel strength at 10 s (GS_10sec) of the drilling mud. On average, Artificial Neural Network predicted the rheological properties of the mud with the highest accuracy as compared to other machine learning approaches. The work may serve as a key source to estimate the net effect of grass additives for the improvement of the gel strength and viscosity of the drilling mud without the performance of any large number of laboratory tests.

Research on Path Planning Algorithm of Bidirectional Rapidly Exploring Random Tree Improved by Artificial Potential Field

Aiming at the defects of path planning in rapidly exploring random tree(RRT) algorithm, such as low efficiency, strong randomness and slow convergence rate, a new algorithm based on artificial potential field was proposed in this paper. The algorithm used the scheme of bidirectional growth of exploration tree to make two growth trees explore and expand outwards from the starting point and the end point at the same time to accelerate the convergence speed of the algorithm. In the early stage, growth pretreatment was added to make the two growing trees take their respective endpoints as the target points and pass through the obstacle free area rapidly at one time. Artificial potential field method was used to modify the growth tree touching the obstacle and guide the path to grow towards the end. The adaptive change probability was used to select different target points as the growth directions in different periods with different probabilities to accelerate the meeting of two growing trees. After a lot of simulation experiments and data analysis, the improved bidirectional RRT algorithm has higher search efficiency, better growth path and fewer sampling points.

Pendekatan Data Science untuk Menemukan Churn Pelanggan pada Sector Perbankan dengan Machine Learning

Peralihan pelanggan merupakan fenomena dimana pelanggan perusahaan berhenti membeli atau berinteraksi sehingga sangat penting bagi perusahaan khususnya perbankan untuk memprediksi kemungkinan churn pelanggan dan hasilnya dapat digunakan untuk membantu retensi pelanggan dan bagian dari strategi perusahaan. Makalah ini menyajikan analisis dan prediksi churn pelanggan dengan menggunakan lima model berbeda yaitu Kneighbors Classifier, Logistic Regression, Linear SVC, Random Tree Classifier dan Random Forest Classifier. Berdasarkan hasil pengujian pendekatan model Random Forest Classifier dan Kneighbors Classifier lebih baik dari pada model lain dengan akurasi sebesar 86% dan 84%. Rekayasa fitur dengan pendekatan Anova dan Chi Square memiliki pengaruh yang signifikan terhadap peningkatan kinerja model prediksi.

Path Planning of a Mechanical Arm Based on an Improved Artificial Potential Field and a Rapid Expansion Random Tree Hybrid Algorithm

To improve the path planning efficiency of a robotic arm in three-dimensional space and improve the obstacle avoidance ability, this paper proposes an improved artificial potential field and rapid expansion random tree (APF-RRT) hybrid algorithm for the mechanical arm path planning method. The improved APF algorithm (I-APF) introduces a heuristic method based on the number of adjacent obstacles to escape from local minima, which solves the local minimum problem of the APF method and improves the search speed. The improved RRT algorithm (I-RRT) changes the selection method of the nearest neighbor node by introducing a triangular nearest neighbor node selection method, adopts an adaptive step and generates a virtual new node strategy to explore the path, and removes redundant path nodes generated by the RRT algorithm, which effectively improves the obstacle avoidance ability and efficiency of the algorithm. Bezier curves are used to fit the final generated path. Finally, an experimental analysis based on Python shows that the search time of the hybrid algorithm in a multi-obstacle environment is reduced to 2.8 s from 37.8 s (classic RRT algorithm), 10.1 s (RRT* algorithm), and 7.4 s (P_RRT* algorithm), and the success rate and efficiency of the search are both significantly improved. Furthermore, the hybrid algorithm is simulated in a robot operating system (ROS) using the UR5 mechanical arm, and the results prove the effectiveness and reliability of the hybrid algorithm.

Algoritma Rapidly Exploring Random Tree Star Dengan Integrasi Metode Sampling Goal Biassing, Gaussian, Dan Boundary

Algoritma perencanaan jalur adalah untuk menemukan lintasan yang membawa robot dari keadaan awal (start) ke keadaan tujuan (goal) sambil menghindari tabrakan dengan rintangan. Dalam perencanaan jalur, berbagai aplikasi telah digunakan seperti animasi, kedokteran, pesawat, dll. Tujuan penelitian ini adalah merancang metode sampling baru dengan cara melakukan integrasi metode sampling berbasis goal biassing, Gaussian dan Boundary lalu mengimplementasikannya pada masalah perencanaan jalur menggunakan algoritma Rapidly Exploring Random Tree* (RRT*). Metode sampling tersebut kami namakan metode sampling integrasi. Algoritma perencanaan jalur menggunakan metode sampling integrasi ini diimplementasikan pada bahasa pemograman Labview. Parameter algoritma pada Labview dapat dimodifikasi untuk mengamati performansi output dari algoritma RRT*. Pengujian dilakukan pada lingkungan obstacle clutter, SquareField BW, dan trap, dimana pengujian dilakukan 20 kali percobaan pada masing-masing obstacle. Pengujian dilakukan untuk membandingan jarak jalur serta waktu komputasi dari algoritma RRT* yang menggunakan metode sampling integrasi, terhadap algoritma RRT* yang menggunakan metode sampling Gaussian, dan Boundary. Berdasarkan hasil pengujian, diperoleh bahwa algoritma RRT* yang menggunakan metode sampling integrasi dapat menghasilkan jalur yang lebih pendek dibandingkan dengan algoritma RRT* yang menggunakan metode Gaussian maupun algoritma RRT* yang menggunakan sampling Boundary. Perbandingan waktu komputasi yang dihasilkan lebih cepat metode integrasi dibandingkan dengan Gaussian. Akan tetapi, pada perbandingan dengan Boundary menunjukkan bahwa Boundary memerlukan lebih sedikit waktu dibandingkan dengan integrasi. Maka dari itu dapat disimpulkan bahwa algortima Rapidly Exploring Random Tree* metode integrasi lebih unggul dibandingkan dengan metode Gaussian maupun metode Boundary.

Analisa Performansi Metode Sampling Goal Biasing dan Metode Sampling Gaussian pada Algoritma Rapidly-exploring Random Tree*

Salah satu bidang penelitian mendasar dalam robotika adalah algoritma perencanaan gerak atau jalur. Pada penelitian ini dirancang dan disimulasikan algoritma quick -exploring random tree* (RRT*). Algoritma yang diusulkan adalah algoritma RRT* goal biasing dan algoritma RRT* g aussian sampling . Tujuan penelitian ini adalah melakukan analisa performansi perencanaan jalur algoritma RRT* goal biasing dan algoritma RRT* gaussian sampling . Pengujian dilakukan menggunakan beberapa kasus benchmark yang ada, yaitu lingkungan narrow , trap , dan clutter. Parameter yang dibandingkan adalah biaya, waktu komputasi, dan total node yang dibutuhkan pada pohon pencarian dari node awal sampai node tujuan. Menggunakan kasus benchmark lingkungan narrow, clutter, dan trap algoritma RRT* goal biasing memperoleh nilai rata-rata untuk biaya jarak, waktu, dan jumlah node yaitu; 8,3 (biaiya jarak di narrow ), 222,1 (jumlah node di clutter), dan 30.045 detik (waktu di trap) . Kemudian untuk kasus benchmark lingkungan sempit, clutter, dan trap yang menggunakan algoritma RRT* g aussianmemperoleh nilai rata-rata untuk biaya jarak, waktu, dan jumlah simpul yaitu; 8,1 (biaiya jarak di narrow ), 642,85 (jumlah node di clutter), dan 30,49 detik (waktu di trap) . Berdasarkan pengujian algoritma RRT* goal biasing memiliki keunggulan untuk waktu dan jumlah node yang dibutuhkan untuk mencapai suatu titik, tetapi biaya jarak yang dihasilkan kurang optimal.

Metode Improved Gaussian Sampling pada Algoritma Rapidly Exploring Random Tree*

Penelitian ini bertujuan merancang metode improved gaussian sampling dan mengimplementasikan pada algoritma Rapidly Exploring Random Tree* (RRT*). Perancangan yang dilakukan menggunakan bahasa pemograman Laboratory Virtual Instrumentation Engineering Workbench (LabVIEW). Improved gaussian sampling merupakan pengembangan dari metode gaussian sampling dengan menambahkan jumlah sampling. Jumlah sampling yang digunakan pada metode ini yaitu sejumlah 10 sampling. Untuk mengukur performansi dari metode sampling yang diusulkan, maka kami melakukan perbandingan performansi metode improved gaussian sampling, gaussian sampling dan random sampling. Berdasarkan hasil pengujian improved gaussian sampling didapatkan rata-rata nilai path cost dan waktu komputasi senilai: clutter sepanjang 8,89 dengan waktu 40,05; narrow sepanjang 12,58 dengan waktu 40,03 dan trap sepanjang 9,93 dengan waktu 40,04. Sedangkan hasil pengujian gaussian sampling didapatkan: clutter sepanjang 10 dengan waktu 40,09; narrow sepanjang 13,53 dengan waktu 40,03 dan trap sepanjang 10,95 dengan waktu 40,12. Hasil pengujian random sampling didapatkan: clutter sepanjang 10,86 dengan waktu 0,03; narrow sepanjang 14,82 dengan waktu 0,25 dan trap sepanjang 11,71 dengan waktu 0,21. Disimpulkan bahwa pada algoritma RRT* dengan menggunakan metode improved gaussian sampling menghasilkan performansi yang lebih baik dibandingkan algoritma RRT* yang menggunakan metode sampling lainnya. Hasil perbandingan pengukuran berdasarkan nilai sampling didapatkan rata-rata nilai path cost rata-rata 10,12 dengan jumlah sampling hanya 1 dan nilai path cost terpendek 8,9 dengan jumlah sampling 10. Berdasarkan pengukuran tersebut didapatkan semakin banyak jumlah sampling yang diberikan maka nilai path cost yang dihasilkan optimal.