Sciweavers

411 search results - page 23 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
ECIR
2010
Springer
13 years 9 months ago
A Case for Automatic System Evaluation
Ranking a set retrieval systems according to their retrieval effectiveness without relying on relevance judgments was first explored by Soboroff et al. [13]. Over the years, a numb...
Claudia Hauff, Djoerd Hiemstra, Leif Azzopardi, Fr...
BMCBI
2011
12 years 11 months ago
A Simple Approach to Ranking Differentially Expressed Gene Expression Time Courses through Gaussian Process Regression
Background: The analysis of gene expression from time series underpins many biological studies. Two basic forms of analysis recur for data of this type: removing inactive (quiet) ...
Alfredo A. Kalaitzis, Neil D. Lawrence
ICML
2005
IEEE
14 years 8 months ago
Incomplete-data classification using logistic regression
A logistic regression classification algorithm is developed for problems in which the feature vectors may be missing data (features). Single or multiple imputation for the missing...
David Williams, Xuejun Liao, Ya Xue, Lawrence Cari...
JMLR
2010
179views more  JMLR 2010»
13 years 2 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon