5463 search results - page 477 / 1093 » Evaluating algorithms that learn from data streams |
196
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
207
click to vote
ICML
2004
IEEE
16 years 7 days ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
204
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
200
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
168
click to vote
ALMOB
2007
15 years 7 months ago
2007
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...