University of North Carolina at Chapel Hill Chapel Hill, NC firstname.lastname@example.org
University of California, Los Angeles Los Angeles, CA email@example.com
Duke University Durham, NC firstname.lastname@example.org
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  to organize the feature space, e.g., in GRIDCLUS ...