Spring 2003Data Mining by H. Liu, ASU1 6. Spatial Mining Spatial Data and Structures Images Spatial Mining Algorithms.

Slides:



Advertisements
Similar presentations
1 DATA STRUCTURES USED IN SPATIAL DATA MINING. 2 What is Spatial data ? broadly be defined as data which covers multidimensional points, lines, rectangles,
Advertisements

Density-Based Clustering Math 3210 By Fatine Bourkadi.
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
7/03Spatial Data Mining G Dong (WSU) & H. Liu (ASU) 1 6. Spatial Mining Spatial Data and Structures Images Spatial Mining Algorithms.
Spatial Indexing SAMs. Spatial Indexing Point Access Methods can index only points. What about regions? Z-ordering and quadtrees Use the transformation.
CS690L: Clustering References:
Data Mining Cluster Analysis: Advanced Concepts and Algorithms
Spatial Data Mining-Applications Hemant Kumar Jerath,B.Tech. MS Project Student Mangalore University Advisors: Dr. B.K Mohan & Dr.(Mrs.).P. Venkatachalam.
Nearest Neighbor Queries using R-trees Based on notes from G. Kollios.
Spatial Mining.
Spatial Database Systems
2-dimensional indexing structure
Geodatabases by Shawn J. Dorsch Spatial Databases Part 2.
SAK 5609 DATA MINING Prof. Madya Dr. Md. Nasir bin Sulaiman
Spatial Access Methods Chapter 26 of book Read only 26.1, 26.2, 26.6 Dr Eamonn Keogh Computer Science & Engineering Department University of California.
Data Mining Cluster Analysis: Advanced Concepts and Algorithms Lecture Notes for Chapter 9 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
Information Systems and GIS Chapter 2 Slides from James Pick, Geo-Business: GIS in the Digital Organization, John Wiley and Sons, Copyright © 2008.
Multi-dimensional Indexes
Spatial Information Systems (SIS) COMP Spatial access methods: Indexing.
Spatial Queries Nearest Neighbor Queries.
Aprendizagem baseada em instâncias (K vizinhos mais próximos)
KNN, LVQ, SOM. Instance Based Learning K-Nearest Neighbor Algorithm (LVQ) Learning Vector Quantization (SOM) Self Organizing Maps.
R-Trees 2-dimensional indexing structure. R-trees 2-dimensional version of the B-tree: B-tree of maximum degree 8; degree between 3 and 8 Internal nodes.
© Prentice Hall1 DATA MINING Introductory and Advanced Topics Part II Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist.
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
19 th Advanced Summer School in Regional Science Overview and more advanced directions with ArcGIS.
Oracle Data Mining Ying Zhang. Agenda Data Mining Data Mining Algorithms Oracle DM Demo.
Indexing Spatial Data (Parts of Chapter 25+R-tree paper)
Fast Subsequence Matching in Time-Series Databases Christos Faloutsos M. Ranganathan Yannis Manolopoulos Department of Computer Science and ISR University.
TARGETED LAND-COVER CLASSIFICATION by: Shraddha R. Asati Guided by: Prof. P R.Pardhi.
Spatial Data Management Chapter 28. Types of Spatial Data Point Data –Points in a multidimensional space E.g., Raster data such as satellite imagery,
Join-Queries between two Spatial Datasets Indexed by a Single R*-tree Join-Queries between two Spatial Datasets Indexed by a Single R*-tree Michael Vassilakopoulos.
Database management Systems, 3ed, R. Ramakrishnan and J. Gehrke1 Spatial Data Management Chapter 28.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
Mutlidimensional Indices Instructor: Randal Burns Lecture for 29 November 2005 Computer Science Johns Hopkins University.
SEMILARITY JOIN COP6731 Advanced Database Systems.
Database System Concepts ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com 1 Indexing Spatial Data.
Multidimensional Indexes Applications: geographical databases, data cubes. Types of queries: –partial match (give only a subset of the dimensions) –range.
1 CS599 Spatial & Temporal Database Spatial Data Mining: Progress and Challenges Survey Paper appeared in DMKD96 by Koperski, K., Adhikary, J. and Han,
Data Mining Practical Machine Learning Tools and Techniques Chapter 4: Algorithms: The Basic Methods Section 4.7: Instance-Based Learning Rodney Nielsen.
Nearest Neighbor Queries Chris Buzzerd, Dave Boerner, and Kevin Stewart.
Chapter 5: Business Intelligence: Data Warehousing, Data Acquisition, Data Mining, Business Analytics, and Visualization DECISION SUPPORT SYSTEMS AND BUSINESS.
Spatial Data Mining hari agung.
Spatial Query Processing Spatial DBs do not have a set of operators that are considered to be basic elements in a query evaluation. Spatial DBs handle.
Spatial DBMS Spatial Database Management Systems.
Spatial Database 2/5/2011 Reference – Ramakrishna Gerhke and Silbershatz.
Spatial Indexing Techniques Introduction to Spatial Computing CSE 5ISC Some slides adapted from Spatial Databases: A Tour by Shashi Shekhar Prentice Hall.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
M. Sulaiman Khan Dept. of Computer Science University of Liverpool 2009 COMP527: Data Mining ARM: Improvements March 10, 2009 Slide.
Waqas Haider Bangyal. 2 Source Materials “ Data Mining: Concepts and Techniques” by Jiawei Han & Micheline Kamber, Second Edition, Morgan Kaufmann, 2006.
What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”
Eick: kNN kNN: A Non-parametric Classification and Prediction Technique Goals of this set of transparencies: 1.Introduce kNN---a popular non-parameric.
Www. infofusion.se Information Fusion Requirements on Databases Ronnie Johansson.
1 SBM411 資料探勘 陳春賢. 2 Lecture I Class Introduction.
1 Spatial Query Processing using the R-tree Donghui Zhang CCIS, Northeastern University Feb 8, 2005.
Spatial Data Management
Strategies for Spatial Joins
Machine Learning for Computer Security
DATA MINING Spatial Clustering
Spatial Database Systems
GIS I First Principles.
Data Mining: Concepts and Techniques (3rd ed
Nearest-Neighbor Classifiers
Research Areas Christoph F. Eick
DATA MINING Introductory and Advanced Topics Part II - Clustering
CSE572, CBS572: Data Mining by H. Liu
Multidimensional Search Structures
CSE572: Data Mining by H. Liu
Data Mining CSCI 307, Spring 2019 Lecture 11
Presentation transcript:

Spring 2003Data Mining by H. Liu, ASU1 6. Spatial Mining Spatial Data and Structures Images Spatial Mining Algorithms

Spring 2003Data Mining by H. Liu, ASU2 Definitions Spatial data is about instances located in a physical space Spatial data has location or geo-referenced features Some of these features are: –Address, latitude/longitude (explicit) –Location-based partitions in databases (implicit)

Spring 2003Data Mining by H. Liu, ASU3 Applications and Problems Geographic information systems (GIS) store information related to geographic locations on Earth –Weather, climate monitoring, community infrastructure needs, disaster management, and hazardous waste Homeland security issues such as prediction of unexpected events and planning of evacuation Remote sensing and image classification Biomedical applications include medical imaging and illness diagnosis

Spring 2003Data Mining by H. Liu, ASU4 Use of Spatial Data Map overlay – merging disparate data –Different views of the same area: (Level 1) streets, power lines, phone lines, sewer lines, (Level 2) actual elevations, building locations, and rivers Spatial selection – find all houses near ASU Spatial join – nearest for points, intersection for areas Other basic spatial operations –Region/range query for objects intersecting a region –Nearest neighbor query for objects closest to a given place –Distance scan asking for objects within a certain radius

Spring 2003Data Mining by H. Liu, ASU5 Spatial Data Structures Minimum bounding rectangles (MBR) Different tree structures –Quad tree –R-Tree –kd-Tree Image databases

Spring 2003Data Mining by H. Liu, ASU6 MBR Representing a spatial object by the smallest rectangle [(x1,y1), (x2,y2)] or rectangles (x1,y1) (x2,y2)

Spring 2003Data Mining by H. Liu, ASU7 Tree Structures Quad Tree: every four quadrants in one layer forms a parent quadrant in an upper layer –An example

Spring 2003Data Mining by H. Liu, ASU8 R-Tree Indexing MBRs in a tree –An R-tree order of m has at most m entries in one node –An example (order of 3) R8 R1 R2 R3 R6 R5R4 R7 R8 R7R6 R3R2R1R5R4

Spring 2003Data Mining by H. Liu, ASU9 kd-Tree Indexing multi-dimensional data, one dimension for a level in a tree –An example

Spring 2003Data Mining by H. Liu, ASU10 Common Tasks dealing with Spatial Data Data focusing –Spatial queries –Identifying interesting parts in spatial data –Progress refinement can be applied in a tree structure Feature extraction –Extracting important/relevant features for an application Classification or others –Using training data to create classifiers –Many mining algorithms can be used Classification, clustering, associations

Spring 2003Data Mining by H. Liu, ASU11 Spatial Mining Tasks Spatial classification Spatial clustering Spatial association rules

Spring 2003Data Mining by H. Liu, ASU12 Spatial Classification Use spatial information at different (coarse/fine) levels (in different indexing trees) for data focusing Determine relevant spatial or non-spatial features Perform normal supervised learning algorithms –e.g., Decision trees, NBC, etc.

Spring 2003Data Mining by H. Liu, ASU13 Spatial Clustering Use tree structures to index spatial data Cluster locally –DBSCAN: R-tree –CLIQUE: Grid or Quad tree

Spring 2003Data Mining by H. Liu, ASU14 Spatial Association Rules Spatial objects are of major interest, not transactions A  B –A, B can be either spatial or non-spatial (3 combinations) –What is the fourth combination? Association rules can be found w.r.t. the 3 types

Spring 2003Data Mining by H. Liu, ASU15 Summary Spatial data can contain both spatial and non- spatial features. When spatial information becomes dominant interest, spatial data mining should be applied. Spatial data structures can facilitate spatial mining. Standard data mining algorithms can be modified for spatial data mining, with a substantial part of preprocessing to take into account of spatial information.

Spring 2003Data Mining by H. Liu, ASU16 Bibliography M. H. Dunham. Data Mining – Introductory and Advanced Topics. Prentice Hall R.O. Duda, P.E. Hart, D.G. Stork. Pattern Classification, 2 nd edition. Wiley-Interscience. J. Han and M. Kamber. Data Mining – Concepts and Techniques Morgan Kaufmann.