liu.seSearch for publications in DiVA

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt860",{id:"formSmash:upper:j_idt860",widgetVar:"widget_formSmash_upper_j_idt860",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt861_j_idt864",{id:"formSmash:upper:j_idt861:j_idt864",widgetVar:"widget_formSmash_upper_j_idt861_j_idt864",target:"formSmash:upper:j_idt861:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

On approximations and computations in probabilistic classification and in learning of graphical modelsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2007 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Matematiska institutionen , 2007. , p. 22
##### Series

Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1141
##### Keywords [en]

Mathematical statistics, factorizations, probabilistic classification, nodes, DNA strings
##### National Category

Probability Theory and Statistics
##### Identifiers

URN: urn:nbn:se:liu:diva-11429ISBN: 978-91-85895-58-8 (print)OAI: oai:DiVA.org:liu-11429DiVA, id: diva2:17846
##### Public defence

2007-12-14, Visionen, Hus B, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt1166",{id:"formSmash:j_idt1166",widgetVar:"widget_formSmash_j_idt1166",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt1172",{id:"formSmash:j_idt1172",widgetVar:"widget_formSmash_j_idt1172",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt1178",{id:"formSmash:j_idt1178",widgetVar:"widget_formSmash_j_idt1178",multiple:true}); Available from: 2008-03-31 Created: 2008-03-31 Last updated: 2012-11-21
##### List of papers

Model based probabilistic classification is heavily used in data mining and machine learning. For computational learning these models may need approximation steps however. One popular approximation in classification is to model the class conditional densities by factorization, which in the independence case is usually called the ’Naïve Bayes’ classifier. In general probabilistic independence cannot model all distributions exactly, and not much has been published on how much a discrete distribution can differ from the independence assumption. In this dissertation the approximation quality of factorizations is analyzed in two articles.

A specific class of factorizations is the factorizations represented by graphical models. Several challenges arise from the use of statistical methods for learning graphical models from data. Examples of problems include the increase in the number of graphical model structures as a function of the number of nodes, and the equivalence of statistical models determined by different graphical models. In one article an algorithm for learning graphical models is presented. In the final article an algorithm for clustering parts of DNA strings is developed, and a graphical representation for the remaining DNA part is learned.

1. Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation$(function(){PrimeFaces.cw("OverlayPanel","overlay17842",{id:"formSmash:j_idt1232:0:j_idt1236",widgetVar:"overlay17842",target:"formSmash:j_idt1232:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Concentrated or non-concentrated discrete distributions are almost independent$(function(){PrimeFaces.cw("OverlayPanel","overlay17843",{id:"formSmash:j_idt1232:1:j_idt1236",widgetVar:"overlay17843",target:"formSmash:j_idt1232:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Parallell interacting MCMC for learning of topologies of graphical models$(function(){PrimeFaces.cw("OverlayPanel","overlay17844",{id:"formSmash:j_idt1232:2:j_idt1236",widgetVar:"overlay17844",target:"formSmash:j_idt1232:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. A bayesian random fragment insertion model for de novo detection of DNA regulatory binding regions$(function(){PrimeFaces.cw("OverlayPanel","overlay17845",{id:"formSmash:j_idt1232:3:j_idt1236",widgetVar:"overlay17845",target:"formSmash:j_idt1232:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1926",{id:"formSmash:j_idt1926",widgetVar:"widget_formSmash_j_idt1926",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1982",{id:"formSmash:lower:j_idt1982",widgetVar:"widget_formSmash_lower_j_idt1982",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1983_j_idt1985",{id:"formSmash:lower:j_idt1983:j_idt1985",widgetVar:"widget_formSmash_lower_j_idt1983_j_idt1985",target:"formSmash:lower:j_idt1983:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});