1601 search results - page 42 / 321 » Closed Sets for Labeled Data |
ACL
2008
14 years 6 days ago
2008
Parse-tree paths are commonly used to incorporate information from syntactic parses into NLP systems. These systems typically treat the paths as atomic (or nearly atomic) features...
IROS
2009
IEEE
14 years 5 months ago
2009
IEEE
— In this paper we present a new approach for labeling 3D points with different geometric surface primitives using a novel feature descriptor – the Fast Point Feature Histogram...
PAKDD
2005
ACM
14 years 4 months ago
2005
ACM
Self-training is a semi-supervised learning algorithm in which a learner keeps on labeling unlabeled examples and retraining itself on an enlarged labeled training set. Since the s...
ACL
2001
14 years 4 days ago
2001
The amount of readily available on-line text has reached hundreds of billions of words and continues to grow. Yet for most core natural language tasks, algorithms continue to be o...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...