O'Reilly logo

Data Clustering by Chandan K. Reddy, Charu C. Aggarwal

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 6

Grid-Based Clustering

Wei Cheng

University of North Carolina at Chapel Hill Chapel Hill, NC 27599chengw02@gmail.com

Wei Wang

University of California, Los Angeles Los Angeles, CA 90095weiwang@cs.ucla.edu

Sandra Batista

Duke University Durham, NC 27710sandraleebatitsa@yahoo.com

6.1 Introduction

Grid-based clustering algorithms are efficient in mining large multidimensional data sets. These algorithms partition the data space into a finite number of cells to form a grid structure and then form clusters from the cells in the grid structure. Clusters correspond to regions that are more dense in data points than their surroundings. Grids were initially proposed by Warnekar and Krishna [30] to organize the feature space, e.g., in GRIDCLUS ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required