<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Inference algorithms for pattern-based CRFs on sequence data</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>JMLR</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Rustem</namePart>
  <namePart type="family">Takhanov</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2CCAC26C-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Vladimir</namePart>
  <namePart type="family">Kolmogorov</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3D50B0BA-F248-11E8-B48F-1D18A9856A87</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">VlKo</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>ICML: International Conference on Machine Learning</namePart>
</name>






<abstract lang="eng">We consider Conditional Random Fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) x1...xn is the sum of terms over intervals [i,j] where each term is non-zero only if the substring xi...xj equals a prespecified pattern α. Such CRFs can be naturally applied to many sequence tagging problems.
We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively O(nL), O(nLℓmax) and O(nLmin{|D|,log(ℓmax+1)}) where L is the combined length of input patterns, ℓmax is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of (Ye et al., 2009) whose complexities are respectively O(nL|D|), O(n|Γ|L2ℓ2max) and O(nL|D|), where |Γ| is the number of input patterns.
In addition, we give an efficient algorithm for sampling. Finally, we consider the case of non-positive weights. (Komodakis &amp;amp; Paragios, 2009) gave an O(nL) algorithm for computing the MAP. We present a modification that has the same worst-case complexity but can beat it in the best case. </abstract>

<originInfo><publisher>ML Research Press</publisher><dateIssued encoding="w3cdtf">2013</dateIssued><place><placeTerm type="text">Atlanta, GA, USA</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>ICML&apos;13 Proceedings of the 30th International Conference on International</title></titleInfo>
  <identifier type="ISI">000381149500002</identifier>
<part><detail type="volume"><number>28</number></detail><detail type="issue"><number>3</number></detail><extent unit="pages">145 - 153</extent>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/1794</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<apa>Takhanov, R., &amp;#38; Kolmogorov, V. (2013). Inference algorithms for pattern-based CRFs on sequence data. In &lt;i&gt;ICML’13 Proceedings of the 30th International Conference on International&lt;/i&gt; (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.</apa>
<ieee>R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in &lt;i&gt;ICML’13 Proceedings of the 30th International Conference on International&lt;/i&gt;, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.</ieee>
<chicago>Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” In &lt;i&gt;ICML’13 Proceedings of the 30th International Conference on International&lt;/i&gt;, 28:145–53. ML Research Press, 2013.</chicago>
<short>R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International Conference on International, ML Research Press, 2013, pp. 145–153.</short>
<ama>Takhanov R, Kolmogorov V. Inference algorithms for pattern-based CRFs on sequence data. In: &lt;i&gt;ICML’13 Proceedings of the 30th International Conference on International&lt;/i&gt;. Vol 28. ML Research Press; 2013:145-153.</ama>
<ista>Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs on sequence data. ICML’13 Proceedings of the 30th International Conference on International. ICML: International Conference on Machine Learning, JMLR, vol. 28, 145–153.</ista>
<mla>Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” &lt;i&gt;ICML’13 Proceedings of the 30th International Conference on International&lt;/i&gt;, vol. 28, no. 3, ML Research Press, 2013, pp. 145–53.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>2272</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:56:41Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-29T14:28:48Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
