A grid-based approach to exploratory data analysis

Abstract

A grid-based approach to exploratory data analysis is described wherein the size of a grid’s cells may be altered. The primary tool of exploratory data analysis described here is cluster analysis. Background information is provided regarding the different types of clustering algorithms and their effectiveness. A grid-based approach for exploratory and cluster analysis is then described. Both exploratory and cluster analyses are performed for a series of different sizes of grid cells. Two marketing data sets are utilized to illustrate research questions often faced by market researchers. The first is a cluster analysis of cities used to create strata for selecting a representative probability sample. The second example is a segmentation of customers into groups for the purpose of targeting advertising and product insight. These examples illustrate related issues such as the elimination of “background noise” observations, significance tests for departures from uniform density, and metrics for the shape of a cluster.

Keywords

cluster analysis data mining exploratory data analysis grid-based market research

Get full access to this article

View all access options for this article.

References

Agrawal

Gehrke

Gunopulos

Raghavan

(2005) Data Mining and Knowledge Discovery, 11, 5–33.

Aggarwal

Procopiuc

Wolf

Park

(1999). Fast algorithms for projected clustering generalized projected clustering. In Proceedings of 1999 ACM SIGMOD 2000 International Conference on Management of Data, Philadelphia, PA, May 31–June 3, 1999.

Aggarwal

(2000). Finding generalized projected clusters in high dimensional spaces. In Proceedings of SIGMOD 2000 Conference (pp. 70–81), Dallas, TX, May 15–18, 2000.

Agrawal

Gehrke

Gunopulos

Raghavan

(1998). Automatic subspace clustering of high dimensional data. In Proceedings of the ACM-SIGMOD ’98 International Conference Management of Data (pp. 94–105), Seattle, WA, June 1–4, 1998. https://doi.org/10.1145/276305.276314

Agrawal

Gehrke

Gunopulos

Raghavan

(2005). Automatic subspace clustering of high dimensional data. Data Mining and Knowledge Discovery, 11, 5–33.

Berchtold

Bohm

Keim

Kriegel

(1997). A cost model for nearest neighbor search in high dimensional data space. In Proceedings of the 16th Symposium on Principles of Database Systems (pp. 78–86), Tucson, AZ, May 11–15, 1997. PODS. https://doi.org/10.1145/263661.263671

Cormack

R. M.

(1971). A Review of Classification. Journal of the Royal Statistical Society, A, 134(3), 321–367. https://doi.org/10.2307/2344237

Domeniconi

Papadopoulos

Gunopulos

(2004). Subspace clustering of high dimensional data. In SIAM International Conference on Data Mining (SDM).

Estivill-Castro

Yang

(2004). Fast and robust general purpose clustering algorithms. Data Mining and Knowledge Discovery, 8(2), 127–150. https://doi.org/10.1023/b:dami.0000015869.08323.b3

10.

Everitt

B. S.

Sabine

Leese

Stahl

(2011). Cluster analysis. West Sussex, UK: John Wiley & Sons.

11.

Fielding

A. H.

(2007). Cluster and classification techniques for the biosciences. New York, NY: Cambridge University Press.

12.

Fraley

Raftery

A. E.

(2007). Bayesian regularization for normal mixture estimation and model-based clustering. Journal of Classification, 24(2), 155–181. https://doi.org/10.1007/s00357-007-0004-5

13.

Gordon

A. D.

(1980) Classification (1st ed.). London: Chapman and Hall CRC.

14.

Gordon

A. D.

(1999). Classification (2nd ed.). Boca Raton, FL: Chapman and Hall/CRC.

15.

Grabmeier

Rudolph

(2002). Techniques of cluster algorithms in data mining. Data Mining and Knowledge Discovery, 6(4), 303–360. https://doi.org/10.1023/a:1016308404627

16.

Guha

Rastogi

Shim

(1998) CURE: An efficient clustering algorithm for large databases. In Proceedings of ACM SIGMOD (pp. 73–84), Seattle, WA, June 1–4, 1998. https://doi.org/10.1145/276305.276312

17.

Hawkins

Muller

Krooden

(1982). Cluster analysis. In Hawkins

(Ed.), Topics in applied multivariate analysis. Cambridge, UK: Cambridge University Press. https://doi.org/10.1017/cbo9780511897375.007

18.

Procopiuc

Jones

Agarwal

Murali

(2002). A Monte Carlo algorithm for fast projective clustering. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, WI, June 3–6, 2002.

19.

Sander

Ester

Kriegel

H.-P.

(1998). Density-based clustering in spatial databases: the Algorithm DBSCAN and its applications. Data Mining and Knowledge Discovery, 2(2), 169–194. https://doi.org/10.1023/a:1009745219419

20.

Titterington

Smith

Makov

(1985). Statistical analysis of finite mixture distributions. New York, NY: John Wiley & Sons.

21.

Tukey

J.W.

(1977). Exploratory data analysis. Boston, MA: Addison-Wesley.