نتایج جستجو برای: fuzzy decision tree
تعداد نتایج: 572521 فیلتر نتایج به سال:
The norms and conorms family tree root is uninorm. It will be shown, that distance based operators satisfy most of properties of generally defined parametrical operators. Based on this theory some new types of fuzzy integrals are introduced theoretically. It can be shown, that the reason used for fuzzy integral introduction is similar to the reasons in decision-making by fuzzy control logic.
This paper introduces a new software product FuzzME. It was developed as a tool for creating fuzzy models of multiple-criteria evaluation and decision making. The type of evaluations employed in the fuzzy models fully corresponds with the paradigm of the fuzzy set theory; the evaluations express the (fuzzy) degrees of fulfillment of corresponding goals. The FuzzME software takes advantage of li...
مقدمه: درعلم آمارسنتی همه پارامترها بوسیله مدلهای ریاضی ومشاهده های تجربی تعریف می شد. بعضی وقتها به نظر می رسد چنین فرضهایی برای مسائل زندگی روزمره سختگیرانه باشد.مخصوصا درصورتیکه ما با داده های زبان شناسی یا احتیاجاتی که صریح نباشند سرکارداشته باشیم. برای اینکه این مشکل را ازبین ببریم ازروش فازی استفاده می کنیم. تعریف مسئله: درمرحله اول از تحقیق درباره انواع مختلف از پدیده(زیستی-فنی-فیزیک...
In this paper, a new method of fuzzy decision trees called soft decision trees (SDT) is presented. This method combines tree growing and pruning, to determine the structure of the soft decision tree, with re4tting and back4tting, to improve its generalization capabilities. The method is explained and motivated and its behavior is 4rst analyzed empirically on 3 large databases in terms of classi...
Data mining is having an aim to analyze the observation datasets to find relationship and to present the data in ways that are both understandable and usable. This paper basically focuses on the classification technique of datamining to identify the class of an attribute with an ID3 (classical decision tree approach) and then to add fuzzification to improve the result of ID3.It also contains de...
Decision tree induction is typically based on a top-down greedy algorithm that makes locally optimal decisions at each node. Due to the greedy and local nature of the decisions made at each node, there is considerable possibility of instances at the node being split along branches such that instances along some or all of the branches require a large number of additional nodes for classification...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید