Results 1  10
of
1,568
Discrete Choice Methods with Simulation
, 2002
"... This book describes the new generation of discrete choice methods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered: logi ..."
Abstract

Cited by 1326 (20 self)
 Add to MetaCart
This book describes the new generation of discrete choice methods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered
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
versions of the simpler LARS algorithm. (3) A simple approximation for the degrees of freedom of a LARS estimate is available, from which we derive a Cp estimate of prediction error; this allows a principled choice among the range of possible LARS estimates. LARS and its variants are computationally
The RC5 Encryption Algorithm
, 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of datadependent rotations. RC5 has a variable word size, a variable number of rounds, and a variablelengt ..."
Abstract

Cited by 363 (7 self)
 Add to MetaCart
length secret key. 1 AParameterized Family of Encryption Algorithms RC5 is wordoriented: all of the primitive operations work on wbit words as their basic unit of information. Here we assume w = 32, although the formal speci cation of RC5 admits variants for other word lengths, such asw = 64 bits. RC5 has two
Historical Institutionalism in Comparative Politics.
 Annual Review of Political Science
, 1999
"... ABSTRACT This article provides an overview of recent developments in historical institutionalism. First, it reviews some distinctions that are commonly drawn between the "historical" and the "rational choice" variants of institutionalism and shows that there are more points of t ..."
Abstract

Cited by 302 (0 self)
 Add to MetaCart
ABSTRACT This article provides an overview of recent developments in historical institutionalism. First, it reviews some distinctions that are commonly drawn between the "historical" and the "rational choice" variants of institutionalism and shows that there are more points
Latent Class Models for Collaborative Filtering
 IN PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1999
"... This paper presents a statistical approachto collaborative filtering and investigates the use of latent class models for predicting individual choices and preferences based on observed preference behavior. Two models are discussed and compared: the aspect model, a probabilistic latent space model w ..."
Abstract

Cited by 211 (4 self)
 Add to MetaCart
This paper presents a statistical approachto collaborative filtering and investigates the use of latent class models for predicting individual choices and preferences based on observed preference behavior. Two models are discussed and compared: the aspect model, a probabilistic latent space model
Simple linear work suffix array construction
, 2003
"... Abstract. Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space efficiency while theoreticians use suffix trees due to lineartime construction algorithms and more exp ..."
Abstract

Cited by 215 (8 self)
 Add to MetaCart
of difference cover. This view leads to a generalized algorithm, DC, that allows a spaceefficient implementation and, moreover, supports the choice of a space–time tradeoff. For any v ∈ [1, √ n], it runs in O(vn) time using O(n / √ v) space in addition to the input string and the suffix array. We also
Machine Translation: A View from the Lexicon
, 1993
"... so begins a preliminary discussion of translation divergences, such as the lexicalsemantic categorial type as in the English I am hungry, in which the predicate hungry is adjectival, compared with the German Ich habe Hunger ('I have hunger'), in which the corresponding Hunger is nominal. ..."
Abstract

Cited by 178 (43 self)
 Add to MetaCart
and generation. Chapter 4, the first in the part dealing with the lexicalsemantic component, is to a large extent a variant of Dorr (1993a). It describes the interlingual representation of UNITRAN. The chosen interlingua is an extended version of LCS, used also as a representation of lexical entries. Dorr
An exact likelihood analysis of the multinomial probit model
, 1994
"... We develop new methods for conducting a finite sample, likelihoodbased analysis of the multinomial probit model. Using a variant of the Gibbs sampler, an algorithm is developed to draw from the exact posterior of the multinomial probit model with correlated errors. This approach avoids direct evalu ..."
Abstract

Cited by 166 (6 self)
 Add to MetaCart
We develop new methods for conducting a finite sample, likelihoodbased analysis of the multinomial probit model. Using a variant of the Gibbs sampler, an algorithm is developed to draw from the exact posterior of the multinomial probit model with correlated errors. This approach avoids direct
An empirical analysis of design choices in neighborhoodbased collaborative filtering algorithms
 Information Retrieval
, 2002
"... Abstract. Collaborative filtering systems predict a user’s interest in new items based on the recommendations of other people with similar interests. Instead of performing content indexing or content analysis, collaborative filtering systems rely entirely on interest ratings from members of a partic ..."
Abstract

Cited by 111 (8 self)
 Add to MetaCart
based prediction algorithm. Many variations of similarity metrics, weighting approaches, combination measures, and rating normalization have appeared in each implementation. For these parameters and others, there is no consensus as to which choice of technique is most appropriate for what situations, nor how
Elaborated Reichardt detectors.
 Journal of the Optical Society of America A: Optics and Image Science,
, 1985
"... The elaborated Reichardt detector (ERD) proposed by van Santen and Sperling [J. Opt. Soc. Am. A 1, 451 (1984)], based on Reichardt's motion detector [Z. Naturforsch. Teil B 12, 447 (1957)], is an opponent system of two mirrorimage subunits. Each subunit receives inputs from two spatiotemporal ..."
Abstract

Cited by 161 (6 self)
 Add to MetaCart
careful choice of either temporal or spatial filters, the subunits can themselves become quite similar or equivalent to the whole ERD; with suitably chosen filters, the ERD is equivalent to an elaborated version of a motion detector proposed by Watson and Ahumada [NASA Tech. Memo. 84352 (1983
Results 1  10
of
1,568