599 search results - page 7 / 120 » Position Paper: Ontology Learning from Folksonomies |
RIA
2006
13 years 8 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
WAIM
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The problem of classification from positive and unlabeled examples attracts much attention currently. However, when the number of unlabeled negative examples is very sma...
ECML
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
ALT
2004
Springer
14 years 5 months ago
2004
Springer
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...