Sciweavers

164 search results - page 20 / 33
» Maximally joining probabilistic data
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 2 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
77
Voted
ICML
2003
IEEE
15 years 10 months ago
Unsupervised Learning with Permuted Data
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...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
TKDE
2010
274views more  TKDE 2010»
14 years 8 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
ICML
1997
IEEE
15 years 10 months ago
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...
Nir Friedman
68
Voted
JMLR
2010
117views more  JMLR 2010»
14 years 4 months ago
Bayesian Online Learning for Multi-label and Multi-variate Performance Measures
Many real world applications employ multivariate performance measures and each example can belong to multiple classes. The currently most popular approaches train an SVM for each ...
Xinhua Zhang, Thore Graepel, Ralf Herbrich