Skip to main content

Cluster Analysis

  • Chapter
  • First Online:
A Concise Guide to Market Research

Part of the book series: Springer Texts in Business and Economics ((STBE))

Learning Objectives

After reading this chapter you should understand:

  • The basic concepts of cluster analysis.

  • How basic cluster algorithms work.

  • How to compute simple clustering results manually.

  • The different types of clustering procedures.

  • The SPSS clustering outputs.

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 63.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Notes

  1. 1.

    See Wedel and Kamakura (2000).

  2. 2.

    Tonks (2009) provides a discussion of segment design and the choice of clustering variables in consumer markets.

  3. 3.

    See the studies by Arabie and Hubert (1994), Sheppard (1996), or Dolnicar and Grün (2009).

  4. 4.

    See Wedel and Kamakura (2000), Dolnicar (2003), and Kaufman and Rousseeuw (2005) for a review of clustering techniques.

  5. 5.

    Note that researchers also often use the squared Euclidean distance.

  6. 6.

    See Milligan and Cooper (1988).

  7. 7.

    There are many other matching coefficients such as Yule’s Q, Kulczynski or Ochiai, but since most applications of cluster analysis rely on metric or ordinal data, we will not discuss these in greater detail. Check Wedel and Kamakura (2000) for more information on alternative matching coefficients.

  8. 8.

    Note that because of ties, the final results may depend on the order of objects in the input file. Against this background, van der Kloot et al. (2005) recommend re-running the analysis with different input order of the data. At the same time, however, ties are more the exception than the rule in practical applications and generally don't have a pronounced impact on the results.

  9. 9.

    Milligan and Cooper (1985) compare various criteria.

  10. 10.

    Note that the k-means algorithm is one of the simplest non-hierarchical clustering methods. Several extensions, such as k-medoids (Kaufman and Rousseeuw 2005) have been proposed to handle limitations of the procedure. More advanced methods include finite mixture models (McLachlan and Peel 2000), neural networks (Bishop 2006), and self-organizing maps (Kohonen 1982). Andrews and Currim (2003) discuss the validity of some of these approaches.

  11. 11.

    Conversely, SPSS always sets one observation as the cluster center instead of picking some random point in the dataset.

  12. 12.

    See Punji and Stewart (1983) for additional information on this sequential approach.

References

  • Andrews, R. L., & Currim, I. S. (2003). Recovering and profiling the true segmentation structure in markets: An empirical investigation. International Journal of Research in Marketing, 20(2), 177–192.

    Article  Google Scholar 

  • Arabie, P., & Hubert, L. (1994). Cluster analysis in marketing research. In R. P. Bagozzi (Ed.), Advanced methods in marketing research (pp. 160–189). Cambridge: Basil Blackwell & Mott, Ltd.

    Google Scholar 

  • Bishop, C. M. (2006). Pattern recognition and machine learning. Berlin: Springer.

    Google Scholar 

  • Caliński, T., & Harabasz, J. (1974). A dendrite method for cluster analysis. Communications in Statistics—Theory and Methods, 3(1), 1–27.

    Article  Google Scholar 

  • Chiu, T., Fang, D., Chen, J., Wang, Y., & Jeris, C. (2001). A robust and scalable clustering algorithm for mixed type attributes in large database environment. In Proceedings of the 7th ACM SIGKDD international conference in knowledge discovery and data mining (pp. 263–268). San Francisco, CA: Association for Computing Machinery.

    Google Scholar 

  • Dolnicar, S. (2003). Using cluster analysis for market segmentation—typical misconceptions, established methodological weaknesses and some recommendations for improvement. Australasian Journal of Market Research, 11(2), 5–12.

    Article  Google Scholar 

  • Dolnicar, S., & Grun, B. (2009). Challenging “factor-cluster segmentation”. Journal of Travel Research, 47(1), 63–71.

    Article  Google Scholar 

  • Dolnicar, S., & Lazarevski, K. (2009). Methodological reasons for the theory/practice divide in market segmentation. Journal of Marketing Management, 25(3–4), 357–373.

    Article  Google Scholar 

  • Formann, A. K. (1984). Die Latent-Class-Analyse: Einführung in die Theorie und Anwendung. Beltz: Weinheim.

    Google Scholar 

  • Kaufman, L., & Rousseeuw, P. J. (2005). Finding groups in data. An introduction to cluster analysis. Hoboken, NY: Wiley.

    Google Scholar 

  • Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43(1), 59–69.

    Article  Google Scholar 

  • Kotler, P., & Keller, K. L. (2011). Marketing management (14th ed.). Upper Saddle River, NJ: Prentice Hall.

    Google Scholar 

  • Larson, J. S., Bradlow, E. T., & Fader, P. S. (2005). An exploratory look at supermarket shopping paths. International Journal of Research in Marketing, 22(4), 395–414.

    Article  Google Scholar 

  • McLachlan, G. J., & Peel, D. (2000). Finite mixture models. New York: Wiley.

    Book  Google Scholar 

  • Milligan, G. W., & Cooper, M. (1985). An examination of procedures for determining the number of clusters in a data set. Psychometrika, 50(2), 159–179.

    Article  Google Scholar 

  • Milligan, G. W., & Cooper, M. (1988). A study of variable standardization. Journal of Classification, 5(2), 181–204.

    Article  Google Scholar 

  • Moroko, L., & Uncles, M. D. (2009). Employer branding and market segmentation. Journal of Brand Management, 17(3), 181–196.

    Article  Google Scholar 

  • Okazaki, S. (2006). What do we know about mobile internet adopters? A cluster analysis. Information Management, 43(2), 127–141.

    Article  Google Scholar 

  • Punji, G., & Stewart, D. W. (1983). Cluster analysis in marketing research: Review and suggestions for application. Journal of Marketing Research, 20(2), 134–148.

    Article  Google Scholar 

  • Sheppard, A. (1996). The sequence of factor analysis and cluster analysis: Differences in segmentation and dimensionality through the use of raw and factor scores. Tourism Analysis, 1, 49–57.

    Google Scholar 

  • Tonks, D. G. (2009). Validity and the design of market segments. Journal of Marketing Management, 25(3/4), 341–356.

    Article  Google Scholar 

  • Wedel, M., & Kamakura, W. A. (2000). Market segmentation: Conceptual and methodological foundations (2nd ed.). Boston, NE: Kluwer Academic.

    Book  Google Scholar 

  • van der Kloot, W. A., Spaans, A. M. J., & Heinser, W. J. (2005). Instability of hierarchical cluster analysis due to input order of the data: The PermuCLUSTER solution. Psychological Methods, 10(4), 468–476.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sarstedt, M., Mooi, E. (2014). Cluster Analysis. In: A Concise Guide to Market Research. Springer Texts in Business and Economics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53965-7_9

Download citation

Publish with us

Policies and ethics