Number of the records: 1  

On Assigning Probabilities to New Hypotheses

  1. 1.
    SYSNO ASEP0544189
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleOn Assigning Probabilities to New Hypotheses
    Author(s) Kárný, Miroslav (UTIA-B) RID, ORCID
    Number of authors1
    Source TitlePattern Recognition Letters. - : Elsevier - ISSN 0167-8655
    Roč. 150, č. 1 (2021), s. 170-175
    Number of pages6 s.
    Publication formPrint - P
    Languageeng - English
    CountryNL - Netherlands
    Keywordsminimum relative-entropy principle ; prior probability ; hypothesis
    Subject RIVIN - Informatics, Computer Science
    OECD categoryComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    R&D ProjectsLTC18075 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    Method of publishingLimited access
    Institutional supportUTIA-B - RVO:67985556
    UT WOS000694711500021
    EID SCOPUS85111504429
    DOI10.1016/j.patrec.2021.07.011
    AnnotationThe paper proposes the way how to assign a proper prior probability to a new, generally compound, hypothesis. To this purpose, it uses the minimum relative-entropy principle
    and a forecaster-based knowledge transfer. Methodologically, it opens a way towards enriching the standard Bayesian framework by the possibility to extend the set of models during learning without the need to restart. The presented use scenarios concern: (a) creating new hypotheses, (b) learning problems with an insuffcient amount of data, and
    (c) sequential Monte Carlo estimation. They indicate a strong application potential of the proposed technique. Related interesting open research problems are listed.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2022
    Electronic addresshttps://www.sciencedirect.com/science/article/pii/S0167865521002567
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.