PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets

Authors:
Daniel A. Keim;Christian Panse;Mike Sips;Stephen C. North
Affiliations:
-;-;-;-
Venue:
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Year:
2003

Citing 4
Cited 5

The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data

Proceedings of the conference on Visualization '98
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Visual Exploration of Large Telecommunication Data Sets

UIDIS '99 Proceedings of the 1999 User Interfaces to Data Intensive Systems
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques

Visual Data Mining in Large Geospatial Point Sets

IEEE Computer Graphics and Applications
Interactive Exploration of Data Traffic with Hierarchical Network Maps

IEEE Transactions on Visualization and Computer Graphics
Scalable pixel based visual data exploration

VIEW'06 Proceedings of the 1st first visual information expert conference on Pixelization paradigm
Mail explorer - spatial and temporal exploration of electronic mail

EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Visual boosting in pixel-based visualizations

EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

PixelMaps are a new pixel-oriented visual data miningtechnique for large spatial datasets. They combine kernel-density-based clustering with pixel-oriented displays to emphasizeclusters while avoiding overlap in locally densepoint sets on maps. Because a full evaluation of densityfunctions is prohibitively expensive, we also propose an efficientapproximation, Fast-PixelMap, based on a synthesisof the quadtree and gridfile data structures.