Skip to main content
Article thumbnail
Location of Repository

Product-Driven Data Mining

By C. Sean Bohun

Abstract

Manifold Data Mining has developed innovative demographic and household spending pattern databases for six-digit postal codes in Canada. Their collection of information consists of both demographic and expenditure variables which are expressed through thousands of individually tracked factors. This large collection of information about consumer behaviour is typically referred to as a mine. Although very large in practice, for the purposes of this report, the data mine consisted of $m$ individuals and $n$ factors where $m \sim 2000$ and $n \sim 50$ . Ideally, the first algorithm would identify a few factors in the data mine which would differentiate customers in terms of a particular product preference. Then the second algorithm would build on this information by looking for patterns in the data mine which would identify related areas of consumer spending. To test the algorithms two case studies were undertaken. The first study involved differentiating BMW and Honda car owners. The algorithms developed were reasonably successful at both finding questions that differentiate these two populations and identifying common characteristics amongst the groups of respondents. For the second case study it was hoped that the same algorithms could differentiate between consumers of two brands of beer. In this case the first algorithm was not as successful as differentiating between all groups; it showed some distinctions between beer drinkers and non-beer drinkers, but not as clearly defined as in the first case study. The second algorithm was then used successfully to further identify spending patterns once this distinction was made. In this second case study a deeper factor analysis could be used to identify a combination of factors which could be used in the first algorithm

Topics: Retail, Information and communication technology
Year: 2003
OAI identifier: oai:generic.eprints.org:191/core70

Suggested articles

Citations

  1. A Hybrid Nearest-Neighbor and Nearest-Hyperrectangle Algorithm. doi
  2. (1997). Analysis of Data Mining Algorithms,
  3. (2001). Independent component analysis.
  4. (1993). Introduction to Linear Algebra.
  5. (1999). Latent variable models In Learning and Graphical Models,
  6. (1990). Nearest neighbor (NN) norms: NN pattern classification techniques.
  7. (1989). Numerical Analysis.
  8. (1992). Tolerating Noisy, Irrelevant, and Novel Attributes in Instance-Based Learning Algorithms.
  9. (2000). Variational inference for Bayesian mixture of factor analysers.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.