Probabilistic Subset-Conjunctive Models for Heterogeneous Consumers

نویسندگان

  • Kamel Jedidi
  • Rajeev Kohli
چکیده

A variety of approaches have been used to infer decision rules used by consumers. These approaches include protocol methods, self-reports, and non-linear compensatory and noncompensatory models of judgement. But there is little work on inferring the rules from choice or preference data, a situation that stands in contrast with the great progress in data-analytic techniques for linear models. There are well-known reasons for this, the most important being the ability of a linear model to predict preferences even when people use non-compensatory heuristics, and the ready availability of software programs that enable sophisticated analysis using linear compensatory models. A more desirable situation is to augment the existing analytical approaches by models that do not compromise on predictive ability and permit inferences about the underlying decision process. Ideally, the implementation of these approaches should be simple and allow use of standard software programs. The authors introduce one such model, which infers generalized forms of conjunctive/disjunctive rules from binary (acceptable/unacceptable) classifications of multiattribute alternatives. The first generalization is the introduction of a subset-conjunctive rule that requires an acceptable alternative to be satisfactory on some (possibly unknown) minimum number of attributes. A disjunctive rule is a special case when this number equals one; and a conjunctive rule is a special case when this number equals the number of attributes. The second generalization is that each attribute level is acceptable or unacceptable not with certainty but with a probability that can differ from one attribute level to another; the standard acceptable/unacceptable classification is obtained as a special case in which all probabilities associated with attribute levels go to extreme (0/1) values. The two generalizations are embedded in a latent-class model that allows segment level inferences about the structure of subset-conjunctive rules using binary (acceptable/unacceptable) classifications of multi-attribute alternatives. The results of simulations and an application suggest that the model does well in inferring the rules when the data arise from a subset-conjunctive process, and that it does as well as a linear model in terms of predictive accuracy. (Non-compensatory decision heuristics; conjunctive/disjunctive heuristics; subset-conjunctive heuristics; consideration sets; choice models; finite-mixture models; latent-class models; maximum likelihood estimation.)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Subset-Conjunctive Models for Heterogeneous Consumers

Vol. XLII (November 2005), 483–494 483 © 2005, American Marketing Association ISSN: 0022-2437 (print), 1547-7193 (electronic) *Kamel Jedidi is Professor of Marketing (e-mail: [email protected]), and Rajeev Kohli is Professor of Marketing (e-mail: [email protected]), Graduate School of Business, Columbia University. The authors thank the three anonymous JMR reviewers for their constructive sugges...

متن کامل

Probabilistic Subset-Conjunctive Models for Heterogeneous Consumers

Vol. XLII (November 2005), 483–494 483 © 2005, American Marketing Association ISSN: 0022-2437 (print), 1547-7193 (electronic) *Kamel Jedidi is Professor of Marketing (e-mail: [email protected]), and Rajeev Kohli is Professor of Marketing (e-mail: [email protected]), Graduate School of Business, Columbia University. The authors thank the three anonymous JMR reviewers for their constructive sugges...

متن کامل

Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins

An uncertain database is defined as a relational database in which primary keys need not be satisfied. A block is a maximal subset of tuples of the same relation that agree on the primary key. A repair (or possible world) of an uncertain database is obtained by selecting exactly one tuple from each block. From a probabilistic database perspective, an uncertain database is a restricted kind of b...

متن کامل

The Economics of Buyer Uncertainty: Advance Selling vs. Probabilistic Selling

Although Advance Selling and Probabilistic Selling differ in both motivation and implementation, we argue that they share a common characteristic—both offer consumers a choice involving buyer uncertainty. We develop a formal model to examine the general economics of purchase options that involve buyer uncertainty, explore the differences in buyer uncertainty created via these two strategies, an...

متن کامل

Novel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection

In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003