Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

We introduce and discuss a knowledge-driven distillation approach to explaining black-box models by means of two kinds of interpretable models. The first is perceptron (or threshold) connectives, which enrich knowledge representation languages such as Description Logics with linear operators that serve as a bridge between statistical learning and logical reasoning. The second is Trepan Reloaded, an ap- proach that builds post-hoc explanations of black-box classifiers in the form of decision trees enhanced by domain knowledge. Our aim is, firstly, to (...) target a model-agnostic distillation approach exemplified with these two frameworks, secondly, to study how these two frameworks interact on a theoretical level, and, thirdly, to investigate use-cases in ML and AI in a comparative manner. Specifically, we envision that user-studies will help determine human understandability of explanations generated using these two frameworks. (shrink)

Personalized medicine recommendation systems are increasing in popularity to predict diseases and provide customized health advice on diet, workout plans and medication. The medical suggestion system can be valuable when pandemics, floods, or cyclones hit. In the age of Machine Learning (ML), recommender systems give more accurate, precise, and reliable clinical predictions while using less resources. Through the use of machine learning algorithms like Decision Tree, Random Forest, K-Means Clustering, and Hierarchical Clustering, these systems analyze patient inputs such (...) as lifestyle data, symptoms, and health metrics for accurate predictions of diseases and holistic recommendations on health. This inclusive process ensures each person receives tailored support to enhance the entire management of their health. The system's ability to suggest accurate diets, proper workouts, and appropriate drugs depending on the condition of the user significantly enhances its contribution toward more healthy lifestyles. The variety of algorithms increases accuracy and reliability as well because each model contributes uniquely in analyzing various aspects of patient data. This study presents a framework that demonstrates the system's efficacy in providing personalized disease predictions and health recommendations, which can benefit the development of preventive care and improve treatment outcomes. (shrink)

The decision tree of life is colossal. While physicists and metaphysicians explore the possibility that the multiverse grows larger at every decision, it is the ethicist’s lot to consider the paths chosen. That is to say, ethics is generally concerned with the build-up to a decision point. But what happens afterwards? And how do our choices influence our future decision-making?

Research in ethical AI has made strides in quantitative expression of ethical values such as fairness, transparency, and privacy. Here we contribute to this effort by proposing a new family of metrics called “decisional value scores” (DVS). DVSs are scores assigned to a system based on whether the decisions it makes meet or fail to meet a particular standard (either individually, in total, or as a ratio or average over decisions made). Advantages of DVS include greater discrimination capacity between types (...) of ethically relevant decisions and facilitation of ethical comparisons between decisions and decision-making systems, including across different modalities (for instance: human, machine, or coupled human–machine systems). After clarifying ambiguities in the concept of “decision” itself, including the question of how to individuate the decisions made by a system, we discuss the role and meaning of “decision” in common AI and machine learning approaches such as decision trees, neural networks, SVMs, and unsupervised classifiers. We then show how DVSs may be defined for several ethical values of interest, with an extended discussion of transparency. Finally, we explore how such metrics can be applied to real decision-making systems through two case studies: evaluations of LLMs for transparency; and evaluations of criminal risk assessment tools for utility, rights violations, fairness, and transparency. (shrink)

It is crucial to actively detect the risks of transactions in a financial company to improve customer experience and minimize financial loss. In this study, we compare different machine learning algorithms to effectively and efficiently predict the legitimacy of financial transactions. The algorithms used in this study were: MLP Repressor, Random Forest Classifier, Complement NB, MLP Classifier, Gaussian NB, Bernoulli NB, LGBM Classifier, Ada Boost Classifier, K Neighbors Classifier, Logistic Regression, Bagging Classifier, Decision Tree Classifier and Deep Learning. (...) The dataset was collected from Kaggle depository. It consists of 6362620 rows and 10 columns. The best classifier with unbalanced dataset was the Random Forest Classifier. The Accuracy 99.97%, precession 99.96%, Recall 99.97% and the F1-score 99.96%. However, the best classifier with balanced dataset was the Bagging Classifier. The Accuracy 99.96%, precession 99.95%, Recall 99.98% and the F1-score 99.96%. (shrink)

The rise of social media has created a new platform for communication and interaction, but it has also facilitated the spread of harmful behaviors such as cyberbullying. Detecting and mitigating cyberbullying on social media platforms is a critical challenge that requires advanced technological solutions. This paper presents a novel approach to cyberbullying detection using a combination of supervised machine learning (ML) and natural language processing (NLP) techniques, enhanced by optimization algorithms. The proposed system is designed to identify and classify cyberbullying (...) behavior in real-time, analyzing textual data from social media posts to detect harmful content. The model is trained on a large dataset of labeled instances of bullying and non-bullying content, using supervised ML algorithms such as Support Vector Machines (SVM), Decision Trees, and Random Forest. NLP techniques, including sentiment analysis, keyword extraction, and text vectorization, are employed to preprocess and transform the data into a format suitable for machine learning. To optimize the performance of the detection model, techniques such as Grid Search, Genetic Algorithms, and Particle Swarm Optimization are used to fine-tune hyperparameters, resulting in improved accuracy and reduced false positives. The system's effectiveness is validated through experiments conducted on various social media platforms, demonstrating its potential to detect cyberbullying with high precision. Future work will focus on enhancing the model's adaptability to emerging slang and evolving language patterns in social media. Key words: Cyberbullying Detection, Social Media, Supervised Machine Learning, Natural Language Processing (NLP), Optimization Techniques. (shrink)

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)

In the natural and social sciences, it is common to use toy models—extremely simple and highly idealized representations—to understand complex phenomena. Some of the simple surrogate models used to understand opaque machine learning (ML) models, such as rule lists and sparse decision trees, bear some resemblance to scientific toy models. They allow non-experts to understand how an opaque ML model works globally via a much simpler model that highlights the most relevant features of the input space and their effect (...) on the output. The obvious difference is that the common target of a toy and a full-scale model in the sciences is some phenomenon in the world, while the target of a surrogate model is another model. This essential difference makes toy surrogate models (TSMs) a new object of study for theories of understanding, one that is not easily accommodated under current analyses. This paper provides an account of what it means to understand an opaque ML model globally with the aid of such simple models. (shrink)

The rise of social media has created a new platform for communication and interaction, but it has also facilitated the spread of harmful behaviors such as cyberbullying. Detecting and mitigating cyberbullying on social media platforms is a critical challenge that requires advanced technological solutions. This paper presents a novel approach to cyberbullying detection using a combination of supervised machine learning (ML) and natural language processing (NLP) techniques, enhanced by optimization algorithms. The proposed system is designed to identify and classify cyberbullying (...) behavior in real-time, analyzing textual data from social media posts to detect harmful content. The model is trained on a large dataset of labeled instances of bullying and non-bullying content, using supervised ML algorithms such as Support Vector Machines (SVM), Decision Trees, and Random Forest. NLP techniques, including sentiment analysis, keyword extraction, and text vectorization, are employed to preprocess and transform the data into a format suitable for machine learning. To optimize the performance of the detection model, techniques such as Grid Search, Genetic Algorithms, and Particle Swarm Optimization are used to fine-tune hyperparameters, resulting in improved accuracy and reduced false positives. The system's effectiveness is validated through experiments conducted on various social media platforms, demonstrating its potential to detect cyberbullying with high precision. Future work will focus on enhancing the model's adaptability to emerging slang and evolving language patterns in social media. (shrink)

In this chapter we will deal with “mechanizing” induction, i.e. with ways in which theoretical computer science approaches inductive generalization. In the field of Machine Learning, algorithms for induction are developed. Depending on the form of the available data, the nature of these algorithms may be very different. Some of them combine geometric and statistical ideas, while others use classical reasoning based on logical formalism. However, we are not so much interested in the algorithms themselves, but more on the philosophical (...) and theoretical foundations they share. Thus in the first of two parts, we will examine different approaches and inductive assumptions in two particular learning settings. While many machine learning algorithms work well on a lot of tasks, the interpretation of the learned hypothesis is often difficult. Thus, while e.g. an algorithm surprisingly is able to determine the gender of the author of a given text with about 80 percent accuracy [Argamon and Shimoni, 2003], for a human it takes some extra effort to understand on the basis of which criteria the algorithm is able to do so. With that respect the advantage of approaches using logic are obvious: If the output hypothesis is a formula of predicate logic, it is easy to interpret. However, if decision trees or algorithms from the area of inductive logic programming are based purely on classical logic, they suffer from the fact that most universal statements do not hold for exceptional cases, and classical logic does not offer any convenient way of representing statements which are meant to hold in the “normal case”. Thus, in the second part we will focus on approaches for Nonmonotonic Reasoning that try to handle this problem. Both Machine Learning and Nonmonotonic Reasoning have been anticipated partially by work in philosophy of science and philosophical logic. At the same time, recent developments in theoretical computer science are expected to trig- ger further progress in philosophical theories of inference, confirmation, theory revision, learning, and the semantic and pragmatics of conditionals. We hope this survey will contribute to this kind of progress by building bridges between computational, logical, and philosophical accounts of induction. (shrink)

The world's leading cause of morbidity and death is cardiovascular diseases (CVD), which makes early detection essential for successful treatments. This study investigates how optimization techniques can be used with machine learning (ML) algorithms to forecast cardiovascular illnesses more accurately. ML models can evaluate enormous datasets by utilizing data-driven techniques, finding trends and risk factors that conventional methods can miss. In order to increase prediction accuracy, this study focuses on adopting different machine learning algorithms, including Decision Trees, Random Forest, (...) Support Vector Machines, and Neural Networks, that have been tuned using strategies including hyper parameter selection, crossvalidation, and feature selection. (shrink)

Cardiovascular diseases (CVD) represent a significant cause of morbidity and mortality worldwide, necessitating early detection for effective intervention. This research explores the application of machine learning (ML) algorithms in predicting cardiovascular diseases with enhanced accuracy by integrating optimization techniques. By leveraging data-driven approaches, ML models can analyze vast datasets, identifying patterns and risk factors that traditional methods might overlook. This study focuses on implementing various ML algorithms, such as Decision Trees, Random Forest, Support Vector Machines, and Neural Networks, optimized (...) through techniques like hyperparameter tuning, cross-validation, and feature selection to improve prediction accuracy. (shrink)

Abstract—Breast cancer is considered the second most common cancer in women compared to all other cancers. It is fatal in less than half of all cases and is the main cause of mortality in women. It accounts for 16% of all cancer mortalities worldwide. Early diagnosis of breast cancer increases the chance of recovery. Data mining techniques can be utilized in the early diagnosis of breast cancer. In this paper, an academic experimental breast cancer dataset is used to perform a (...) data mining practical experiment using the Waikato Environment for Knowledge Analysis (WEKA) tool. The WEKA Java application represents a rich resource for conducting performance metrics during the execution of experiments. Pre-processing and feature extraction are used to optimize the data. The classification process used in this study was summarized through thirteen experiments. Additionally, 10 experiments using various different classification algorithms were conducted. The introduced algorithms were: Naïve Bayes, Logistic Regression, Lazy IBK (Instance-Bases learning with parameter K), Lazy Kstar, Lazy Locally Weighted Learner, Rules ZeroR, Decision Stump, Decision Trees J48, Random Forest and Random Trees. The process of producing a predictive model was automated with the use of classification accuracy. Further, several experiments on classification of Wisconsin Diagnostic Breast Cancer and Wisconsin Breast Cancer, were conducted to compare the success rates of the different methods. Results conclude that Lazy IBK classifier k-NN can achieve 98% accuracy among other classifiers. The main advantages of the study were the compactness of using 13 different data mining models and 10 different performance measurements, and plotting figures of classifications errors. (shrink)

Ever since the era of internet had ushered in cloud computing, there had been increase in the demand for the unlimited data available through cloud computing for data analysis, pattern recognition and technology advancement. With this also bring the problem of scalability, efficiency and security threat. This research paper focuses on how data can be dynamically mine in real time for pattern detection in a secure cloud computing environment using combination of decision tree algorithm and Random Forest over (...) a restful Application Programming Interface (API). We are able to successfully Implement data mining on cloud computing bypassing or avoiding direct interaction with data warehouse and without any terminal involve by using combination of IBM Cloud storage facility, Amazing Web Service, Application Programming Interface and Window service along with a decision tree and Random Forest algorithm for our classifier. We were able to successfully bypass direct connection with the data warehouse and cloud terminal with 94% accuracy in our model. (shrink)

This contribution reconstructs and assesses Gideon Yaffe’s claims in his book Attempts about what constitutes an attempt, what can count as evidence that an attempt has been made, whether abandonment is a genuine defense, and whether attempts should be punished less severely than completed crimes. I contrast Yaffe’s account of being motivated by an intention and the completion of an attempt in terms of the truth of the completion counterfactual with an alternative picture of attempts as temporally extended decision (...) trees that are complete insofar as the agent has progressed toward the final act in the tree. I suggest that this alternative scalar conception of attempt may provide a more plausible account of the defense of abandonment. I also raise questions about whether Yaffe has provided an adequate justification of his mix of luck skepticism about censure and luck realism about punishment. (shrink)

In today's digital age, the need for accurate and efficient language translation tools is more crucial than ever, particularly for bridging communication gaps between diverse linguistic communities. The primary purpose of this work is to provide an efficient solution for translating website content from English to Hindi, thereby promoting inclusivity and accessibility in the digital space. The methodology involves using the Google Translate API for accurate translations and employing web scraping techniques to retrieve content from user-specified URLs. The application enables (...) users to input a URL, automatically scrape its HTML content, and display the translated text in a user-friendly format. Key results demonstrate that the tool effectively translates various web pages, preserving context and meaning while providing immediate access to crucial information. Major conclusions highlight the importance of such tools in bridging communication gaps, enhancing user engagement with government websites, and facilitating better understanding of services among Hindi-speaking populations. The successful implementation of this project underscores the potential for expanding access to information in multilingual societies and suggests avenues for further development, including additional language support and integration with other online services. Overall, this work contributes to the growing field of language translation technologies [5] by providing a practical application that meets the pressing needs of users in an increasingly interconnected world. (shrink)

Abstract: Heart attacks, or myocardial infarctions, are a leading cause of mortality worldwide. Early prediction and accurate analysis of potential risk factors play a crucial role in preventing heart attacks and improving patient outcomes. In this study, we conduct a comprehensive review of datasets related to heart attack analysis and prediction. We begin by examining the various types of datasets available for heart attack research, encompassing clinical, demographic, and physiological data. These datasets originate from diverse sources, including hospitals, research institutions, (...) and public health agencies. Our analysis aims to identify common features, data quality, and potential biases in these datasets. Next, we explore the predictive modeling techniques employed in heart attack prediction. Machine learning algorithms, such as decision trees, support vector machines, and deep neural networks, have gained prominence in predicting heart attacks. We discuss the strengths and limitations of these methods and highlight recent advancements in predictive modeling. Furthermore, we delve into the critical risk factors associated with heart attacks. Factors such as age, gender, hypertension, diabetes, and cholesterol levels are examined for their significance in predicting cardiac events. We also investigate the role of lifestyle factors, including smoking, diet, and physical activity, in heart attack risk assessment. Additionally, this review addresses the importance of data preprocessing and feature engineering in improving prediction accuracy. Feature selection methods, missing data handling, and data scaling techniques are discussed to enhance the robustness of heart attack prediction models. In conclusion, this comprehensive dataset review provides valuable insights into the state of heart attack analysis and prediction. It serves as a resource for researchers and healthcare professionals seeking to better understand the datasets available for heart attack research and the methods employed for accurate prediction. Ultimately, our efforts in dataset analysis and predictive modeling contribute to the advancement of preventive cardiology and the reduction of heart attack-related morbidity and mortality. (shrink)

The world's leading cause of morbidity and death is cardiovascular diseases (CVD), which makes early detection essential for successful treatments. This study investigates how optimization techniques can be used with machine learning (ML) algorithms to forecast cardiovascular illnesses more accurately. ML models can evaluate enormous datasets by utilizing data-driven techniques, finding trends and risk factors that conventional methods can miss. In order to increase prediction accuracy, this study focuses on adopting different machine learning algorithms, including Decision Trees, Random Forest, (...) Support Vector Machines, and Neural Networks, that have been tuned using strategies including hyper parameter selection, crossvalidation, and feature selection. (shrink)

The rise of social media has created a new platform for communication and interaction, but it has also facilitated the spread of harmful behaviors such as cyberbullying. Detecting and mitigating cyberbullying on social media platforms is a critical challenge that requires advanced technological solutions. This paper presents a novel approach to cyberbullying detection using a combination of supervised machine learning (ML) and natural language processing (NLP) techniques, enhanced by optimization algorithms. The proposed system is designed to identify and classify cyberbullying (...) behavior in real-time, analyzing textual data from social media posts to detect harmful content. The model is trained on a large dataset of labeled instances of bullying and non-bullying content, using supervised ML algorithms such as Support Vector Machines (SVM), Decision Trees, and Random Forest. NLP techniques, including sentiment analysis, keyword extraction, and text vectorization, are employed to preprocess and transform the data into a format suitable for machine learning. T. (shrink)

Cardiovascular diseases (CVD) represent a significant cause of morbidity and mortality worldwide, necessitating early detection for effective intervention. This research explores the application of machine learning (ML) algorithms in predicting cardiovascular diseases with enhanced accuracy by integrating optimization techniques. By leveraging data-driven approaches, ML models can analyze vast datasets, identifying patterns and risk factors that traditional methods might overlook. This study focuses on implementing various ML algorithms, such as Decision Trees, Random Forest, Support Vector Machines, and Neural Networks, optimized (...) through techniques like hyperparameter tuning, cross-validation, and feature selection to improve prediction accuracy. (shrink)

In this paper, we investigated multiple machine learning classifiers which are, Multinomial Naive Bayes, Support Vector Machine, Decision Tree, K Nearest Neighbors, and Random Forest in a text classification problem. The data we used contains real and fake job posts. We cleaned and pre-processed our data, then we applied TF-IDF for feature extraction. After we implemented the classifiers, we trained and evaluated them. Evaluation metrics used are precision, recall, f-measure, and accuracy. For each classifier, results were summarized and (...) compared with others. (shrink)

Chronic kidney disease (CKD) is a global health problem with high morbidity and mortality rate, and it induces other diseases. There are no obvious incidental effects during the starting periods of CKD, patients routinely disregard to see the sickness. Early disclosure of CKD enables patients to seek helpful treatment to improve the development of this disease. AI models can effectively assist clinical with achieving this objective on account of their fast and exact affirmation execution. In this appraisal, proposed a Logistic (...) relapse framework for diagnosing CKD. Proposed calculation like NAIVE BAYES , DECISION TREE , KSTAR , LOGISITIC , AND SVM and look at these calculation and get the most noteworthy precision .AI store, which has an enormous number of missing qualities. Missing characteristics are for the most part found, taking everything into account, clinical conditions since patients might miss a couple of assessments for various reasons. By separating the misjudgements delivered by the set up models and proposed a fused model that unites determined backslide and sporadic woods by using perceptron. (shrink)

With the current improvement of development towards pharmaceutical, distinctive ultrasound methodologies are open to find the fetal prosperity. It is analyzed with diverse clinical parameters with 2-D imaging and other test. In any case, prosperity desire of fetal heart still remains an open issue due to unconstrained works out of the hatchling, the minor heart appraise and inadequate of data in fetal echocardiography. The machine learning strategies can find out the classes of fetal heart rate which can beutilized for earlier (...) evaluating. With this background, we have utilized Cardiotocographic Fetal heart rate dataset removed from UCI Machine Learning Store for predicting the fetal heart rate health classes. The Prediction of fetal health rate are achieved in six ways. Firstly, the data set is preprocessed with Feature Scaling and missing values. Secondly, exploratory data investigation is done and the dispersion of target feature is visualized. Thirdly, the raw data set is fitted to all the classifiers and the performance is analysed before and after feature scaling. Fourth, the raw data set is subjected to undersampling methods like ClusterCentroids, RepeatedENN, AllKNN, CondensedNearestNeighbour, EditedNearestNeighbours, InstanceHardnessThreshold and NearMiss. Fifth, the undersampled dataset by above mentioned methods are fitted to all the classifiers and the performance is analyzed before and after feature scaling. Sixth, performance analysis is done using metrics like Precision, Recall, F-score, Accuracy and running time. The execution is done using python language under Spyder platform with Anaconda Navigator. Experimental results shows that the Decision Tree classifier tends to retain 98% before and after feature scaling for the underrsampling with EditedNearestNeighbours, RepeatedENN and AllKNN methods. (shrink)

This research paper presents the development and evaluation of an expert system for diagnosing kidney diseases. The expert system utilizes a decision-making tree approach and is implemented using the CLIPS and Delphi frameworks. The system's accuracy in diagnosing kidney diseases and user satisfaction were evaluated. The results demonstrate the effectiveness of the expert system in providing accurate diagnoses and high user satisfaction.

Item response theory (IRT) is a modern psychometric framework for estimating respondents’ latent traits (e.g., ability, attitude, and personality) based on their responses to a set of questions in psychological tests. The current study adopted an item response tree (IRTree) method, which combines the tree model with IRT models for handling the sequential process of responding to a test item, to score individual moral inclination for the CNI test—a broadly adopted model for examining humans’ moral decision-making with (...) three parameters generated: sensitivity to moral norms, sensitivity to consequences, and inaction preference. Compared to previous models for the CNI test, the resulting EIRTree-CNI Model is able to generate individual scores without increasing the number of items (thus, less subject fatigue or compromised response quality) or employing a post hoc approach that is deemed statistically suboptimal. The model fits the data well, and the subsequent test also supported the concurrent validity and the predictive validity of the model. Limitations are discussed further. (shrink)

Doxastic voluntarism is the thesis that our beliefs are subject to voluntary control. While there’s some controversy as to what “voluntary control” amounts to (see 1.2), it’s often understood as direct control: the ability to bring about a state of affairs “just like that,” without having to do anything else. Most of us have direct control over, for instance, bringing to mind an image of a pine tree. Can one, in like fashion, voluntarily bring it about that one believes (...) a specific proposition? Doxastic voluntarists hold that, at least in some circumstances—such as when the evidence is ambiguous—we can. Doxastic involuntarists, in contrast, maintain that we cannot. Some involuntarists hold that the concept of belief itself precludes the possibility of believing voluntarily. Others hold that the impossibility of voluntary belief is a contingent psychological fact. Historically, the issue of doxastic voluntarism has been connected to how many think about religious commitment: a prominent view of faith is that it is a voluntary decision to believe. Furthermore, the issue of voluntarism has also been viewed as having bearing on fundamental questions in epistemology. For example, are epistemic norms duties to believe in certain ways? Are there practical or moral reasons to believe? If the answer to either question is “yes,” it seems some measure of voluntary doxastic control is required. -/- In section 1, we expand on the definition of doxastic voluntarism, and survey various kinds of control (e.g. direct, indirect, long-range) and the doxastic attitudes we might control (e.g. outright belief, withholding, credences). In section 2, we discuss a number of historical views on doxastic voluntarism. In section 3, we survey motivations for rejecting doxastic voluntarism. There are two general strategies: arguments that appeal to psychological considerations, and conceptual arguments regarding the nature of belief. In section 4, we survey five approaches to defending voluntarism: those that appeal to epistemic permissivism, doxastic compatibilism, skepticism, one-off considerations, and non-standard views of belief. In section 5, we cover empirical work on doxastic voluntarism. The last two sections discuss two implications of voluntarism. In section 6, we discuss voluntarism’s implications for the ethics of belief, and in section 7, we discuss issues at the intersection of voluntarism and religious faith. (shrink)

Peter Fitzpatrick’s writings prove once and for all that it is possible for a law professor to write in beautiful English. His work also proves once and for all that the dominating tradition of Anglo-American legal philosophy and of law teaching has been barking up the wrong tree: namely, that the philosopher and professional law teachers can understand justice as nested in empty forms, better known as rules, doctrines, principles, policies, and other standards. The more rigorous our analysis or (...) decomposition of the forms, we have believed, the more closely do we access the identity of laws. Justice has been assumed to be a matter of intellectually accessing such analysed forms. Fitzpatrick’s articles and books embody an implicit critique of the analytic view of law and of justice. My entry point into this critique is his preoccupation with Jacques Derrida’s theory of laws as universals and with Derrida’s theory of justice as an inaccessible immediacy or presence in context-specific or concrete experienced events. Each event is experienced in an official’s decision. Such a decision represents what Derrida, Fitzpatrick, and Hegel call ‘individuality’. -/- Derrida’s theory of law presents a conundrum. Derrida misses the possibility that law may exist by virtue of its content rather than its form. Derrida misses this possibility because, heavily influenced by Kant (in Derrida’s theory of law), Derrida associates law with universals. This is so because Kant (and Derrida) are preoccupied with the identity of what counts as a law (lois) rather than with a law’s legitimacy. A universal cannot exist unless it is legitimate, and it is legitimate, I claim, by virtue of its content. In his association of law with universals, Derrida presupposes that legal knowledge exists with reference to a territorial-like boundary. The forms are represented or signified by signs (signifiers) within a boundary of the ultimate form (the state, the nation, or humanity). This ultimate form as a universal, like the discrete rules or forms, lacks socially contingent content. A boundary separates knowable universals from the unknowable world on the exteriority of the boundary. The unknowable world is constituted by concrete events experienced in context-specific circumstances. In his legal theory Derrida hones in upon the decision as the experienced event. In a decision, one is present or immediate with the event. Derrida considers such immediacy as justice. The immediacy, however, can only be represented as a sign (sometimes called a signifier). The sign, in turn, represents an empty signified or form, according to Derrida. Because the immediacy remains a representation rather than a presentation of the experienced event, laws as universals cannot be just. The rupture between the inaccessible immediacy of a decision on the one hand and the represented empty forms on the other is critical to Derrida’s theory of law. -/- I claim that this rupture permeates Derrida’s writings about law because Derrida possesses a territorial-like sense of legal knowledge. I shall argue to this effect as follows. In the first section I shall explain the importance of Fitzpatrick’s exposure of the vacuity of the foundation of the system or structure of universals. In the second section I shall flesh out two elements of Derrida’s legal theory: law as form and the ipseity or concrete event that the form excludes from law. This takes me to the third section, where I shall elaborate how Derrida’s legal theory presupposes knowledge as territorial. I shall argue in the final section that this very sense of territorial knowledge prevents justice from accessing law and law from accessing justice. I conclude with the hint of a very different sense of law, one that draws from experiential knowledge in contradistinction to territorial knowledge. (shrink)

Evolution and geometry generate complexity in similar ways. Evolution drives natural selection while geometry may capture the logic of this selection and express it visually, in terms of specific generic properties representing some kind of advantage. Geometry is ideally suited for expressing the logic of evolutionary selection for symmetry, which is found in the shape curves of vein systems and other natural objects such as leaves, cell membranes, or tunnel systems built by ants. The topology and geometry of symmetry is (...) controlled by numerical parameters, which act in analogy with a biological organism’s DNA. The introductory part of this paper reviews findings from experiments illustrating the critical role of two-dimensional (2D) design parameters, affine geometry and shape symmetry for visual or tactile shape sensation and perception-based decision making in populations of experts and non-experts. It will be shown that 2D fractal symmetry, referred to herein as the “symmetry of things in a thing”, results from principles very similar to those of affine projection. Results from experiments on aesthetic and visual preference judgments in response to 2D fractal trees with varying degrees of asymmetry are presented. In a first experiment (psychophysical scaling procedure), non-expert observers had to rate (on a scale from 0 to 10) the perceived beauty of a random series of 2D fractal trees with varying degrees of fractal symmetry. In a second experiment (two-alternative forced choice procedure), they had to express their preference for one of two shapes from the series. The shape pairs were presented successively in random order. Results show that the smallest possible fractal deviation from “symmetry of things in a thing” significantly reduces the perceived attractiveness of such shapes. The potential of future studies where different levels of complexity of fractal patterns are weighed against different degrees of symmetry is pointed out in the conclusion. (shrink)

Evolutionary epistemology (Lorenz, Vollmer) and value-driven decision theory (Pugh) are used to explain the fundamental properties of consciousness. It is shown that this approach is compatible with global workspace theory (Baars) and global neuronal workspace theory (De Haene). The emotions are, however, that what drives consciousness. A hypothetical evolutionary tree of the emotions is given – intended to show that consciousness evolves and is probably qualitatively different in different groups of animals.

This paper presents REAL, a Real-Valued Attribute Classification Tree Learning Algorithm. Several of the algorithm's unique features are explained by úe users' demands for a decision support tool to be used for evaluating financial operations strategies. Compared to competing algorithms, in our applications, REAL presents maj or advantages : (1) The REAL classification trees usually have smaller error rates. (2) A single conviction (or trust) measure at each leaf is more convenient than the traditional (probability, confidence-level) pair. (3) (...) No need for an external pruning criterion. (shrink)

The third volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents an in-depth exploration of the cutting-edge developments in uncertain combinatorics and set theory. This comprehensive collection highlights innovative methodologies such as graphization, hyperization, and uncertainization, which enhance combinatorics by incorporating foundational concepts from fuzzy, neutrosophic, soft, and rough set theories. These advancements open new mathematical horizons, offering novel approaches to managing uncertainty within complex systems. Combinatorics, a discipline focused on counting, arrangement, (...) and structure, often faces challenges when uncertainty is present. Set theory, which underpins combinatorial problems, has evolved to tackle these challenges. The introduction of fuzzy and neutrosophic sets has expanded the toolkit for modeling uncertainty by incorporating elements of truth, indeterminacy, and falsehood into decision-making processes. These innovations seamlessly intersect with graph theory, providing new ways to represent uncertain structures through "graphized" forms such as hypergraphs and superhypergraphs. This volume also introduces advanced concepts like Neutrosophic Oversets, Undersets, and Offsets, which push the boundaries of classical graph theory and offer deeper insights into the mathematical and practical challenges posed by real-world systems. By blending combinatorics, set theory, and graph theory, the authors have created a robust framework for addressing uncertainty in both mathematical systems and their real-world applications. This foundation sets the stage for future breakthroughs in combinatorics, set theory, and related fields. Each chapter in this volume contributes both theoretical foundations and practical applications, demonstrating the power of integrating graph theory, set theory, and uncertainty models. The new ideas, algorithms, and mathematical tools presented here will drive the future of combinatorial research and its applications in uncertain environments. In the first chapter, “Introduction to Upside-Down Logic: Its Deep Relation to Neutrosophic Logic and Applications”, the authors present Upside-Down Logic, a novel logical framework that systematically transforms truths into falsehoods and vice versa, based on contextual shifts. Introduced by F. Smarandache, this paper provides a mathematical definition of Upside-Down Logic, including applications related to the Japanese language. The chapter also introduces Contextual Upside-Down Logic, an extension that adjusts logical connectives alongside flipped truth values, as well as Indeterm-Upside-Down Logic and Certain Upside-Down Logic to address indeterminacy. A simple algorithm is also proposed to demonstrate the computational aspects of this logic. In the second chapter, “Local-Neutrosophic Logic and Local-Neutrosophic Sets: Incorporating Locality with Applications”, the authors introduce Local-Neutrosophic Logic and Local-Neutrosophic Sets, which integrate the concept of locality into Neutrosophic Logic. By defining locality as the influence of immediate surroundings on an object or system, this chapter explores how it affects indeterminacy in real-world problems. The paper also examines potential applications and provides mathematical definitions for these new concepts. The third chapter, “A Review of Fuzzy and Neutrosophic Offsets: Connections to Some Set Concepts and Normalization Function”, extends the concept of offsets in uncertain set-theoretic frameworks, such as Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets. This chapter introduces several advanced types of offsets, including Nonstationary Fuzzy Offset, Multi-valued Plithogenic Offset, and Subset-valued Neutrosophic Offset, offering deeper insights into handling uncertainty in mathematical models. In the fourth chapter, “Review of Plithogenic Directed, Mixed, Bidirected, and Pangene OffGraph”, the authors build upon Plithogenic Graphs to propose extensions such as Plithogenic Directed OffGraph, Plithogenic BiDirected OffGraph, and Plithogenic Mixed OffGraph. These new concepts, including the Plithogenic Pangene OffGraph, are explored in detail, with a focus on their mathematical properties and potential applications in uncertain graph theory. The fifth chapter, “Short Note on Neutrosophic Closure Matroids”, explores the extension of matroid concepts into Neutrosophic and Turiyam Neutrosophic set theories, introducing Neutrosophic closure matroids. This concept integrates uncertainty, indeterminacy, and liberal states into matroid theory, enhancing its applicability in optimization and combinatorial problems. In the sixth chapter, “Some Graph Parameters for Superhypertree-width and Neutrosophic Tree-width”, the authors discuss graph parameters such as Superhypertree-width and Neutrosophic tree-width. These parameters play a crucial role in the study of graph characteristics, particularly in algorithms and real-world applications. The chapter explores the generalization of hypergraphs to SuperHyperGraphs and examines how these concepts extend tree-width parameters within the context of Neutrosophic logic. (shrink)

Currently, under the conditions of permanent financial risks that hamper the sustainable economic growth in the financial sector, the development of evaluation and risk management methods both regulated by Basel II and III and others seem to be of special importance. The reputation risk is one of significant risks affecting reliability and credibility of commercial banks. The importance of reputation risk management and the quality of their assessment remain relevant as the probability of decrease in or loss of business reputation (...) influences the financial results and the degree of customers’, partners’ and stakeholders’ confidence. By means of imitating modeling based on Bayesian Networks and the fuzzy data analysis, the article characterizes the mechanism of reputation risk assessment and possible losses evaluation in banks by plotting normal and lognormal distribution functions. Monte-Carlo simulation is used to calculate the probability of losses caused by reputation risks. The degree of standardized histogram similarity is determined on the basis of the fuzzy data analysis applying Hamming distance method. The tree-like hierarchy based on the OWA-operator is used to aggregate the data with Fishburne's coefficients as the convolution scales. The mechanism takes into account the impact of criteria, such as return on equity, goodwill value, the risk assets ratio, the share of the productive assets in net assets, the efficiency ratio of interest bearing liabilities, the risk ratio of credit operations, the funding ratio and reliability index on the business reputation of the bank. The suggested methods and recommendations might be applied to develop the decision-making mechanism targeted at the implementation of reputation risk management system in commercial banks as well as to optimize risk management technologies. (shrink)

Our aim here is to lay the groundwork for formal tree-ring analysis combining data from dendrochronology with formal techniques from semantics. We will present the basic syntax of, and basic compositional semantics of tree-ring structures.

We study the first-order theories of some natural and important classes of coloured trees, including the four classes of trees whose paths have the order type respectively of the natural numbers, the integers, the rationals, and the reals. We develop a technique for approximating a tree as a suitably coloured linear order. We then present the first-order theories of certain classes of coloured linear orders and use them, along with the approximating technique, to establish complete axiomatisations of the four (...) classes of trees mentioned above. (shrink)

Decision-making Capacity matters to whether a patient’s decision should determine her treatment. But why it matters in this way isn’t clear. The standard story is that dmc matters because autonomy matters. And this is thought to justify dmc as a gatekeeper for autonomy – whereby autonomy concerns arise if but only if a patient has dmc. But appeals to autonomy invoke two distinct concerns: concern for authenticity – concern that a choice is consistent with an individual’s commitments; and (...) concern for sovereignty – concern that an individual exercises control over that which is hers to control. Here, I argue, neither concern can alone explain why dmc matters. Instead, dmc matters because it indicates a harmony between the two concerns – the demands of each concern are more likely to agree if a patient has dmc. This vindicates the standard story, but also makes clear that dmc is an inappropriate gatekeeper for autonomy. (shrink)

The essay presents a novel counterexample to Causal Decision Theory (CDT). Its interest is that it generates a case in which CDT violates the very principles that motivated it in the first place. The essay argues that the objection applies to all extant formulations of CDT and that the only way out for that theory is a modification of it that entails incompatibilism. The essay invites the reader to find this consequence of CDT a reason to reject it.

Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of (...) the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analysing first order definable and undefinable paths in trees. (shrink)

This paper aims to identify the decision support systems and their role on the strategic management development in the Universities- Case Study: Islamic University of Gaza. The descriptive approach was used where a questionnaire was developed and distributed to a stratified random sample. (230) questionnaires were distributed and (204) were returned with response rate (88.7%). The most important findings of the study: The presence of a statistically significant positive correlation between the decision support systems and strategic management in (...) the Islamic University in Gaza, and this shows that there is a role for decision support systems in strategic management development. The senior management is convinced of the importance of strategic management of the organization, and this conviction paid to clearly understand the process of the development of strategic management and thus led to a commitment to this process to improve its performance. There is an impact on the strategic management of the capabilities available for the use of decision support systems, and the type of decision support systems used, while there is little effect of top management support for the use of decision support systems. Also, the results showed that there were no statistically significant differences between the averages of the respondents answers attributed to personal data. The research also concluded a series of recommendations: The Islamic University of Gaza need to develop its infrastructure of decision support systems when it develops the strategic management. It should increase its interest in organizational potential through the necessity of a separate unit for decision support systems. As well as increased interest in the physical and technical capabilities available to decision support systems through continuity in keeping pace with technological means and techniques, continued support of senior management in the organization of strategic management for its positive role on decision support systems, that senior management will continue in the organization in creating a culture of strategic management, and it should encourage employees to participate in the strategic management process. (shrink)

Do trees of life have roots? What do these roots look like? In this contribution, I argue that research on the origins of life might offer glimpses on the topology of these very roots. More specifically, I argue (1) that the roots of the tree of life go well below the level of the commonly mentioned ‘ancestral organisms’ down into the level of much simpler, minimally living entities that might be referred to as ‘protoliving systems’, and (2) that further (...) below, a system of roots gradually dissolves into non-living matter along several functional dimensions. In between non-living and living matter, one finds physico-chemical systems that I propose to characterize by a ‘lifeness signature’. In turn, this ‘lifeness signature’ might also account for a diverse range of biochemical entities that are found to be ‘less-than-living’ yet ‘more-than-non-living’. (shrink)

Orthodox decision theory gives no advice to agents who hold two goods to be incommensurate in value because such agents will have incomplete preferences. According to standard treatments, rationality requires complete preferences, so such agents are irrational. Experience shows, however, that incomplete preferences are ubiquitous in ordinary life. In this paper, we aim to do two things: (1) show that there is a good case for revising decision theory so as to allow it to apply non-vacuously to agents (...) with incomplete preferences, and (2) to identify one substantive criterion that any such non-standard decision theory must obey. Our criterion, Competitiveness, is a weaker version of a dominance principle. Despite its modesty, Competitiveness is incompatible with prospectism, a recently developed decision theory for agents with incomplete preferences. We spend the final part of the paper showing why Competitiveness should be retained, and prospectism rejected. (shrink)

Evidential decision theory (EDT) says that the choiceworthiness of an option depends on its evidential connections to possible outcomes. Causal decision theory (CDT) holds that it depends on your beliefs about its causal connections. While Newcomb cases support CDT, Arif Ahmed has described examples that support EDT. A new account is needed to get all cases right. I argue that an option A's choiceworthiness is determined by the probability that a good outcome ensues at possible A‐worlds that match (...) actuality in the facts causally unaffected by your decision (the “unaffected facts”). Moreover, you should evaluate A on the assumption that A is compossible with the unaffected facts. This view entails that you should use EDT when evaluating A on the assumption that the unaffected facts determine your action, but use CDT when assessing A on the opposite assumption. A's choiceworthiness equals a weighted average of these conditional assessments. The weights are determined by your beliefs about whether the unaffected fact determine your action. This account gets both Newcomb and Ahmed cases right. According to an influential view, whether you take the unaffected facts to determine your action can make a difference to whether you can regard yourself as free and the action as being under your control. While my account is neutral on this issue, it entails that whether you take the unaffected facts to determine your action is important in a different way: it matters to whether you should follow EDT or CDT. (shrink)

My topic is how to make decisions when you possess foreknowledge of the consequences of your choice. Many have thought that these kinds of decisions pose a distinctive and novel problem for causal decision theory (CDT). My thesis is that foreknowledge poses no new problems for CDT. Some of the purported problems are not problems. Others are problems, but they are not problems for CDT. Rather, they are problems for our theories of subjunctive supposition. Others are problems, but they (...) are not new problems. They are old problems transposed into a new key. Nonetheless, decisions made with foreknowledge illustrate important lessons about the instrumental value of our choices. Once we've appreciated these lessons, we are left with a version of CDT which faces no novel threats from foreknowledge. (shrink)

Decision theory has at its core a set of mathematical theorems that connect rational preferences to functions with certain structural properties. The components of these theorems, as well as their bearing on questions surrounding rationality, can be interpreted in a variety of ways. Philosophy’s current interest in decision theory represents a convergence of two very different lines of thought, one concerned with the question of how one ought to act, and the other concerned with the question of what (...) action consists in and what it reveals about the actor’s mental states. As a result, the theory has come to have two different uses in philosophy, which we might call the normative use and the interpretive use. It also has a related use that is largely within the domain of psychology, the descriptive use. This essay examines the historical development of decision theory and its uses; the relationship between the norm of decision theory and the notion of rationality; and the interdependence of the uses of decision theory. (shrink)

The dispute in philosophical decision theory between causalists and evidentialists remains unsettled. Many are attracted to the causal view’s endorsement of a species of dominance reasoning, and to the intuitive verdicts it gets on a range of cases with the structure of the infamous Newcomb’s Problem. But it also faces a rising wave of purported counterexamples and theoretical challenges. In this paper I will describe a novel decision theory which saves what is appealing about the causal view while (...) avoiding its most worrying objections, and which promises to generalize to solve a set of related problems in other normative domains. (shrink)

I defend counterfactual decision theory, which says that you should evaluate an action in terms of which outcomes would likely obtain were you to perform it. Counterfactual decision theory has traditionally been subsumed under causal decision theory as a particular formulation of the latter. This is a mistake. Counterfactual decision theory is importantly different from, and superior to, causal decision theory, properly so called. Causation and counterfactuals come apart in three kinds of cases. In cases (...) of overdetermination, an action can cause a good outcome without the latter counterfactually depending on the former. In cases of constitution, an action can constitute a good outcome rather than causing it. And in cases of determinism, either the laws or the past counterfactually depend on your action, even though your action cannot cause the laws or the past to be different. In each of these cases, it is counterfactual decision theory which gives the right verdict, and for the right reasons. (shrink)

A de minimis risk is defined as a risk that is so small that it may be legitimately ignored when making a decision. While ignoring small risks is common in our day-to-day decision making, attempts to introduce the notion of a de minimis risk into the framework of decision theory have run up against a series of well-known difficulties. In this paper, I will develop an enriched decision theoretic framework that is capable of overcoming two major (...) obstacles to the modelling of de minimis risk. The key move is to introduce, into decision theory, a non-probabilistic conception of risk known as normic risk. (shrink)

Decision-making capacity (DMC) plays an important role in clinical practice—determining, on the basis of a patient’s decisional abilities, whether they are entitled to make their own medical decisions or whether a surrogate must be secured to participate in decisions on their behalf. As a result, it’s critical that we get things right—that our conceptual framework be well-suited to the task of helping practitioners systematically sort through the relevant ethical considerations in a way that reliably and transparently delivers correct verdicts (...) about who should and should not have the authority to make their own medical decisions. Unfortunately, however, the standard approach to DMC does not get things right. It is of virtually no help in identifying and clarifying the relevant ethical considerations. And, embedded in the prevailing anti-paternalist paradigm, DMC assessments obfuscate and distort the underlying ethical justification for granting or withholding decisional authority. Here, we describe the core commitments of the standard approach to DMC and then highlight three problems with it. We then argue that these problems are significant enough that they call for more than merely tinkering and fine tuning—variations of the standard approach cannot adequately address them. Instead, we should ditch DMC. (shrink)

The classic formulation of causal decision theory (CDT) appeals to counterfactuals. It says that you should aim to choose an option that would have a good outcome, were you to choose it. However, this version of CDT faces trouble if the laws of nature are deterministic. After all, the standard theory of counterfactuals says that, if the laws are deterministic, then if anything—including the choice you make—were different in the present, either the laws would be violated or the distant (...) past would be changed. And as several authors have shown, it's easy to transform this upshot of the standard theory of counterfactuals into full-blown counterexamples to CDT. In response to these counterexamples, I argue here that the problem lies, not so much with CDT's guiding idea—that it's the expected causal consequences of your actions that matter for rational decision-making—but with the fact that the classic formulation of CDT doesn't pay sufficient attention to the context-sensitivity of counterfactuals. I develop a contextualist version of CDT which better accounts for this context-sensitivity. And I show that my theory avoids the problems faced by the classic formulation of CDT in determinstic worlds. (shrink)

The role of causation and counterfactuals in causal decision theory is vexed and disputed. Recently, Brian Hedden (2023) argues that we should abandon causal decision theory in favour of an alternative: counterfactual decision theory. I argue that, pace Hedden, counterfactual decision theory is not a competitor to, but rather a version of, causal decision theory – the most popular version by far. I provide textual evidence that the founding fathers of causal decision theory (Stalnaker, (...) Gibbard, Harper, Lewis, Skyrms, Sobel, and Joyce) all endorse counterfactual decision theories. I additionally discuss why these theories came to be called ‘causal’, rather than ‘counterfactual’. And I argue that, properly understood, causal decision theory escapes Hedden's objections. (shrink)