Results 1  10
of
5,522,665
Average Case Performance of the Apriori Algorithm
"... The Apriori Algorithm examines baskets of items to determine which subsets of the items occur in lots of baskets. Suppose we wish to determine which items sets occur in at least k baskets. The algorithm considers item sets of size l in the order l = 1, 2, : : : . The only way this algorithm can dete ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
in the case where the baskets are filled randomly with probability p (each shopper independently buys each item). The Apriori Algorithm considers almost every possible set of l items for those l where k bp l and almost no sets for larger l. For most applications the largest l such that k bp l
An average case performance of the deterministic annealing EM algorithm
"... Average case performance of the deterministic annealing EM algorithm is evaluated for Gaussian mixture estimation problem under some additive noises. The dataaveraged EM update equations with respect to hyperparameters are calculated analytically in the large data limit. We find that the EM algorit ..."
Abstract
 Add to MetaCart
Average case performance of the deterministic annealing EM algorithm is evaluated for Gaussian mixture estimation problem under some additive noises. The dataaveraged EM update equations with respect to hyperparameters are calculated analytically in the large data limit. We find that the EM
Regression with Gaussian Processes: Average Case Performance
, 1997
"... . Recently, new models for regression and classification have been introduced which may be interpreted as neural networks in the limit of infinitely many parameters. For a regression model, the average case generalization performance is studied using a combination of information theoretic ideas and ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. Recently, new models for regression and classification have been introduced which may be interpreted as neural networks in the limit of infinitely many parameters. For a regression model, the average case generalization performance is studied using a combination of information theoretic ideas
AverageCase Performance of Rollout Algorithms for Knapsack Problems
, 2013
"... Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. While in many cases rollout algorithms are guaranteed to perform as well as their base policies, there have been few theoretical results showing additional improvement in performanc ..."
Abstract
 Add to MetaCart
Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. While in many cases rollout algorithms are guaranteed to perform as well as their base policies, there have been few theoretical results showing additional improvement
Elimination Of Infrequent Variables Improves Average Case Performance Of Satisfiability Algorithms
 SIAM J. Comput
, 1991
"... . We consider preprocessing a random instance I of CNF Satisfiability in order to remove infrequent variables (those which appear once or twice in an instance) from I. The model used to generate random instances is the popular randomclausesize model with parametersn, the number of clauses, r, the ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
than has been shown for any other algorithm under the randomclausesize model when n = r ffl , ffl ! 1, and pr ! p fflr ln(r). Specifically, the results are that random instances of Satisfiability are "easy" in the average case if n = r ffl , 2=3 ? ffl ? 0, and pr ! (ln(n)=4) 1=3 r
AverageCase Performance Evaluation of Online Algorithms for Routing and Wavelength Assignment in WDM Optical Networks
"... We investigate the problem of online routing and wavelength assignment and the related throughput maximization problem in wavelength division multiplexing optical networks. It is pointed out that these problems are highly inapproximable. We evaluate the averagecase performance of several online alg ..."
Abstract
 Add to MetaCart
We investigate the problem of online routing and wavelength assignment and the related throughput maximization problem in wavelength division multiplexing optical networks. It is pointed out that these problems are highly inapproximable. We evaluate the averagecase performance of several online
Nonparametric estimation of average treatment effects under exogeneity: a review
 REVIEW OF ECONOMICS AND STATISTICS
, 2004
"... Recently there has been a surge in econometric work focusing on estimating average treatment effects under various sets of assumptions. One strand of this literature has developed methods for estimating average treatment effects for a binary treatment under assumptions variously described as exogen ..."
Abstract

Cited by 597 (26 self)
 Add to MetaCart
Recently there has been a surge in econometric work focusing on estimating average treatment effects under various sets of assumptions. One strand of this literature has developed methods for estimating average treatment effects for a binary treatment under assumptions variously described
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 498 (10 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
Results 1  10
of
5,522,665