lnu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Decisions: Algebra and Implementation
Linnéuniversitetet, Fakultetsnämnden för naturvetenskap och teknik, Institutionen för datavetenskap, fysik och matematik, DFM. (Software Technology Group)
2011 (Engelska)Licentiatavhandling, monografi (Övrigt vetenskapligt)
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.

Ort, förlag, år, upplaga, sidor
Växjö: School of Computer Science, Physics and Mathematics, Linnaeus University , 2011. , s. 131
Nyckelord [en]
Classification, decision algebra, decision function, decision information, learning
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Data- och informationsvetenskap, Datavetenskap
Identifikatorer
URN: urn:nbn:se:lnu:diva-16283Libris ID: 12457554OAI: oai:DiVA.org:lnu-16283DiVA, id: diva2:468823
Presentation
2011-08-22, 15:39 (Engelska)
Opponent
Handledare
Anmärkning

A thesis for the Degree of Licentiate of Philosophy in Computer Science.

Tillgänglig från: 2011-12-22 Skapad: 2011-12-21 Senast uppdaterad: 2018-01-12Bibliografiskt granskad

Open Access i DiVA

Licentiate Thesis (Full Text)(1642 kB)998 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 1642 kBChecksumma SHA-512
3b80473eee153a9895326b89ea3f5f9405bf86ddab799c714570d3168b0809ee5c1f4196ef36879a6597609c36c8a5655d947e1ea389db7d679f2a94c245089e
Typ fulltextMimetyp application/pdf

Person

Danylenko, Antonina

Sök vidare i DiVA

Av författaren/redaktören
Danylenko, Antonina
Av organisationen
Institutionen för datavetenskap, fysik och matematik, DFM
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 998 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 338 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf