Sciweavers

603 search results - page 85 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
DMSN
2004
ACM
15 years 5 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
NIPS
2001
15 years 1 months ago
Bayesian Predictive Profiles With Applications to Retail Transaction Data
Massive transaction data sets are recorded in a routine manner in telecommunications, retail commerce, and Web site management. In this paper we address the problem of inferring p...
Igor V. Cadez, Padhraic Smyth
UAI
2001
15 years 1 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
CSDA
2007
128views more  CSDA 2007»
14 years 11 months ago
Regularized linear and kernel redundancy analysis
Redundancy analysis (RA) is a versatile technique used to predict multivariate criterion variables from multivariate predictor variables. The reduced-rank feature of RA captures r...
Yoshio Takane, Heungsun Hwang
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 7 days ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal