9 search results - page 1 / 2 » Weakly-Supervised Acquisition of Labeled Class Instances usi... |
95
Voted
EMNLP
2008
15 years 2 months ago
2008
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
98
Voted
CAI
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
111
Voted
DAGM
2004
Springer
15 years 6 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
110
Voted
ACL
2010
14 years 11 months ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
175
Voted
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...