Results 1  10
of
292
Adaptive Thresholding Of Wavelet Coefficients
 Computational Statistics and Data Analysis
, 1996
"... Wavelet techniques have become an attractive and efficient tool in function estimation. Given noisy data, its discrete wavelet transform is an estimator of the wavelet coefficients. It has been shown by Donoho and Johnstone (1994) that thresholding the estimated coefficients and then reconstructing ..."
Abstract

Cited by 69 (11 self)
 Add to MetaCart
Wavelet techniques have become an attractive and efficient tool in function estimation. Given noisy data, its discrete wavelet transform is an estimator of the wavelet coefficients. It has been shown by Donoho and Johnstone (1994) that thresholding the estimated coefficients and then reconstructing
Bayesian Selection of LogLinear Models
 Canadian Journal of Statistics
, 1995
"... A general methodology is presented for finding suitable Poisson loglinear models with applications to multiway contingency tables. Mixtures of multivariate normal distributions are used to model prior opinion when a subset of the regression vector is believed to be nonzero. This prior distribution ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
tables and for two threeway tables. These methods appear to be useful in selecting the best loglinear model and in estimating parameters of interest that reflect uncertainty in the true model. Key words and phrases: Bayes factors, Laplace method, Gibbs sampling, Model selection, Odds ratios. AMS
Variable inclusion and shrinkage algorithms
 Journal of the American Statistical Association
, 2008
"... The Lasso is a popular and computationally efficient procedure for automatically performing both variable selection and coefficient shrinkage on linear regression models. One limitation of the Lasso is that the same tuning parameter is used for both variable selection and shrinkage. As a result, it ..."
Abstract

Cited by 21 (10 self)
 Add to MetaCart
The Lasso is a popular and computationally efficient procedure for automatically performing both variable selection and coefficient shrinkage on linear regression models. One limitation of the Lasso is that the same tuning parameter is used for both variable selection and shrinkage. As a result
Gravity, log of gravity and the "distance puzzle"
"... In the international trade literature, a non intuitive result appears in the traditional log linear estimates of gravity equations: the absolute value of the elasticity of trade with respect to bilateral distance is estimated to have drastically increased over time, whereas its nondecrease is refer ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
decrease is refered to as the "distance puzzle " or "missing globalization puzzle". In order to analyse the sensitivity of this "puzzle " to the econometric specification, theoretical gravity equations are estimated for each year over 19482006 using the traditional log linear least
Efficient semistreaming algorithms for local triangle counting in massive graphs
 in KDD’08, 2008
"... In this paper we study the problem of local triangle counting in large graphs. Namely, given a large graph G = (V, E) we want to estimate as accurately as possible the number of triangles incident to every node v ∈ V in the graph. The problem of computing the global number of triangles in a graph ha ..."
Abstract

Cited by 69 (4 self)
 Add to MetaCart
has been considered before, but to our knowledge this is the first paper that addresses the problem of local triangle counting with a focus on the efficiency issues arising in massive graphs. The distribution of the local number of triangles and the related local clustering coefficient can be used
Estimating the Octanol/Water Partition Coefficient for Aliphatic Organic Compounds Using SemiEmpirical Electrotopological Index
, 2011
"... Abstract: A new possibility for estimating the octanol/water coefficient (log P) was investigated using only one descriptor, the semiempirical electrotopological index (ISET). The predictability of four octanol/water partition coefficient (log P) calculation models was compared using a set of 131 a ..."
Abstract
 Add to MetaCart
Abstract: A new possibility for estimating the octanol/water coefficient (log P) was investigated using only one descriptor, the semiempirical electrotopological index (ISET). The predictability of four octanol/water partition coefficient (log P) calculation models was compared using a set of 131
LowFlow Frequency Analysis Using ProbabilityPlot Correlation Coefficients
 J. Water Resour. Plann. Manage., ASCE
"... ABSTRACT: Although a vast amount of literature exists on the selection of an appropriate probubility distribution for annual maximum fluodflows, few studies huve examined which probability distributions ure most suitable to fit to sequences of annual minimum streamflow!;. Probabilily plots have been ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
paring threeparameter distributions. The PPCC derived from fitting the two and thrcepararneter lognonnal, two and threepurarneter Weibull, and logPearson type III distributions to sequences of annual minimum sevenday low flows at 23 sit~s in Massachusetts are compared. How the PPCC can be used
Theoretical Foundations of Equitability and the Maximal Information Coefficient
, 2014
"... The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many variables [1]. MIC is useful because it gives similar scores to equally noisy relationships of different types. This property, called equitability, is important for analyzing ..."
Abstract
 Add to MetaCart
The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many variables [1]. MIC is useful because it gives similar scores to equally noisy relationships of different types. This property, called equitability, is important for analyzing
Finding Significant Fourier Transform Coefficients Deterministically and Locally
, 2008
"... Computing the Fourier transform is a basic building block used in numerous applications. For data intensive applications, even the O(N logN) running time of the Fast Fourier Transform (FFT) algorithm may be too slow, and sublinear running time is necessary. Clearly, outputting the entire Fourier tr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
coefficients of f). Our algorithm is robust to random noise. Our algorithm is the first deterministic and efficient (i.e., polynomial in logG) SFT algorithm to handle functions over any finite abelian groups, as well as the first such algorithm to handle functions over ZN that are neither compressible nor
On estimating frequency moments of data streams
 In International Workshop on Randomization and Approximation Techniques in Computer Science
, 2007
"... Abstract. Spaceeconomical estimation of the pth frequency moments, defined as Fp = P n i=1 fip, for p> 0, are of interest in estimating allpairs distances in a large data matrix [14], machine learning, and in data stream computation. Random sketches formed by the inner product of the frequenc ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
space 1 ± ɛ factors and requires expected time O(log F1 log 1 δ Õ ( 1 ɛ 2+p) 3 to estimate Fp to within) to process each update. Thus, our technique trades an O ( 1 ɛ p) factor in space for much more efficient processing of stream updates. We also present a standalone iterative estimator for F1. 1
Results 1  10
of
292