Title: TildeCRF: Conditional random fields for logical sequences
Authors: Gutmann, Bernd ×
Kersting, Kristian #
Issue Date: Sep-2006
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:4212 pages:174-185
Conference: 17th European Conference on Machine Learning (ECML 2006) location:Berlin, Germany date:18-22 September 2006
Abstract: Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat alphabets. In this paper, we describe TildeCRF, the first method for training CRFs on logical sequences, i.e., sequences over an alphabet of logical atoms. TildeCRF's key idea is to use relational regression trees in Dietterich et al.'s gradient tree boosting approach. Thus, the CRF potential functions are represented as weighted sums of relational regression trees. Experiments show a significant improvement over established results achieved with hidden Markov models and Fisher kernels for logical sequences.
Description: acceptance rate = 14.5% (full papers)
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
gutmannKerstingECML06.pdf Published 176KbAdobe PDFView/Open
TildeCRF_Slides.pdfPresentation slides Published 1835KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science