✦ LIBER ✦

A Hidden Markov Model of Customer Relationship Dynamics

✍ Scribed by Netzer, Oded; Lattin, James M.; Srinivasan, V.

Book ID: 126654034
Publisher: INFORMS
Year: 2008
Tongue: English
Weight: 333 KB
Volume: 27
Category: Article
ISSN: 0732-2399
DOI: 10.1287/mksc.1070.0294

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hidden Markov models and their applicati

Hidden Markov models and their applications to customer relationship management

✍ Ching, W.-K. 📂 Article 📅 2004 🏛 Oxford University Press 🌐 English ⚖ 77 KB

Modeling customer relationships as Marko

Modeling customer relationships as Markov chains

✍ Phillip E. Pfeifer; Robert L. Carraway 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

Hidden Markov models and dynamical syste

Hidden Markov models and dynamical systems

✍ Andrew M. Fraser 📂 Library 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 3 MB

This text provides an introduction to hidden Markov models (HMMs) for the dynamical systems community. It is a valuable text for third or fourth year undergraduates studying engineering, mathematics, or science that includes work in probability, linear algebra and differential equations. The book pr

Applying a hidden Markov chain model in

Applying a hidden Markov chain model in quality function deployment to analyze dynamic customer requirements

✍ Jiunn-I Shieh; Hsin-Hung Wu 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 183 KB

Modeling strategic group dynamics: A hid

Modeling strategic group dynamics: A hidden Markov approach

✍ Peter Ebbes; Rajdeep Grewal; Wayne S. DeSarbo 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 408 KB

Dynamic graphical models and nonhomogene

Dynamic graphical models and nonhomogeneous hidden Markov models

✍ Beatriz Lacruz; Pilar Lasala; Alberto Lekuona 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We propose a dynamic graphical model which generalizes nonhomogeneous hidden Markov models. Inference and forecast procedures are developed. A comparison with an exact propagation algorithm is established and equivalence is stated.