COSC 6335 Data Mining Fall 2009: Assignment3a Post Analysis

Slides:



Advertisements
Similar presentations
Christoph F. Eick Questions and Topics Review Dec. 10, Compare AGNES /Hierarchical clustering with K-means; what are the main differences? 2. K-means.
Advertisements

Non-Parametric Density Functions Christoph F. Eick 12/24/08.
Analysis of Contour Motions Ce Liu William T. Freeman Edward H. Adelson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute.
Multi-Scale Analysis of Crime and Incident Patterns in Camden Dawn Williams Department of Civil, Environmental & Geomatic.
2005 Syndromic Surveillance1 Estimating the Expected Warning Time of Outbreak- Detection Algorithms Yanna Shen, Weng-Keen Wong, Gregory F. Cooper RODS.
Automatic Identification of Bacterial Types using Statistical Image Modeling Sigal Trattner, Dr. Hayit Greenspan, Prof. Shimon Abboud Department of Biomedical.
Introduction to medical image analysis Final Project Presentation Sang Woo Lee.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Locally Constraint Support Vector Clustering
Raster Data. The Raster Data Model The Raster Data Model is used to model spatial phenomena that vary continuously over a surface and that do not have.
Unsupervised Learning: Clustering Rong Jin Outline  Unsupervised learning  K means for clustering  Expectation Maximization algorithm for clustering.
Object Detection and Tracking Mike Knowles 11 th January 2005
SEARO –CSR Early Warning and Surveillance System Module GIS in EWAR.
Tanmoy Mondal, Ashish Jain, and H. K. Sardana. Introdution the research advancement in the field of automatic detection of craniofacial structures has.
Kernel Density Estimation - concept and applications
Lecture 10: Map Design Geography 128 Analytical and Computer Cartography Spring 2007 Department of Geography University of California, Santa Barbara.
1 Motivation Video Communication over Heterogeneous Networks –Diverse client devices –Various network connection bandwidths Limitations of Scalable Video.
Applied Kernel Density Estimation: Dynamic Spatiotemporal Analysis of Density Maps on Crime Data David G. Smalling.
Quakefinder : A Scalable Data Mining System for detecting Earthquakes from Space A paper by Paul Stolorz and Christopher Dean Presented by, Naresh Baliga.
Last Words COSC Big Data (frameworks and environments to analyze big datasets) has become a hot topic; it is a mixture of data analysis, data mining,
A Few Answers Review September 23, 2010
Discovering Interesting Regions in Spatial Data Sets Christoph F. Eick for the Data Mining Class 1.Motivation: Examples of Region Discovery 2.Region Discovery.
Mining and Visualization of Flow Cytometry Data ANGELA CHIN UNIVERSITY OF HOUSTON RESEARCH EXPERIENCE FOR UNDERGRADUATES JULY 3,
A N A RCHITECTURE AND A LGORITHMS FOR M ULTI -R UN C LUSTERING Rachsuda Jiamthapthaksin, Christoph F. Eick and Vadeerat Rinsurongkawong Computer Science.
Department of Computer Science 2015 Research Areas and Projects 1.Data Mining and Machine Learning Group (UH-DMML) Its research is focusing on: 1.Spatial.
EE663 Image Processing Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
1 Running Clustering Algorithm in Weka Presented by Rachsuda Jiamthapthaksin Computer Science Department University of Houston.
1. Data Mining (or KDD) Let us find something interesting! Definition := “Data Mining is the non-trivial process of identifying valid, novel, potentially.
EDGE DETECTION USING MINMAX MEASURES SOUNDARARAJAN EZEKIEL Matthew Lang Department of Computer Science Indiana University of Pennsylvania Indiana, PA.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 New Unsupervised Clustering Algorithm for Large Datasets.
Last Words DM 1. Mining Data Steams / Incremental Data Mining / Mining sensor data (e.g. modify a decision tree assuming that new examples arrive continuously,
Department of Computer Science 1 KDD / Data Mining Let us find something interesting!  Motivation: We are drowning in data, but we are staving for knowledge.
Sensor B Sensor A Sensor C Sensor D Sensor E Lightweight Mining Techniques Time Frame: 10 Time Threshold: 20.
Change Analysis in Spatial Datasets by Interestingness Comparison Vadeerat Rinsurongkawong, and Christoph F. Eick Department of Computer Science, University.
Applications of Supervised Learning in Bioinformatics Yen-Jen Oyang Dept. of Computer Science and Information Engineering.
A Spatial-Temporal Model for Identifying Dynamic Patterns of Epidemic Diffusion Tzai-Hung Wen Associate Professor Department of Geography,
Department of Computer Science 1 Data Mining / KDD Let us find something interesting! Definition := “KDD is the non-trivial process of identifying valid,
CS332 Visual Processing Department of Computer Science Wellesley College High-Level Vision Face Recognition I.
Eick: kNN kNN: A Non-parametric Classification and Prediction Technique Goals of this set of transparencies: 1.Introduce kNN---a popular non-parameric.
Department of Computer Science Research Areas and Projects 1. Data Mining and Machine Learning Group ( research.
Corresponding Clustering: An Approach to Cluster Multiple Related Spatial Datasets Vadeerat Rinsurongkawong and Christoph F. Eick Department of Computer.
Spatial statistics What is spatial statistics?  Refers to a very broad collection of methods and techniques of visualization, exploration and analysis.
Yellow River Delta Morphology Over Time: A Remote Sensing Spatial Study Utilizing MODIS James Lee Waclawczyk Department of Earth and Environmental Science,
General Information Course Id: COSC6342 Machine Learning Time: TU/TH 1-2:30p Instructor: Christoph F. Eick Classroom:AH301
Discovering Interesting Regions in Spatial Data Sets Christoph F. Eick for Data Mining Class 1.Motivation: Examples of Region Discovery 2.Region Discovery.
Introduction to Spatial Statistical Analysis
Journal of Vision. 2009;9(3):5. doi: /9.3.5 Figure Legend:
ALZHEIMER DISEASE PREDICTION USING DATA MINING TECHNIQUES P.SUGANYA (RESEARCH SCHOLAR) DEPARTMENT OF COMPUTER SCIENCE TIRUPPUR KUMARAN COLLEGE FOR WOMEN.
Volume 63, Issue 3, Pages (August 2009)
Research Focus Objectives: The Data Analysis and Intelligent Systems (DAIS) Lab  aims at the development of data analysis, data mining, GIS and artificial.
Make your map 3D 1. Trace Contour Map of Mt. Capulin onto White Paper
Homogeneity Guided Probabilistic Data Summaries for Analysis and Visualization of Large-Scale Data Sets Ohio State University (Shen) Problem: Existing.
Research Areas Christoph F. Eick
Data Analysis and Intelligent Systems Lab
Estimating the Expected Warning Time of Outbreak-Detection Algorithms
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Volume 87, Issue 3, Pages (August 2015)
Analysis of Contour Motions
Volume 63, Issue 3, Pages (August 2009)
Spatial Data Mining Definition: Spatial data mining is the process of discovering interesting patterns from large spatial datasets; it organizes by location.
Image and Video Processing
Discovery of Interesting Spatial Regions
A. S. Weigend M. Mangeas A. N. Srivastava
Machine Learning – a Probabilistic Perspective
REVIEW OVER TYPES OF MAP TERMS 10 MINUTES YOU MAY CONSULT YOUR NOTES
Data Pre-processing Lecture Notes for Chapter 2
Data Mining Anomaly/Outlier Detection
Spatial statistics of X-ray volumes reveal layering and spatially diverse distribution of cell bodies. Spatial statistics of X-ray volumes reveal layering.
Comments Task AS1 Tasks 12 Given a collection of boolean spatial features, the co-location pattern discovery process finds the subsets of features that.
Presentation transcript:

COSC 6335 Data Mining Fall 2009: Assignment3a Post Analysis Christoph F. Eick Department of Computer Science, University of Houston

K-Means Complex9 Ruchika

Faris K-Means We are interested in change analysis that centers on identifying changes concerning interesting regions between two dataset Oold and Onew sampled at different time frames. The approach employs supervised density functions that create density maps from spatial datasets. Regions where density functions take high or low values are considered interesting by this approach. Interesting regions are identified using contouring techniques.

Student Result Complex9

Kaavya My values are epsilon = 0.0255 and m = 4.

Earth Quake Backgroud http://www.geo.ua.edu/intro03/quakes.html http://www.cessind.org/images/images/earthquakeglobal.gif (skip!) http://www.data.scec.org/Module/storyline.html (important!) http://library.thinkquest.org/03oct/00758/en/disaster/earthquake/faultlines.html Detecting changes in spatial datasets is important for many fields such as early warning systems that monitor environmental conditions or sudden disease outbreaks, epidemiology, crime monitoring, and automatic surveillance. This paper introduces a novel methodology and algorithms that discover patterns of change in spatial datasets.

Student Results Earthquake Anarug:Earthquake dataset ε=0.028 MinPoints =10

Le

3. Moustafa Density estimation is called supervised because in addition to the density based on the locations of objects, we take the variable of interest z(o) into consideration when measuring density. In contrast to past work in density estimation, our approach employs weighted influence functions to measure the density in datasets O: the influence of o on v is weighted by z(o) and measured as a product of z(o) and a Gaussian kernel function. The figure depicts an example of results from Supervised Density Estimation. A dataset O is a dataset in which objects belong to two classes in blue and yellow color. O contains the points which are assumed to have spatial attributes (x,y) and attribute of interest z where z takes the value +1 if the objects belong to class yellow and -1 if the objects belong to class blue. Figure b visualizes the supervised density function of the dataset O. Figure c shows the density contour map for the density threshold 10 in red and -10 in blue.