Change search
ReferencesLink to record
Permanent link

Direct link
Decisions: Algebra and Implementation
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics. (Software Technology Group)
2011 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Processing decision information is a constitutive part in a number of applicationsin Computer Science fields. In general, decision information can be used to deduce the relationship between a certain context and a certain decision. Decision information is represented by a decision model that captures this information. Frequently used examples of decision models are decision tables and decision trees. The choice of an appropriate decision model has an impact on application performance in terms of memory consumption and execution time. High memory expenses can possibly occur due to redundancy in a decision model; and high execution time is often a consequence of an unsuitable decision model.

Applications in different domains try to overcome these problems by introducing new data structures or algorithms for implementing decision models. These solutions are usually domain-specificand hard to transfer from one domain to another. Different application domains of Computer Science often process decision information in a similar way and, hence, have similar problems. We should thus be able to present a unifying approach that can be applicable in all application domains for capturing and manipulating decision information. Therefore, the goal of this thesis is (i) to suggest a general structure(Decision Algebra) which provides a common theoretical framework that captures decision information and defines operations (signatures) for storing, accessing, merging, approximating, and manipulating such information along with some general algebraic laws regardless of the used implementation. Our Decision Algebra allows defining different construction strategiesfor decision models and data structures that capture decision information as implementation variants, and it simplifies experimental comparisons between them.

Additionally, this thesis presents (ii) an implementation of Decision Algebra capturing the information in a non-redundant way and performing the operations efficiently. In fact, we show that existing decision models that originated in the field of Data Mining and Machine Learning and variants thereof as exploited in special algorithms can be understood as alternative implementation variants of the Decision Algebra by varying the implementations of the Decision Algebra operations. Hence, this work (iii) will contribute to a classification of existing technology for processing decision information in different application domains of Computer Science.

Place, publisher, year, edition, pages
Växjö: Linnaeus University , 2011. , 131 p.
Keyword [en]
Classification, decision algebra, decision function, decision information, learning
National Category
Computer Science
Research subject
Computer and Information Sciences Computer Science, Computer Science
URN: urn:nbn:se:lnu:diva-16283OAI: diva2:468823
2011-08-22, 15:39 (English)
in Computer ScienceAvailable from: 2011-12-22 Created: 2011-12-21 Last updated: 2011-12-22Bibliographically approved

Open Access in DiVA

fulltext(1642 kB)433 downloads
File information
File name FULLTEXT01.pdfFile size 1642 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Danylenko, Antonina
By organisation
School of Computer Science, Physics and Mathematics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 433 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 170 hits
ReferencesLink to record
Permanent link

Direct link