Results 1  10
of
8,028
Least angle regression
, 2004
"... The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to s ..."
Abstract

Cited by 1326 (37 self)
 Add to MetaCart
implements the Lasso, an attractive version of ordinary least squares that constrains the sum of the absolute regression coefficients; the LARS modification calculates all possible Lasso estimates for a given problem, using an order of magnitude less computer time than previous methods. (2) A different LARS
Crystallography & NMR system: A new software suite for macromolecular structure determination.
 Acta Crystallogr. D Biol. Crystallogr.
, 1998
"... Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by Xray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture o ..."
Abstract

Cited by 1411 (6 self)
 Add to MetaCart
symbolic structure determination language (CNS language), and lowlevel source code. Each layer is accessible to the user. The novice user may just use the HTML interface, while the more advanced user may use any of the other layers. The source code will be distributed, thus source code modification
Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition
 in Conference Record of The TwentySeventh Asilomar Conference on Signals, Systems and Computers
, 1993
"... In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang (199 ..."
Abstract

Cited by 637 (1 self)
 Add to MetaCart
In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang
Testing the Equality of Prediction Mean Square Errors
 INTERNATIONAL JOURNAL OF FORECASTING
, 1997
"... Given two sources of forecasts of the same quantity, it is possible to compare prediction records. In particular, it can be useful to test the hypothesis of equal accuracy in forecast performance. We analyse the behaviour of two possible tests, and of modifications of these tests designed to circumv ..."
Abstract

Cited by 286 (1 self)
 Add to MetaCart
Given two sources of forecasts of the same quantity, it is possible to compare prediction records. In particular, it can be useful to test the hypothesis of equal accuracy in forecast performance. We analyse the behaviour of two possible tests, and of modifications of these tests designed
The bayesian lasso
, 2005
"... The Lasso estimate for linear regression parameters can be interpreted as a Bayesian posterior mode estimate when the regression parameters have independent Laplace (doubleexponential) priors. Gibbs sampling from this posterior is possible using an expanded hierarchy with conjugate normal priors ..."
Abstract

Cited by 284 (0 self)
 Add to MetaCart
The Lasso estimate for linear regression parameters can be interpreted as a Bayesian posterior mode estimate when the regression parameters have independent Laplace (doubleexponential) priors. Gibbs sampling from this posterior is possible using an expanded hierarchy with conjugate normal priors
Towards a modern theory of adaptive networks: expectation and prediction
 Psychol. Rev
, 1981
"... Many adaptive neural network theories are based on neuronlike adaptive elements that can behave as single unit analogs of associative conditioning. In this article we develop a similar adaptive element, but one which is more closely in accord with the facts of animal learning theory than elements co ..."
Abstract

Cited by 282 (18 self)
 Add to MetaCart
and biochemistry of synaptic mechanisms. One way to bridge the gap between behavioral and neural views of learning is to postulate neural analogs of behavioral modification paradigms. Hebb's suggestion that when a cell A repeatedly and persistently takes part in firing another cell B, then A's efficiency
Integrating noninterfering versions of programs
 ACM Transactions on Programming Languages and Systems
, 1989
"... The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to integrate programs by hand. To date, the only available tools for assisting with program integration are variants of textbased differential file comparators; these ..."
Abstract

Cited by 250 (23 self)
 Add to MetaCart
on the assumption that differences in the behavior of the variant programs from that of Base, rather than differences in the text, are significant and must be preserved in M. Although it is undecidable whether a program modification actually leads to such a difference, it is possible to determine a safe
Prioritizing test cases for regression testing
 IEEE Transactions on Software Engineering
, 2001
"... Test case prioritization techniques schedule test cases for execution in an order that attempts to increase their effectiveness at meeting some performance goal. Various goals are possible; one involves rate of fault detection — a measure of how quickly faults are detected within the testing process ..."
Abstract

Cited by 234 (15 self)
 Add to MetaCart
Test case prioritization techniques schedule test cases for execution in an order that attempts to increase their effectiveness at meeting some performance goal. Various goals are possible; one involves rate of fault detection — a measure of how quickly faults are detected within the testing
Conjunction search revisited
 Journal of Experimental Psychology: Human Perception and Performance
, 1990
"... Search for conjunctions of highly discriminable features can be rapid or even parallel. This article explores, three possible accounts based on (a) perceptual segregation, (b) conjunction detectors, and (c) inhibition controlled separately by two or more distractor features. Search rates for conjunc ..."
Abstract

Cited by 229 (3 self)
 Add to MetaCart
Search for conjunctions of highly discriminable features can be rapid or even parallel. This article explores, three possible accounts based on (a) perceptual segregation, (b) conjunction detectors, and (c) inhibition controlled separately by two or more distractor features. Search rates
A Schema for Interprocedural Modification SideEffect Analysis With Pointer Aliasing
, 2001
"... The first interprocedural modification sideeffects analysis for C (MODC) that obtains better than worstcase precision on programs with generalpurpose pointer usage is presented with empirical results. The analysis consists of an algorithm schema corresponding to a family of MODC algorithms with t ..."
Abstract

Cited by 139 (12 self)
 Add to MetaCart
The first interprocedural modification sideeffects analysis for C (MODC) that obtains better than worstcase precision on programs with generalpurpose pointer usage is presented with empirical results. The analysis consists of an algorithm schema corresponding to a family of MODC algorithms
Results 1  10
of
8,028