Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3177))

Abstract

Marketing data analysis typically aims to gain insights for targeted promotions or, increasingly, to implement collaborative filtering. Ideally, data would be visualised directly. There is a scarcity of methods to visualise the position of individual data points in clusters, mainly because dimensionality reduction is necessary for analysis of high-dimensional data and projective methods tend to merge clusters together. This paper proposes a cluster-based projective method to represent cluster membership, which shows good cluster separation and retains linear relationships in the data. This method is practical for the analysis of large, high-dimensional, databases, with generic applicability beyond marketing studies. Theoretical properties of this non-orthogonal projection are derived and its practical value is demonstrated on real-world data from a web-based retailer, benchmarking with the visualisation of clusters using Sammon and Kohonen maps.

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

  1. Gabriel, K.R.: The biplot graphical display of matrices with applications to principal component analysis. Biometrika 58, 453–467 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  2. Herlocker, J.L., Konstan, J.A., Borchers, A., And Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proc. 1999 Conf. of Research and Development in Information Retreival, Berkeley, CA (1999)

    Google Scholar 

  3. Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: EC 2000 int. conf. of the ACM, Minneapolis, Minnesota, October 17-20 (2000)

    Google Scholar 

  4. Sammon Jr., J.W.: A nonlinear mapping for data structure analysis. IEEE Trans. Comput. 18, 401–409 (1969)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Bishop, C.M., Svensén, M., Williams, C.K.I.: GTM: the Generative Topographic Mapping. Neural Computation 10(1), 215–234 (1998)

    Article  Google Scholar 

  7. Vellido, A., Lisboa, P.J.G., El Deredy, W.: Selective smoothing of the Generative Topographic Mapping. IEEE Transactions on Neural Networks 14(4), 847–852 (2003)

    Article  Google Scholar 

  8. Carpenter, G.A., Grossberg, S.: ART-2: Self-organization of stable category recognition codes for analogue input patterns. In: Carpenter, G.A., Grossberg, S. (eds.) Pattern recognition by self-organizing neural networks, MIT Press, Cambridge (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisboa, P.J.G., Patel, S. (2004). Cluster-Based Visualisation of Marketing Data. In: Yang, Z.R., Yin, H., Everson, R.M. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2004. IDEAL 2004. Lecture Notes in Computer Science, vol 3177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28651-6_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28651-6_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22881-3

  • Online ISBN: 978-3-540-28651-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics