4591 search results - page 139 / 919 » Learning from Dyadic Data |
128
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
134
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
151
click to vote
JASIS
2000
15 years 3 months ago
2000
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
151
click to vote
ML
2000
ACM
15 years 3 months ago
2000
ACM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
127
Voted
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...