4591 search results - page 19 / 919 » Learning from Dyadic Data |
KDD
1999
ACM
13 years 11 months ago
1999
ACM
In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrat...
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
PKDD
1999
Springer
13 years 11 months ago
1999
Springer
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
FUZZIEEE
2007
IEEE
14 years 1 months ago
2007
IEEE
— Incremental rule base learning techniques can be used to learn models and classifiers from interval or fuzzyvalued data. These algorithms are efficient when the observation e...
DAGM
2004
Springer
14 years 4 days 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...