Sciweavers

206 search results - page 41 / 42
» Predicting incomplete gene microarray data with the use of s...
Sort
View
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
13 years 10 months ago
Grouped graphical Granger modeling methods for temporal causal modeling
We develop and evaluate an approach to causal modeling based on time series data, collectively referred to as“grouped graphical Granger modeling methods.” Graphical Granger mo...
Aurelie C. Lozano, Naoki Abe, Yan Liu, Saharon Ros...
JMLR
2010
179views more  JMLR 2010»
13 years 25 days 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
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 8 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 7 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
ICGA
2007
157views Optimization» more  ICGA 2007»
13 years 6 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
Rémi Coulom