Sciweavers

1601 search results - page 181 / 321
» Closed Sets for Labeled Data
Sort
View
SEMWEB
2004
Springer
15 years 11 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez
BILDMED
2008
147views Algorithms» more  BILDMED 2008»
15 years 7 months ago
Automatic Liver Segmentation Using the Random Walker Algorithm
In this paper we present a new method for fully automatic liver segmentation in computed tomography images. First, an initial set of seed points for the random walker algorithm is ...
Florian Maier, Andreas Wimmer, Grzegorz Soza, Jens...
COLING
2008
15 years 7 months ago
Stopping Criteria for Active Learning of Named Entity Recognition
Active learning is a proven method for reducing the cost of creating the training sets that are necessary for statistical NLP. However, there has been little work on stopping crit...
Florian Laws, Hinrich Schütze
EMNLP
2007
15 years 7 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii
LWA
2008
15 years 7 months ago
Weighted Voting as Approximate MAP Prediction in Pairwise Classification
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...
Eyke Hüllermeier, Stijn Vanderlooy