Skip to main content

An Extension of the CHAID Tree-based Segmentation Algorithm to Multiple Dependent Variables

  • Conference paper
Classification — the Ubiquitous Challenge

Abstract

The CHAID algorithm has proven to be an effective approach for obtaining a quick but meaningful segmentation where segments are defined in terms of demographic or other variables that are predictive of a single categorical criterion (dependent) variable. However, response data may contain ratings or purchase history on several products, or, in discrete choice experiments, preferences among alternatives in each of several choice sets. We propose an efficient hybrid methodology combining features of CHAID and latent class modeling (LCM) to build a classification tree that is predictive of multiple criteria. The resulting method provides an alternative to the standard method of profiling latent classes in LCM through the inclusion of (active) covariates.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BURNS, N., KINDER, D.R., ROSENSTONE, S.J., SAPIRO, V., and the National Election Studies (2001): National Election Studies, 2000: Pre-/Post-Election Study [dataset id:2000.T]. Ann Arbor, MI: University of Michigan, Center for Political Studies [producer and distributor].

    Google Scholar 

  • GOODMAN, L.A. (1974): Exploratory latent structure analysis using both identifiable and unidentifiable models. Biometrika, 61, 215–231.

    Article  MATH  MathSciNet  Google Scholar 

  • KASS, G. (1980): An exploratory technique for investigating large quantities of categorical data. Applied Statistics, 29, 119–127.

    Google Scholar 

  • KIM, S.J. and Lee, K.B. (2003): Constructing decision trees with multiple response variables. International Journal of Management and Decision Making, 4, 289–311.

    Article  Google Scholar 

  • LAZARSFELD, P. F. and HENRY, N.W. (1968): Latent structure analysis. Houghton Mifflin, Boston.

    Google Scholar 

  • MAGIDSON, J. (1993): The use of the new ordinal algorithm in CHAID to target profitable segments. The Journal of Database Marketing, 1, 29–48.

    Google Scholar 

  • MAGIDSON, J. and VERMUNT, J.K. (2001): Latent class factor and cluster models, bi-plots and related graphical displays. Sociological Methodology, 31, 223–264.

    Article  Google Scholar 

  • VERMUNT, J.K. and MAGIDSON, J. (2001): Latent class analysis with sampling weights. Paper presented at the 6th annual meeting of the Methodology Section of the American Sociological Association, University of Minnesota, May 4–5, 2001.

    Google Scholar 

  • VERMUNT, J.K. and MAGIDSON, J. (2002): Latent class cluster analysis. In: J.A. Hagenaars and A.L. McCutcheon (Eds.): Applied latent class analysis. Cambridge University Press, Cambridge, 89–106.

    Google Scholar 

  • VERMUNT, J. K. and MAGIDSON, J. (2005): Latent GOLD 4.0 User Manual. Statistical Innovations Inc, Belmont MA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Magidson, J., Vermunt, J.K. (2005). An Extension of the CHAID Tree-based Segmentation Algorithm to Multiple Dependent Variables. In: Weihs, C., Gaul, W. (eds) Classification — the Ubiquitous Challenge. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28084-7_18

Download citation

Publish with us

Policies and ethics