1601 search results - page 62 / 321 » Closed Sets for Labeled Data |
ACL
2009
14 years 9 months ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
CORR
1999
Springer
14 years 11 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
102
click to vote
JCT
2007
14 years 11 months ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
118
click to vote
ICDM
2007
IEEE
15 years 3 months ago
2007
IEEE
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...