6/3/2015 T.K. Cocx, Prediction of criminal careers through 2- dimensional Extrapolation W. Kosters et al.

Slides:



Advertisements
Similar presentations
Binary Shape Clustering via Zernike Moments
Advertisements

SVM - Support Vector Machines A new classification method for both linear and nonlinear data It uses a nonlinear mapping to transform the original training.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Curve Fitting ~ Least Squares Regression Chapter.
By: Michael Vorobyov. Moments In general, moments are quantitative values that describe a distribution by raising the components to different powers.
Numeriska beräkningar i Naturvetenskap och Teknik Today’s topic: Approximations Least square method Interpolations Fit of polynomials Splines.
Announcements Final Exam May 13th, 8 am (not my idea).
Data mining and statistical learning - lecture 6
CITS2401 Computer Analysis & Visualisation
Efficiency concerns in Privacy Preserving methods Optimization of MASK Shipra Agrawal.
Text Classification With Support Vector Machines
DATA MINING CS157A Swathi Rangan. A Brief History of Data Mining The term “Data Mining” was only introduced in the 1990s. Data Mining roots are traced.
Mutual Information Mathematical Biology Seminar
CS 590M Fall 2001: Security Issues in Data Mining Lecture 3: Classification.
CES 514 – Data Mining Lecture 8 classification (contd…)
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Spatial Interpolation
Fitting a Model to Data Reading: 15.1,
Dimension reduction : PCA and Clustering Christopher Workman Center for Biological Sequence Analysis DTU.
Math for CSLecture 11 Mathematical Methods for Computer Science Lecture 1.
Chapter 6 Numerical Interpolation
Text Classification With Labeled and Unlabeled Data Presenter: Aleksandar Milisic Supervisor: Dr. David Albrecht.
Statistics for Managers Using Microsoft® Excel 7th Edition
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Data Mining By Andrie Suherman. Agenda Introduction Major Elements Steps/ Processes Tools used for data mining Advantages and Disadvantages.
Evaluating Performance for Data Mining Techniques
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
WP3 - 3D reprojection Goal: reproject 2D ball positions from both cameras into 3D space Inputs: – 2D ball positions estimated by WP2 – 2D table positions.
Using ESRI ArcGIS 9.3 Spatial Analyst
Introduction In medicine, business, sports, science, and other fields, important decisions are based on statistical information drawn from samples. A sample.
1 Pattern Recognition Concepts How should objects be represented? Algorithms for recognition/matching * nearest neighbors * decision tree * decision functions.
Kernel Methods A B M Shawkat Ali 1 2 Data Mining ¤ DM or KDD (Knowledge Discovery in Databases) Extracting previously unknown, valid, and actionable.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Automatic Minirhizotron Root Image Analysis Using Two-Dimensional Matched Filtering and Local Entropy Thresholding Presented by Guang Zeng.
DataBases & Data Mining Joined Specialization Project „Data Mining Classification Tool” By Mateusz Żochowski & Jakub Strzemżalski.
Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Fitting Linear Functions to Data Lesson Cricket Chirps & Temp. ► Your assignment was to count cricket chirps and check the temperature ► The data.
DATA MINING By Cecilia Parng CS 157B.
Data Science and Big Data Analytics Chap 4: Advanced Analytical Theory and Methods: Clustering Charles Tappert Seidenberg School of CSIS, Pace University.
DATA MINING WITH CLUSTERING AND CLASSIFICATION Spring 2007, SJSU Benjamin Lam.
Multivariate Analysis and Data Reduction. Multivariate Analysis Multivariate analysis tries to find patterns and relationships among multiple dependent.
Chapter 20 Classification and Estimation Classification – Feature selection Good feature have four characteristics: –Discrimination. Features.
A Statistical Approach to Texture Classification Nicholas Chan Heather Dunlop Project Dec. 14, 2005.
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
Cell Segmentation in Microscopy Imagery Using a Bag of Local Bayesian Classifiers Zhaozheng Yin RI/CMU, Fall 2009.
Classification on Manifolds Suman K. Sen joint work with Dr. J. S. Marron & Dr. Mark Foskey.
Computational Intelligence: Methods and Applications Lecture 22 Linear discrimination - variants Włodzisław Duch Dept. of Informatics, UMK Google: W Duch.
Data Mining – Clustering and Classification 1.  Review Questions ◦ Question 1: Clustering and Classification  Algorithm Questions ◦ Question 2: K-Means.
INTERPOLATION Procedure to predict values of attributes at unsampled points within the region sampled Why?Examples: -Can not measure all locations: - temperature.
Sampling and Sampling Distribution
Privacy-Preserving Clustering
School of Computer Science & Engineering
UW Extension Certificate Program in Game Development 2nd quarter: Advanced Graphics Animation.
International Workshop
Determining How Costs Behave
Principal Component Analysis (PCA)
Fitting Linear Functions to Data
ISOMAP TRACKING WITH PARTICLE FILTERING
The Least Squares Line Lesson 1.3.
Overview Identify similarities present in biological sequences and present them in a comprehensible manner to the biologists Objective Capturing Similarity.
A Hybrid PCA-LDA Model for Dimension Reduction Nan Zhao1, Washington Mio2 and Xiuwen Liu1 1Department of Computer Science, 2Department of Mathematics Florida.
MIS2502: Data Analytics Clustering and Segmentation
Prediction of criminal careers through 2-dimensional Extrapolation
A Method for the Comparison of Criminal Cases using digital documents
Adapting and Visualizing Association Rule Mining Systems
Feature Selection Methods
A Method for the Comparison of Criminal Cases using digital documents
Presentation transcript:

6/3/2015 T.K. Cocx, Prediction of criminal careers through 2- dimensional Extrapolation W. Kosters et al.

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, ?

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, ? ? 2-Dimensional Extrapolation

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Research Area Criminal Career Study Sociology Psychology Criminology Law Computer Science

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Criminal Careers

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Analysis Goal Analysis

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Practical Factors NatureDurationFrequencySeriousness

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Paradigm Four factors Distance Measure Clustering Prediction Strategic analysis done on this

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Alignment

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Calculating Distance between Careers  Nature  Severity

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Clustering and classification  Clustering is done based upon distance  Form of multi-dimensional scaling  Iterative is necessary  After clustering: classes are assigned to visible clusters.  By hand  11 classes  Classification can be done by k-means

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Results: Clustering and Classification Year 1Year 2Year 3 Year 4

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, 2-Dimensional Extrapolation ? Year 1 Year 2 Year 3 Year 4  The ‘Marble in Funnel’ and the ‘Criminal Career Prediction’ are two variants of the same problem:  Extrapolation of a time sequence in a plane.

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Regular Mathematical Extrapolation  One variable (usually time, x) is given.  One Variable (Value, Temperature, weight, etc, y) is dependant on the given variable

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, 2-Dimensional Extrapolation  One variable (usually time, t) is given.  Two variables (x, y) are dependant on the given variable.  Sometimes (as in the criminal career prediction) x and y are meaningless. Only the location relative to already placed elements is important.  Relatively under-researched area in mathematics.

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Possible solutions 2-Dimensional Extrapolation Assume y depends on x Rotate image to optimally Arrange t-order on x-axis Regular second degree extrapolation Same as Left option Regular third degree extrapolation Assume x depends on t and y depends on t separately Extrapolate separately Combine in {x,y}-system Spline interpolate items t and t+1 Extrapolate after t last Different methods

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Spline Extrapolation  There are two choices in spline extrapolation: Straight line cont. Polynomial cont.

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Future Class Calculation  Select n existing data points closest to extrapolated curve.  The closer to ‘last known’ point, the more accurate.  Calculate expected attributes of individual under consideration with weighted average of the n points.  Classify current individual using these attributes.

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Overview of method Two-dimensionalHigh-dimensional Four factors Distance Matrix Crimes committed Clustering Classification Extrapolation Class Prediction Prediction # crimes Combined

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Implementation

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Cluster Reduction

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Results  Using the original Dutch National Criminal Record Database (App. 1 million offenders)

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Effects of number of reference points  How many reference points are needed?  is enough

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Effects of known years  How many years should be known for an accurate prediction?  3-5 is enough

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Privacy issues  Data mining  general truth from lot of data  In this case translate this truth to individual cases  privacy and statistical issues arise  Comparable to data mining on financial transactions  Seen as acceptable  Reasonably few false positives  Operatives familiar with percentages  The approach poses no risk to non-offenders  only (existing) career continuation

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Conclusion  Criminal career analysis can serve as basis for career prediction.  Using the concept of 2-dimensional extrapolation on an existing clustering yields the movement in time of an individual from his past to his future  Using ‘straight line spline’ extrapolation with the maximum existing elements predicts the future class of an offender with an 88.7% Accuracy.

Prediction of criminal careers through 2-dimensional extrapolation 6/3/2015T.K. Cocx, Interrogation