Machine learning methods based on probabilistic decision tree under the multi-valued preference environment
نویسندگان
چکیده
In the classification calculation, data are sometimes not unique and there different values probabilities. Then, it is meaningful to develop appropriate methods make decision. To solve this issue, paper proposes machine learning based on a probabilistic decision tree (DT) under multi-valued preference environment respectively for aims. First, develops pre-processing method deal with weight quantity matching environment. method, we use least common multiple assignments balance probability of each preference. training data, introduces entropy further optimize DT model After that, corresponding calculation rules classifications given. addition, considering numbers probabilities preferences, also uses Furthermore, similarly derived. At last, demonstrate feasibility models above two environments illustrated examples.
منابع مشابه
Multi-attribute group decision making based on Choquet integral under interval-valued intuitionistic fuzzy environment
In this paper, we propose new methods to represent interdependence among alternative attributes and experts’ opinions by constructing Choquet integral using interval-valued intuitionistic fuzzy numbers. In the sequel, we apply these methods to solve the multiple attribute group decision-making (MAGDM) problems under interval-valued intuitionistic fuzzy environment. First, the concept of interva...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملAutomatic preference learning on numeric and multi-valued categorical attributes
One of the most challenging tasks in the development of recommender systems is the design of techniques that can infer the preferences of users through the observation of their actions. Those preferences are essential to obtain a satisfactory accuracy in the recommendations. Preference learning is especially difficult when attributes of different kinds (numeric or linguistic) intervene in the p...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ekonomska Istrazivanja-economic Research
سال: 2021
ISSN: ['1848-9664', '1331-677X']
DOI: https://doi.org/10.1080/1331677x.2021.1875866