| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Matematični modeli diskretnih acikličnih odločitvenih procesov
Authors:ID Kolmanič, Tadej (Author)
ID Bokal, Drago (Mentor) More about this mentor... New window
Files:.pdf UNI_Kolmanic_Tadej_2013.pdf (943,57 KB)
MD5: BB1A3390EB3BFF013172C125B7F63FED
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V diplomskem delu smo analizirali problem sprejemanja odločitev, s katerim se srečujemo vsakodnevno. S pomočjo matematičnega modela smo formalno opisali diskreten aciklični odločitveni proces in s tem pripomogli k izboljšanju učinkovitosti pri odločanju in k pravilnejšim izbiram pri le tem. V prvem delu smo opisali odločitvena drevesa, s pomočjo katerih grafično predstavimo sam problem, odločitve ter rešitve problema. Spoznali smo definicijo odločitvenih dreves ter njihov namen. V nadaljevanju smo opisali še, kako jih gradimo ter kaj so njihove prednosti ter slabosti. Nato smo podrobneje opisali dve vrsti odločitvenih dreves: klasifikacijska in regresijska drevesa. Prav tako smo spoznali programsko opremo za odločitvena drevesa, nekoliko podrobneje orodje Weka. V drugem delu smo najprej spoznali sisteme za podporo odločanju na splošno. Nato smo opisali ekspertne sisteme, sisteme za podporo odločanju na osnovi znanja ter samo modeliranje znanja. Na koncu smo podrobneje opisali še proces odločanja in matematično notacijo tega procesa. V zadnjem delu smo opisali matematično strukturo modela diskretnega acikličnega odločitvenega procesa ter algoritem, s katerim pridemo do optimalne rešitve. Dokazali smo izrek, ki pravi, da je skozi celoten postopek opisanega algoritma optimalna rešitev vedno v množici dosegljivih rešitev.
Keywords:odločitvena drevesa, sistemi za podporo odločanju, odločitveni proces, vozlišča, problem iskanja optimalne rešitve, algoritem.
Place of publishing:Maribor
Publisher:[T. Kolmanič]
Year of publishing:2013
PID:20.500.12556/DKUM-41239 New window
UDC:51(043.2)
COBISS.SI-ID:20030216 New window
NUK URN:URN:SI:UM:DK:4J8PAKW8
Publication date in DKUM:11.09.2013
Views:2949
Downloads:201
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:Mathematical models of discrete acyclic decision processes
Abstract:In this graduate thesis, we analyzed the problem of decision making, which we encounter on a daily basis. With the help of the mathematical model, we formally described discrete acyclic decision process and thereby contribute to an improvement of efficiency in decision making and enhancing correctness of choices in decision process. In the first part, we described decision trees, by means of which we graphically represent a decision problem, its decisions and solutions. We described how we build decision trees using data mining approach and what are their advantages and disadvantages. Then we described, in details, two kinds of decision trees: classification and regression trees. Also, we introduce a software Weka for decision trees. In the second part, we first introduce general decision support systems. Then we described expert systems, knowledge based decision support systems, and knowledge modelling. At the end we described decision process and its mathematical notation. In the last part, we described mathematical model of discrete acyclic decision process and an algorithm, with which we get an optimal solution. We prove a theorem stating sufficient conditions on the mathematical structure of the model that ensures the optimal solution to be in the set of reachable solutions through the entire procedure, thereby ensuring optimality of the final solution.
Keywords:decision trees, decision support systems, decision process, vertices, problem of finding an optimal solution, algorithm


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica