Počet záznamů: 1  

K-best Viterbi Semi-supervized Active Learning in Sequence Labelling

  1. 1.
    0478628 - ÚI 2018 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
    Šabata, T. - Borovička, T. - Holeňa, Martin
    K-best Viterbi Semi-supervized Active Learning in Sequence Labelling.
    Proceedings ITAT 2017: Information Technologies - Applications and Theory. Aachen & Charleston: Technical University & CreateSpace Independent Publishing Platform, 2017 - (Hlaváčová, J.), s. 144-152. CEUR Workshop Proceedings, V-1885. ISBN 978-1974274741. ISSN 1613-0073.
    [ITAT 2017. Conference on Theory and Practice of Information Technologies - Applications and Theory /17./. Martinské hole (SK), 22.09.2017-26.09.2017]
    Grant CEP: GA ČR GA17-01251S
    Grant ostatní: ČVUT(CZ) SGS17/210/OHK3/3T/18
    Institucionální podpora: RVO:67985807
    Klíčová slova: active learning * semi-supervised learning * sequence labelling * Viterbi algorithm
    Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://ceur-ws.org/Vol-1885/144.pdf

    In application domains where there exists a large amount of unlabelled data but obtaining labels is expensive, active learning is a useful way to select which data should be labelled. In addition to its traditional successful use in classification and regression tasks, active learning has been also applied to sequence labelling. According to the standard active learning approach, sequences for which the labelling would be the most informative should be labelled. However, labelling the entire sequence may be inefficient as for some its parts, the labels can be predicted using a model. Labelling such parts brings only a little new information. Therefore in this paper, we investigate a sequence labelling approach in which in the sequence selected for labelling, the labels of most tokens are predicted by a model and only tokens that the model can not predict with sufficient confidence are labelled. Those tokens are identified using the k-best Viterbi algorithm.
    Trvalý link: http://hdl.handle.net/11104/0274763

     
    Název souboruStaženoVelikostKomentářVerzePřístup
    a0478628.pdf3411.8 KBVydavatelský postprintvyžádat
     
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.