# The Generalized Cascade Click Model: A Unified Framework for Estimating Click Models

arXiv: https://arxiv.org/abs/2111.11314 · HTML: https://mlsanity.com/paper/2111.11314/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 24 references that are in the map.
- First posted on arXiv 22 Nov 2021.

## Builds on (most cited first, 1 of 1)

- [A Click Sequence Model for Web Search](https://mlsanity.com/paper/1805.03411/) (2018)

## Abstract (arXiv)

Given the vital importance of search engines to find digital information, there has been much scientific attention on how users interact with search engines, and how such behavior can be modeled. Many models on user - search engine interaction, which in the literature are known as click models, come in the form of Dynamic Bayesian Networks. Although many authors have used the resemblance between the different click models to derive estimation procedures for these models, in particular in the form of expectation maximization (EM), still this commonly requires considerable work, in particular when it comes to deriving the E-step. What we propose in this paper, is that this derivation is commonly unnecessary: many existing click models can in fact, under certain assumptions, be optimized as they were Input-Output Hidden Markov Models (IO-HMMs), for which the forward-backward equations immediately provide this E-step. To arrive at that conclusion, we will present the Generalized Cascade Model (GCM) and show how this model can be estimated using the IO-HMM EM framework, and provide two examples of how existing click models can be mapped to GCM. Our GCM approach to estimating click models has also been implemented in the gecasmo Python package.