Results 1 - 10
of
29,341
High dimensional graphs and variable selection with the Lasso
- ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract
-
Cited by 736 (22 self)
- Add to MetaCart
show that the proposed neighborhood selection scheme is consistent for sparse high-dimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely
The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm
, 1997
"... In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and alw ..."
Abstract
-
Cited by 652 (18 self)
- Add to MetaCart
and always has sufficient receiver window and sender data. The model predicts the Congestion Avoidance performance of nearly all TCP implementations under restricted conditions and of TCP with SelectiveAcknowledgements over a much wider range of Internet conditions. We verify
Bagging predictors
, 1996
"... Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical outcome and does a plurality vote when predicting a class. The multiple versions are formed by making ..."
Abstract
-
Cited by 3650 (1 self)
- Add to MetaCart
Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical outcome and does a plurality vote when predicting a class. The multiple versions are formed
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
to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version of traditional forward selection methods. Three main properties are derived: (1) A simple modification of the LARS algorithm
An integrated theory of the mind
- PSYCHOLOGICAL REVIEW
, 2004
"... There has been a proliferation of proposed mental modules in an attempt to account for different cognitive functions but so far there has been no successful account of their integration. ACT-R (Anderson & Lebiere, 1998) has evolved into a theory that consists of multiple modules but also explain ..."
Abstract
-
Cited by 780 (73 self)
- Add to MetaCart
where they can be detected by a production system that responds to patterns of information in the buffers. At any point in time a single production rule is selected to respond to the current pattern. Subsymbolic processes serve to guide the selection of rules to fire as well as the internal operations
Performance Pay and Productivity
- AMERICAN ECONOMIC REVIEW
, 2000
"... Much of the theory in personnel economics relates to effects of monetary incentives on output, but the theory was untested because appropriate data were unavailable. A new data set for the Safelite Glass Corporation tests the predictions that average productivity will rise, the firm will attract a m ..."
Abstract
-
Cited by 508 (9 self)
- Add to MetaCart
Much of the theory in personnel economics relates to effects of monetary incentives on output, but the theory was untested because appropriate data were unavailable. A new data set for the Safelite Glass Corporation tests the predictions that average productivity will rise, the firm will attract a
A review of methods for the assessment of prediction errors in conservation presence/absence models.
- Environmental Conservation
, 1997
"... Summary Predicting the distribution of endangered species from habitat data is frequently perceived to be a useful technique. Models that predict the presence or absence of a species are normally judged by the number of prediction errors. These may be of two types: false positives and false negativ ..."
Abstract
-
Cited by 463 (1 self)
- Add to MetaCart
that are seldom used by ecologists (e.g. ROC plots and cost matrices), are described. A new approach to estimating prediction error, which is based on the spatial characteristics of the errors, is proposed. Thirteen recommendations are made to enable the objective selection of an error assessment technique
The Evolution of Social and Economic Networks
- JOURNAL OF ECONOMIC THEORY 106, 265–295
, 2002
"... We examine the dynamic formation and stochastic evolution of networks connecting individuals. The payoff to an individual from an economic or social activity depends on the network of connections among individuals. Over time individuals form and sever links connecting themselves to other individuals ..."
Abstract
-
Cited by 889 (37 self)
- Add to MetaCart
individuals based on the improvement that the resulting network offers them relative to the current network. In addition to intended changes in the network there is a small probability of unintended changes or errors. Predictions can be made regarding the likelihood that the stochastic process will lead
Selective sampling using the Query by Committee algorithm
- Machine Learning
, 1997
"... We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the numbe ..."
Abstract
-
Cited by 433 (7 self)
- Add to MetaCart
We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially
UNIT SELECTION IN A CONCATENATIVE SPEECH SYNTHESIS SYSTEM USING A LARGE SPEECH DATABASE
, 1996
"... One approach to the generation of natural-sounding syn-thesized speech waveforms is to select and concatenate units from a large speech database. Units (in the current work, phonemes) are selected to produce a natural realisation of a target phoneme sequence predicted from text which is annotated wi ..."
Abstract
-
Cited by 425 (27 self)
- Add to MetaCart
One approach to the generation of natural-sounding syn-thesized speech waveforms is to select and concatenate units from a large speech database. Units (in the current work, phonemes) are selected to produce a natural realisation of a target phoneme sequence predicted from text which is annotated
Results 1 - 10
of
29,341