Sciweavers

411 search results - page 35 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 11 months ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
SIGIR
2008
ACM
13 years 9 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
VLDB
1997
ACM
66views Database» more  VLDB 1997»
14 years 1 months ago
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
Khaled Alsabti, Sanjay Ranka, Vineet Singh
ICML
2006
IEEE
14 years 9 months ago
Convex optimization techniques for fitting sparse Gaussian graphical models
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in such a way that the inverse is sparse, thus providing model selection. Beginnin...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
EUROPAR
2009
Springer
14 years 1 months ago
Distributed Data Partitioning for Heterogeneous Processors Based on Partial Estimation of Their Functional Performance Models
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
Alexey L. Lastovetsky, Ravi Reddy