Data Mining:

Principles and Algorithms

Chapter 10.1
Spatiotemporal Data Mining

Jiawei Han
Department of Computer Science
University of Illinois at Urbana-Champaign
www.cs.uiuc.edu/~hanj
5/4/2014

Data Mining: Principles and Algorithms

Generalizing Spatial and Multimedia Data

Spatial data:
Generalize detailed geographic points into clustered regions, such
as business, residential, industrial, or agricultural areas,
according to land usage
Require the merge of a set of geographic areas by spatial
operations

Image data:

Extracted by aggregation and/or approximation

Size, color, shape, texture, orientation, and relative positions and
structures of the contained objects or regions in the image

Music data:

5/4/2014

Summarize its melody: based on the approximate patterns that

repeatedly occur in the segment
Summarized its style: based on its tone, tempo, or the major
musical instruments played
Data Mining: Principles and Algorithms

What Is a Spatial Database System?

Geometric, geographic or spatial data: space-related data

Example: Geographic space (2-D abstraction of earth surface),

VLSI design, model of human brain, 3-D space representing the
arrangement of chains of protein molecule.

Spatial database system vs. image database systems.

Image database system: handling digital raster image (e.g.,

satellite sensing, computer tomography), may also contain
techniques for object analysis and extraction from images and
some spatial database functionality.

Spatial (geometric, geographic) database system: handling

objects in space that have identity and well-defined extents,
locations, and relationships.

5/4/2014

Data Mining: Principles and Algorithms

GIS (Geographic Information System)

GIS (Geographic Information System)

5/4/2014

Analysis and visualization of geographic data

Common analysis functions of GIS

Search (thematic search, search by region)

Location analysis (buffer, corridor, overlay)

Terrain analysis (slope/aspect, drainage network)

Flow analysis (connectivity, shortest path)

Distribution (nearest neighbor, proximity, change detection)

Spatial analysis/statistics (pattern, centrality, similarity, topology)

Measurements (distance, perimeter, shape, adjacency, direction)

Data Mining: Principles and Algorithms

Spatial DBMS (SDBMS)

SDBMS is a software system that

supports spatial data models, spatial ADTs,
and a query language supporting them

supports spatial indexing, spatial operations

efficiently, and query optimization

can work with an underlying DBMS

Examples

Oracle Spatial Data Catridge

ESRI Spatial Data Engine

5/4/2014

Data Mining: Principles and Algorithms

Modeling Spatial Objects

What needs to be represented?

Two important alternative views

Single objects: distinct entities arranged in space each

of which has its own geometric description

modeling cities, forests, rivers

Spatially related collection of objects: describe space

itself (about every point in space)

modeling land use, partition of a country into

districts

5/4/2014

Data Mining: Principles and Algorithms

Modeling Single Objects: Point, Line and Region

Point: location only but not extent

Line (or a curve usually represented by a polyline, a

sequence of line segment):

moving through space, or connections in space (roads,

rivers, cables, etc.)

Region:

Something having extent in 2D-space (country, lake,

park). It may have a hole or consist of several disjoint
pieces.

5/4/2014

Data Mining: Principles and Algorithms

Representations of spatial features (Chang, 2008)

Discrete features are individually distinguishable

features that do not exist between observations

include points (e.g schools), lines (e.g roads and rivers),

and polygons (e.g land use).

Continuous features are features that exist spatially

between observations

5/4/2014

E.g. elevation and precipitation

Representations of spatial features (Chang, 2008)

Discrete features

Continuous feature

5/4/2014

Spatial Dataset and Spatial Relationship

In spatial data mining, a spatial relationship is

essential because it makes spatial data mining
algorithms differ from non-spatial data mining
algorithms.
Spatial relationships are usually stored implicitly in
spatial databases.
Three groups of relations between a spatial object
and its neighborhood (Ester et al., 1997):
Topological-relations, e.g. meet, overlap, coveredby, contains, inside, equal
Metric-relation, e.g. distance < d
Direction-relation, e.g. north, south, west, east.

Spatial Dataset and Spatial Relationship

The eight topological relations between two spatial
regions and their corresponding 9-intersection matrices
(Clementini et al., 1994)

A0 B 0

9 ( A, B ) A B 0
A B 0

A0 B
A B
A B

A0 B

A B
A B

As boundary (A), As interior

(Ao), As exterior (A-), Bs
boundary (B), Bs interior
(Bo) and Bs exterior (B-)

Modeling Spatially Related Collection of Objects

Modeling spatially related collection of objects: plane partitions and

networks.

A partition: a set of region objects that are required to be disjoint

(e.g., a thematic map). There exist often pairs of objects with a
common boundary (adjacency relationship).

A network: a graph embedded into the plane, consisting of a set of

point objects, forming its nodes, and a set of line objects describing
the geometry of the edges, e.g., highways. rivers, power supply
lines.

Other interested spatially related collection of objects: nested

partitions, or a digital terrain (elevation) model.

5/4/2014

Data Mining: Principles and Algorithms

12

Spatial Data Types and Models

Field-based model: raster
data
framework: partitioning
of space
Object-based model: vector
model
point, line, polygon,
Objects, Attributes

5/4/2014

Data Mining: Principles and Algorithms

13

Spatial Query Language

Spatial query language
Spatial data types, e.g. point, line segment, polygon,
Spatial operations, e.g. overlap, distance, nearest neighbor,

Callable from a query language (e.g. SQL3) of underlying

DBMS
SELECT S.name
FROM Senator S
WHERE S.district.Area() > 300
Standards
SQL3 (a.k.a. SQL 1999) is a standard for query languages
OGIS is a standard for spatial data types and operators
Both standards enjoy wide support in industry

5/4/2014

Data Mining: Principles and Algorithms

14

Query Processing
Efficient algorithms to answer spatial queries
Common Strategy: filter and refine
Filter: Query Region overlaps with MBRs (minimum
bounding rectangles) of B, C, D
Refine: Query Region overlaps with B, C

5/4/2014

Data Mining: Principles and Algorithms

15

File Organization and Indices

Spatial Indexing
B-tree works on spatial data with space filling curve
R-tree: Heighted balanced extention of B+ tree

5/4/2014

Objects are represented as MBR

provides better performance

Data Mining: Principles and Algorithms

16

Spatial Query Optimization

A spatial operation can be processed using
different strategies

Computation cost of each strategy depends on

many parameters

Query optimization is the process of

ordering operations in a query and

selecting efficient strategy for each operation

based on the details of a given dataset

5/4/2014

Data Mining: Principles and Algorithms

17

Spatial Data Warehousing

Spatial data warehouse: Integrated, subject-oriented, time-variant,

and nonvolatile spatial data repository

Spatial data integration: a big issue

Structure-specific formats (raster- vs. vector-based, OO vs.

relational models, different storage and indexing, etc.)

Vendor-specific formats (ESRI, MapInfo, Integraph, IDRISI, etc.)

Geo-specific formats (geographic vs. equal area projection, etc.)

Spatial data cube: multidimensional spatial database

5/4/2014

Both dimensions and measures may contain spatial components

Data Mining: Principles and Algorithms

18

Dimensions and Measures in Spatial

Data Warehouse

Dimensions

5/4/2014

non-spatial
e.g. 25-30 degrees
generalizes tohot
(both are strings)
spatial-to-nonspatial
e.g. Seattle generalizes
to description Pacific
Northwest (as a string)
spatial-to-spatial
e.g. Seattle generalizes
to Pacific Northwest (as
a spatial region)

Measures

numerical (e.g. monthly revenue

of a region)

distributive (e.g. count, sum)

algebraic (e.g. average)

holistic (e.g. median, rank)

spatial

collection of spatial pointers

(e.g. pointers to all regions
with temperature of 25-30
degrees in July)

Data Mining: Principles and Algorithms

19

Spatial-to-Spatial Generalization

5/4/2014

Generalize detailed
geographic points into
clustered regions, such as
businesses, residential,
industrial, or agricultural
areas, according to land
usage

Dissolve

Requires the merging of a

set of geographic areas by
spatial operations

Intersect

Merge
Clip

Union

Data Mining: Principles and Algorithms

20

10

Example: British Columbia Weather

Pattern Analysis
Input

A map with about 3,000 weather probes scattered in B.C.

Daily data for temperature, precipitation, wind velocity, etc.
Data warehouse using star schema

Output

A map that reveals patterns: merged (similar) regions

Goals

Interactive analysis (drill-down, slice, dice, pivot, roll-up)

Fast response time
Minimizing storage space used

Challenge

A merged region may contain hundreds of primitive regions

(polygons)

5/4/2014

Data Mining: Principles and Algorithms

21

Star Schema of the BC Weather Warehouse

Spatial data warehouse

Dimensions
region_name
time
temperature
precipitation

Measurements
region_map
area
count
Dimension table

5/4/2014

Data Mining: Principles and Algorithms

Fact table
22

11

Dynamic Merging of Spatial Objects

Materializing (precomputing) all?too

much storage space
On-line merge?slow, expensive
Precompute rough approximations?
accuracy trade off
A better way: object-based, selective
(partial) materialization

5/4/2014

Data Mining: Principles and Algorithms

23

Methods for Computing Spatial Data Cubes

5/4/2014

On-line aggregation: collect and store pointers to spatial

objects in a spatial data cube
expensive and slow, need efficient aggregation
techniques
Precompute and store all the possible combinations
huge space overhead
Precompute and store rough approximations in a spatial
data cube
accuracy trade-off
Selective computation: only materialize those which will
be accessed frequently
a reasonable choice
Data Mining: Principles and Algorithms

24

12

Spatial Association Analysis

Spatial association rule: A B [s%, c%]

A and B are sets of spatial or non-spatial predicates

Topological relations: intersects, overlaps, disjoint, etc.

Spatial orientations: left_of, west_of, under, etc.

Distance information: close_to, within_distance, etc.

s% is the support and c% is the confidence of the rule

Examples

1) is_a(x, large_town) ^ intersect(x, highway) adjacent_to(x, water)

[7%, 85%]
2) What kinds of objects are typically located close to golf courses?

5/4/2014

Data Mining: Principles and Algorithms

25

Progressive Refinement Mining of

Spatial Association Rules

Hierarchy of spatial relationship:

g_close_to: near_by, touch, intersect, contain, etc.

First search for rough relationship and then refine it

Two-step mining of spatial association:

Step 1: Rough spatial computation (as a filter)

Step2: Detailed spatial algorithm (as refinement)

5/4/2014

Using MBR or R-tree for rough estimation

Apply only to those objects which have passed the rough spatial
association test (no less than min_support)

Data Mining: Principles and Algorithms

26

13

Mining Spatial Co-location Rules

Co-location rule is similar to association rule but explore

more relying spatial auto-correlation

It leads to efficient processing

It can be integrated with progressive refinement to

further improve its performance

Spatial co-location mining idea can be applied to

clustering, classification, outlier analysis and other
potential mining tasks

5/4/2014

Data Mining: Principles and Algorithms

27

Associations, Spatial associations,

Co-location

Answers:

and

find patterns from the sample dataset?

14

Spatial Autocorrelation

Spatial data tends to be highly self-correlated

Example: Neighborhood, Temperature

Items in a traditional data are independent of each

other, whereas properties of locations in a map are
often auto-correlated.

First law of geography:

Everything is related to everything, but nearby things are

more related than distant things.

5/4/2014

Data Mining: Principles and Algorithms

29

Spatial Autocorrelation (contd)

5/4/2014

Data Mining: Principles and Algorithms

30

15

Spatial Classification
Methods in classification

Decision-tree classification, Nave-Bayesian classifier +

boosting, neural network, logistic regression, etc.
Association-based multi-dimensional classification Example: classifying house value based on proximity
to lakes, highways, mountains, etc.

Assuming learning samples are independent of each

other

Spatial auto-correlation violates this assumption!

Popular spatial classification methods

5/4/2014

Spatial auto-regression (SAR)

Markov random field (MRF)

Data Mining: Principles and Algorithms

31

Spatial Decision Tree

The works that apply the decision tree algorithms on

spatial data can be divided into two groups
Applications of conventional decision tree algorithms
(non-spatial algorithms) on spatial data.
Spatial data preprocessing steps need to be
performed to prepare task relevant data
Applications of spatial decision tree algorithms on
spatial data
Improvement of non-spatial algorithms is required
involving spatial relationships

16

Spatial Decision Tree

Target layer

Spatial relationships
Spatial
decision tree
algorithms

Spatial
Dataset

Explanatory layers

Accuracy
Spatial
Decision tree

Validation set

Spatial Decision Tree

Algorithm

Type of spatial
features

Spatial relationship

Spatial Decision Tree Algorithm based on Point, line, and

the ID3 algorithm (Ester et al., 1997)
polygon

Distance

Spatial binary tree algorithm (Koperski

et al. 1998)

Point, line, and

polygon

Distance using buffer

SCART (Spatial Classification and

Regression Trees) as the extension of
the CART method (Chelghoum et al.,
2002)

Point, line, and

polygon

Topological and
distance relationships
applied in data preprocessing

Spatial Decision Tree based on the ID3

algorithm (Rinzivillo and Franco, 2004)

Polygon

Intersection

Spatial entropy-based decision tree

method (Li and Claramunt, 2006)

Point, polygon

Distance

Extended Spatial ID3 algorithm

(Sitanggang et al., 2011; Sitanggang et
al., 2013)

Point, line, and

polygon

Topological and
distance relationships

17

Spatial Auto-Regression

Linear Regression
Y=X +

Spatial autoregressive regression (SAR)

Y = WY + X +

W: neighborhood matrix.

models strength of spatial dependencies

error vector

The estimates of and can be derived using maximum

likelihood theory or Bayesian statistics
5/4/2014

Data Mining: Principles and Algorithms

35

Markov Random Field Based Bayesian Classifiers

Bayesian classifiers

MRF
A set of random variables whose interdependency relationship is
represented by an undirected graph (i.e., a symmetric
neighborhood matrix) is called a Markov Random Field.

Pr(Ci | X, Li)

5/4/2014

Pr(X | Ci, Li) Pr(Ci | Li)

Pr (X)

Li denotes set of labels in the neighborhood of si excluding labels

at si
Pr(Ci | Li) can be estimated from training data by examine the
ratios of the frequencies of class labels to the total number of
locations
Pr(X|Ci, Li) can be estimated using kernel functions from the
observed values in the training dataset
Data Mining: Principles and Algorithms

36

18

SAR v.s. MRF

Pr(X | Ci, Li) , Pr(Ci | Li)

Pr(Ci | X, Li)

5/4/2014

Pr(X | Ci, Li) , Pr(Ci | Li)

Data Mining: Principles and Algorithms

37

Spatial Trend Analysis

Function

Study the trend of non-spatial or spatial data changing with

space

Application examples

5/4/2014

Detect changes and trends along a spatial dimension

Observe the trend of changes of the climate or vegetation with

increasing distance from an ocean
Crime rate or unemployment rate change with regard to city
geo-distribution

Data Mining: Principles and Algorithms

38

19

Spatial Cluster Analysis

Mining clustersk-means, k-medoids,

hierarchical, density-based, etc.
Analysis of distinct features of the
clusters

5/4/2014

Data Mining: Principles and Algorithms

39

Constraints-Based Clustering

Constraints on individual objects

Clustering parameters as constraints

Sum of the profits in each cluster > $1 million

Constraints imposed by physical obstacles

5/4/2014

K-means, density-based: radius, min-# of points

Constraints specified on clusters using SQL

aggregates

Simple selection of relevant objects before clustering

Clustering with obstructed distance

Data Mining: Principles and Algorithms

40

20

Constrained Clustering: Planning ATM

Locations

C2

C3

C1
River

Mountain
Spatial data with obstacles
5/4/2014

C4
Clustering without taking
obstacles into consideration

Data Mining: Principles and Algorithms

41

Spatial Outlier Detection

Outlier
Global outliers: Observations which is inconsistent with
the rest of the data
Spatial outliers: A local instability of non-spatial attributes
Spatial outlier detection
Graphical tests
Variogram clouds
Moran scatterplots
Quantitative tests
Scatterplots
Spatial Statistic Z(S(x))
Quantitative tests are more accurate than Graphical tests

5/4/2014

Data Mining: Principles and Algorithms

42

21

Spatial Outlier DetectionVariogram Clouds

Graphical method

For each pair of locations, the

square-root of the absolute
difference between attribute
values at the locations versus
the Euclidean distance
between the locations are
plotted
Nearby locations with large
attribute difference indicate a
spatial outlier

Quantitative method

Compute spatial statistic

Z(S(x))

5/4/2014

Data Mining: Principles and Algorithms

43

Spatial Outlier DetectionMoran Scatterplots

Graphical tests
A plot of normalized
attribute value Z against the
neighborhood average of
normalized attribute values
(W Z)
Z [ f (i)]

f (i ) u f

The upper left and lower

right quadrants indicate a
spatial outlier
Computation method
Fit a linear regression line
Select points (e.g. P, Q, S)
which are from the
regression line greater than
specified residual error

5/4/2014

Data Mining: Principles and Algorithms

44

22

Mining Spatiotemporal Data

Spatiotemporal data
Data has spatial extensions and changes with
time
Ex: Forest fire, moving objects, hurricane &
earthquakes
Automatic anomaly detection in massive moving
objects
Moving objects are ubiquitous: GPS, radar, etc.
Ex: Maritime vessel surveillance
Problem: Automatic anomaly detection

5/4/2014

Data Mining: Principles and Algorithms

45

Analysis: Mining Anomaly in

Moving Objects

Raw analysis of collected data does not fully

convey anomaly information
More effective analysis relies on higher semantic
features
Examples:
A speed boat moving quickly in open water
A fishing boat moving slowly into the docks
A yacht circling slowly around landmark during
night hours

5/4/2014

Data Mining: Principles and Algorithms

46

23

Tools for conducting spatial data mining

Quantum GIS for spatial data analysis and visualization

(http://www.qgis.org/)

PostgreSQL as the database management system

(http://www.postgresql.org/)

PostGIS for spatial data analysis (http://postgis.net/)

Python for programming (http://www.python.org/)

R for statistical computation (http://www.r-project.org/)

Ilwis for satellite image processing (http://www.ilwis.org/)

The data mining tool kit Weka

(http://www.cs.waikato.ac.nz/ml/weka/)

Summary

Mining object data needs feature/attribute-based

generalization methods
Spatial, spatiotemporal and multimedia data mining is one
of important research frontiers in data mining with broad
applications
Spatial data warehousing, OLAP and mining facilitates
multidimensional spatial analysis and finding spatial
associations, classifications and trends
Multimedia data mining needs content-based retrieval and
similarity search integrated with mining methods

5/4/2014

Data Mining: Principles and Algorithms

48

24

References on Spatial Data Mining

H. Miller and J. Han (eds.), Geographic Data Mining and Knowledge Discovery, Taylor
and Francis, 2001.

Ester M., Frommelt A., Kriegel H.-P., Sander J.: Spatial Data Mining: Database
Primitives, Algorithms and Efficient DBMS Support, Data Mining and Knowledge
Discovery, 4: 193-216, 2000.

J. Han, M. Kamber, and A. K. H. Tung, "Spatial Clustering Methods in Data Mining: A

Survey", in H. Miller and J. Han (eds.), Geographic Data Mining and Knowledge
Discovery, Taylor and Francis, 2000.

Y. Bedard, T. Merrett, and J. Han, "Fundamentals of Geospatial Data Warehousing for

Geographic Knowledge Discovery", in H. Miller and J. Han (eds.), Geographic Data
Mining and Knowledge Discovery, Taylor and Francis, 2000

K. Koperski and J. Han. Discovery of spatial association rules in geographic information

databases. SSD'95.

Shashi Shekhar and Sanjay Chawla, Spatial Databases: A Tour , Prentice Hall, 2003
(ISBN 013-017480-7). Chapter 7.: Introduction to Spatial Data Mining

X. Li, J. Han, and S. Kim, Motion-Alert: Automatic Anomaly Detection in Massive Moving
Objects, IEEE Int. Conf. on Intelligence and Security Informatics (ISI'06).

5/4/2014

Data Mining: Principles and Algorithms

49

References

(Chang, 2008) Chang, K. T. 2008. Introduction to Geographic Information

Systems . 4th edn. McGraw-Hill.
(Ester et al., 1997) Ester, M., Kriegel, H.-P. and Sander, J. 1997. Spatial
Data Mining: A Database Approach. Symposium on Large Spatial Databases
1262: 47-66.
(Clementini et al., 1994) Clementini, E., Sharma, J. and Egenhofer, M. J.
1994. Modelling topological spatial relations: Strategies for query
processing. Computers and Graphics 18 (6): 815-822.
(Chung, 2012) Chung, C., Chiang, Y. and Chang, F. 2012. A spatial neural
fuzzy network for estimating pan evaporation at ungauged sites. Hydrology
and Earth System Sciences 16 (1): 255-266.
(Kuo et al, 2010) Kuo, B. C., Huang, C. S., Hung, C. C., Liu, Y. L. and Chen,
I. L. 2010. Spatial information based support vector machine for
hyperspectral image classification. In Proceedings of the IEEE International
Conference on Geoscience and Remote Sensing Symposium (IGARSS), 832
-835.

25

References

(Koperski et al., 1998) Koperski, K., Han, J. and Stefanovic, N. 1998. An

Eficient Two-Step Method for Classification of Spatial Data. In Proceedings of
International Symposium on Spatial Data Handling.
(Chelghoum et al., 2002) Chelghoum, N., Zeitouni, K. and Boulmakoul, A.
2002. A decision tree for multi-layered spatial data. In Proceedings of the
Joint International Symposium on Geospatial Theory, Processing and
Applications , 8-12.
(Rinzivillo and Franco, 2004) Rinzivillo, S. and Franco, T. 2004. Classification
in Geographical Information Systems , 374-385. Berlin Heidelberg: SpringerVerlag.
(Han and Kamber, 2006) Han, J. and Kamber, M. 2006. Data Mining:
Concepts and Techniques . 2nd edn. Morgan Kaufmann.
(Koperski and Han, 1995) Koperski, K. and Han, J. 1995. Discovery of Spatial
Association Rules in Geographic Information Databases. In Proceedings of
the 4th International Symposium on Advances in Spatial Databases , 47{66.
London, UK, UK:Springer-Verlag.

References

(Appice et al., 2003) Appice, A., Ceci, M., Lanza, A., Lisi, F. A. and Malerba,
D. 2003. Discovery of spatial association rules in geo-referenced census data:
A relational mining approach. Intell. Data Anal. 7 (6): 541-566.
(Wang et al., 2005) Wang, L., Xie, K., Chen, T. and Ma, X. 2005. Eficient
discovery of multilevel spatial association rules using partitions. Journal of
Information and Software Technology 47 (13): 829-840
(Mennis and Liu, 2005) Mennis, J. and Liu, J. W. 2005. Mining Association
Rules in Spatio-Temporal Data: An Analysis of Urban Socioeconomic and
Land Cover Change. Transactions in GIS 9 (1): 5{17.
(Han et al. 2001) Han, J., Kamber, M. and Tung, A. K. H. 2001. Spatial
Clustering Methods in Data Mining: A Survey . Taylor and Francis.
(Lu-He et al., 2005) Lu-He, W., Yi-Jun, L., Wan-Yu, L. and Zhang, D.-Y.
2005. Application and Study of Spatial Cluster and Customer Partitioning. In
Proceedings of the Fourth International Conference on Machine Learning and
Cybernetics .

26

References

(Sander et al., 1998) Sander, J., Ester, M., Kriegel, H. P. and Xu, X. 1998. DensityBased Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications ,
Data Mining and Knowledge Discovery , vol. 2, 169-194.
(Zeitouni and Chelghoum, 2001) Zeitouni, K. and Chelghoum, N. 2001. Spatial
Decision Tree-Application to Traffic Risk Analysis. In Proceedings of the ACS/IEEE
International Conference on Computer Systems and Applications , 203{207.
Washington, DC, USA: IEEE Computer Society.
(Li and Claramunt, 2006) Li, X. and Claramunt, C. 2006. A Spatial Entropy-Based
Decision Tree for Classification of Geographical Information. Transactions in GIS 10
(3): 451-467.
(Sitanggang et al., 2011) Sitanggang, I. S., R. Yaakob, N. Mustapha, A. A.
Nuruddin, an Extended ID3 Decision Tree Algorithm for Spatial Data, A paper
published in the Proceedings 2011 IEEE International Conference on Spatial Data
Mining and Geographical Knowledge Services, June 29-July 1, 2011, Fuzhou, China.
(I.S. Sitanggang, 2013) I.S. Sitanggang, R. Yaakob, N. Mustapha and A.N. Ainuddin,
2013. Predictive Models for Hotspots Occurrence using Decision Tree Algorithms and
Logistic Regression. Journal of Applied Sciences, 13(2).

27