Show simple item record

dc.contributor.advisorJenssen, Robert
dc.contributor.authorVikjord, Vidar Vangen
dc.date.accessioned2012-11-02T10:00:39Z
dc.date.available2012-11-02T10:00:39Z
dc.date.issued2012-06-01
dc.description.abstractThe machine learning field based on information theory has received a lot of attention in recent years. Through kernel estimation of the probability density functions, methods developed with information theoretic measures are able to use all the statistical information available in the data, not just a finite number of moments. However, by using kernel estimation, the methods are dependent on choosing a suitable bandwidth parameter and have trouble dealing with data which vary on different scales. In this thesis, the field of information theoretic learning has been explored using k-nearest neighbor estimates for the probability density functions instead. The developed estimators of the information theoretic measures was used in a clustering routine and compared with the traditional kernel estimators.Performing clustering on a range of datasets and comparing the performance, the new method proved to provide superior results without the need of tuning any parameters. The performance difference was found to be especially large when clustering datasets where groups were on different scales.en
dc.identifier.urihttps://hdl.handle.net/10037/4608
dc.identifier.urnURN:NBN:no-uit_munin_4324
dc.language.isoengen
dc.publisherUniversitetet i Tromsøen
dc.publisherUniversity of Tromsøen
dc.rights.accessRightsopenAccess
dc.rights.holderCopyright 2012 The Author(s)
dc.rights.urihttps://creativecommons.org/licenses/by-nc-sa/3.0en_US
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)en_US
dc.subject.courseIDFYS-3921en
dc.subjectVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Kunnskapsbaserte systemer: 425en
dc.subjectVDP::Mathematics and natural science: 400::Information and communication science: 420::Knowledge based systems: 425en
dc.titleInformation theoretic learning with K nearest neighbors : a new clustering algorithmen
dc.typeMaster thesisen
dc.typeMastergradsoppgaveen


File(s) in this item

Thumbnail
Thumbnail

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)