Abstract: Heart diseases are increasing daily at a rapid rate and it is alarming and vital to predict heart diseases early. The diagnosis of heart diseases is a challenging task i.e. it must be done accurately and proficiently. The aim of this study is to determine which patient is more likely to have heart disease based on a number of medical features. We organized a heart disease prediction model to identify whether the person is likely to be diagnosed with a (...) heart disease or not using the medical features of the person. We used many different algorithms of machine learning such as Gaussian Mixture, Nearest Centroid, MultinomialNB, Logistic RegressionCV, Linear SVC, Linear Discriminant Analysis, SGD Classifier, Extra Tree Classifier, Calibrated ClassifierCV, Quadratic Discriminant Analysis, GaussianNB, Random Forest Classifier, ComplementNB, MLP Classifier, BernoulliNB, Bagging Classifier, LGBM Classifier, Ada Boost Classifier, K Neighbors Classifier, Logistic Regression, Gradient Boosting Classifier, Decision Tree Classifier, and Deep Learning to predict and classify the patient with heart disease. A quite helpful approach was used to regulate how the model can be used to improve the accuracy of prediction of heart diseases in any person. The strength of the proposed model was very satisfying and was able to predict evidence of having a heart disease in a particular person by using Deep Learning and Random Forest Classifier which showed a good accuracy in comparison to the other used classifiers. The proposed heart disease prediction model will enhances medical care and reduces the cost. This study gives us significant knowledge that can help us predict the person with heart disease. The dataset was collected from Kaggle depository and the model is implemented using python. (shrink)

Deep learning may transform health care, but model development has largely been dependent on availability of advanced technical expertise. The aim of this study is to develop a deep learning model to predict the gender from retinal fundus images. The proposed model was based on the Xception pre-trained model. The proposed model was trained on 20,000 retinal fundus images from Kaggle depository. The dataset was preprocessed them split into three datasets (training, validation, Testing). After training and cross-validating the proposed model, (...) it was evaluated using the testing dataset. The result of testing, the area under receiver operating characteristic curve (AUROC) of the model was 0.99, precision, recall, f1-score and accuracy were 99%, precision, recall, f1-score and accuracy were 96.83%, 96.83%, 96.82% and 96.83% respectively.. Clinicians are presently unaware of dissimilar retinal feature variants between females and males, stressing the importance of model explain ability for the prediction of gender from retinal fundus images. The proposed deep learning may enable clinician-driven automated discovery of novel visions and disease biomarkers. (shrink)

Abstract: Sarcasm is commonly used in news and detecting sarcasm in headline news is challenging for humans and thus for computers. The media regularly seem to engage sarcasm in their news headline to get the attention of people. However, people find it tough to detect the sarcasm in the headline news, hence receiving a mistaken idea about that specific news and additionally spreading it to their friends, colleagues, etc. Consequently, an intelligent system that is able to distinguish between can sarcasm (...) none sarcasm automatically is very important. The aim of the study is to build a sarcasm model that detect headline news using machine and deep learning and attempt to understand how a computer learns the patterns of sarcasm. The dataset used in this study was collected from Kaggle depository. We examined 21 algorithms of machine learning and one deep learning algorithm for detecting sarcasm in headline news. The evaluation metric used in this study are Accuracy, F1-measure, Recall, Precision, and Time needed for training and evaluation. The deep learning model achieved accuracy (95.27%), recall (96.62%), precision (94.15%), F1-score (95.37%) and time needed to train the mode (400 seconds), with loss of around 0.3398. However, the algorithm of machine learning that achieved the highest F1-Score is Passive Aggressive Classifier. It was the top classier for sarcasm detection among the machine learning algorithms with accuracy (95.50%), recall (96.09 %), precision (94.30%), F1-score (95.19%) and time needed to train the mode (0.31 seconds). (shrink)

Abstract: Sarcasm is commonly used in news and detecting sarcasm in headline news is challenging for humans and thus for computers. The media regularly seem to engage sarcasm in their news headline to get the attention of people. However, people find it tough to detect the sarcasm in the headline news, hence receiving a mistaken idea about that specific news and additionally spreading it to their friends, colleagues, etc. Consequently, an intelligent system that is able to distinguish between can sarcasm (...) none sarcasm automatically is very important. The aim of the study is to build a sarcasm model that detect headline news using machine and deep learning and attempt to understand how a computer learns the patterns of sarcasm. The dataset used in this study was collected from Kaggle depository. We examined 21 algorithms of machine learning and one deep learning algorithm for detecting sarcasm in headline news. The evaluation metric used in this study are Accuracy, F1-measure, Recall, Precision, and Time needed for training and evaluation. The deep learning model achieved accuracy (95.27%), recall (96.62%), precision (94.15%), F1-score (95.37%) and time needed to train the mode (400 seconds), with loss of around 0.3398. However, the algorithm of machine learning that achieved the highest F1-Score is Passive Aggressive Classifier. It was the top classier for sarcasm detection among the machine learning algorithms with accuracy (95.50%), recall (96.09 %), precision (94.30%), F1-score (95.19%) and time needed to train the mode (0.31 seconds). (shrink)