Clustering categorical data: an approach based on dynamical systems

  • Authors:
  • David Gibson;Jon Kleinberg;Prabhakar Raghavan

  • Affiliations:
  • Department of Computer Science UC Berkeley, Berkeley, CA 94720 USA/ e-mail: dag@cs.berkeley.edu;Department of Computer Science, Cornell University, Ithaca, NY 14853/ e-mail: kleinber@cs.cornell.edu;Almaden Research Center IBM, San Jose, CA 95120 USA/ e-mail: pragh@almaden.ibm.com

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a novel approach for clustering collections of sets, and its application to the analysis and mining of categorical data. By “categorical data,” we mean tables with fields that cannot be naturally ordered by a metric – e.g., the names of producers of automobiles, or the names of products offered by a manufacturer. Our approach is based on an iterative method for assigning and propagating weights on the categorical values in a table; this facilitates a type of similarity measure arising from the co-occurrence of values in the dataset. Our techniques can be studied analytically in terms of certain types of non-linear dynamical systems.