Management Science 461 Lecture 1b - Distance Metrics September 9, 2008.

Slides:



Advertisements
Similar presentations
Informed search strategies
Advertisements

C1: The Distance Between Two Points & The Mid-Point of a Line
Robot Vision SS 2005 Matthias Rüther 1 ROBOT VISION Lesson 3: Projective Geometry Matthias Rüther Slides courtesy of Marc Pollefeys Department of Computer.
Jeopardy Solving Equations Simplifying Radicals
Bart Jansen, University of Utrecht.  Problem background  Geometrical problem statement  Research  Experimental evaluation of heuristics ◦ Heuristics.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
Review: Search problem formulation
D. Roberts PHYS 121 University of Maryland PHYS 121: Fundamentals of Physics I September 6, 2006.
Localization from Mere Connectivity Yi Shang (University of Missouri - Columbia); Wheeler Ruml (Palo Alto Research Center ); Ying Zhang; Markus Fromherz.
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Optimizing F-Measure with Support Vector Machines David R. Musicant Vipin Kumar Aysel Ozgur FLAIRS 2003 Tuesday, May 13, 2003 Carleton College.
Ensemble Learning: An Introduction
Lecture 16 – Thurs, Oct. 30 Inference for Regression (Sections ): –Hypothesis Tests and Confidence Intervals for Intercept and Slope –Confidence.
Hazırlayan NEURAL NETWORKS Radial Basis Function Networks I PROF. DR. YUSUF OYSAL.
Transportation Logistics Professor Goodchild Spring 2009.
Neural Networks Lecture 17: Self-Organizing Maps
Main Idea and New Vocabulary
Radial Basis Function Networks
Nonlinear Dimensionality Reduction Approaches. Dimensionality Reduction The goal: The meaningful low-dimensional structures hidden in their high-dimensional.
 Limit Cycle Isolated closed trajectories Analysis is, in general, quite difficult. For nonlinear systems, two simple results exist. Limit Cycle
SOLUTION EXAMPLE 4 Standardized Test Practice Use the Distance Formula. You may find it helpful to draw a diagram.
Lecture 3-2 Summarizing Relationships among variables ©
Physics 114: Lecture 15 Probability Tests & Linear Fitting Dale E. Gary NJIT Physics Department.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
Aim: How do we find confidence interval? HW#9: complete question on last slide on loose leaf (DO NOT ME THE HW IT WILL NOT BE ACCEPTED)
Advanced Topics NP-complete reports. Continue on NP, parallelism.
Stats for Engineers Lecture 9. Summary From Last Time Confidence Intervals for the mean t-tables Q Student t-distribution.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. Chapter 6 Sampling Distributions.
Introduction This chapter gives you several methods which can be used to solve complicated equations to given levels of accuracy These are similar to.
Facility Location. Single-Facility Rectilinear Distance Location Problem Locating a new facility among n existing facilities Locating a new facility among.
© 2008 Pearson Addison-Wesley. All rights reserved Chapter 1 Section 13-6 Regression and Correlation.
Find the product. 0.4” (height) Warm-Up Exercises () 8 – m () 9m – ANSWER m 2m 2 17m72 + –z 2z 2 4z4z60 –– ANSWER y 2y – ANSWER d 2d 2 18d+81+ ANSWER.
1 Statistical Distribution Fitting Dr. Jason Merrick.
COUNTING POPULATIONS Estimations & Random Samples.
Data Reduction. 1.Overview 2.The Curse of Dimensionality 3.Data Sampling 4.Binning and Reduction of Cardinality.
Linear Regression Least Squares Method: an introduction.
Parameter estimation. 2D homography Given a set of (x i,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i,x i ), compute.
Review: Tree search Initialize the frontier using the starting state While the frontier is not empty – Choose a frontier node to expand according to search.
Probability and Statistics in Geology Probability and statistics are an important aspect of Earth Science. Understanding the details, population of a data.
CBM RICH multiring recognition and fitting CBM Tracking Week, January, 2005 at GSI, Darmstadt B.Kostenko, E.Litvinenko, G.Ososkov JINR LIT
Midpoint and Distance Formulas. Distance Formula The distance formula is used to find the distance of a line segment.
Transportation Logistics Professor Goodchild Spring 2011.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Tony Jebara, Columbia University Advanced Machine Learning & Perception Instructor: Tony Jebara.
1 Data Analysis Linear Regression Data Analysis Linear Regression Ernesto A. Diaz Department of Mathematics Redwood High School.
Linear Prediction Correlation can be used to make predictions – Values on X can be used to predict values on Y – Stronger relationships between X and Y.
Chapter # 10 Quantitative Facilities Planning Models
A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.
Presented by: Dardan Xhymshiti Spring 2016:. Authors: Publication:  ICDM 2015 Type:  Research Paper 2 Michael ShekelyamGregor JosseMatthias Schubert.
The gradient of a line The gradient of a line is a specific term for the steepness of a straight line. We all have an in-built sense of steepness and can.
Information criteria What function fits best? The more free parameters a model has the higher will be R 2. The more parsimonious a model is the lesser.
1-7 Check Skills v. To find the midpoint of a segment To find the distance between two points in the coordinate plane.
Robust Estimation Course web page: vision.cis.udel.edu/~cv April 23, 2003  Lecture 25.
Artificial Intelligence Lecture No. 8 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
R. Kass/W03 P416 Lecture 5 l Suppose we are trying to measure the true value of some quantity (x T ). u We make repeated measurements of this quantity.
CPSC 322, Lecture 7Slide 1 Heuristic Search Computer Science cpsc322, Lecture 7 (Textbook Chpt 3.6) Sept, 20, 2013.
Check it out! : Proving Properties of Special Quadrilaterals.
Université d’Ottawa / University of Ottawa 2003 Bio 8102A Applied Multivariate Biostatistics L4.1 Lecture 4: Multivariate distance measures l The concept.
Computational Intelligence: Methods and Applications Lecture 14 Bias-variance tradeoff – model selection. Włodzisław Duch Dept. of Informatics, UMK Google:
Computer Science cpsc322, Lecture 7
Data Transformation: Normalization
The Lease Squares Line Finite 1.3.
The Maximum Likelihood Method
Lecture 16: Earth-Mover Distance
Section 3.1 Rounding and Estimating
Discrete Least Squares Approximation
Main Idea and New Vocabulary
Map Scale Fourth Grade.
Approximation Algorithms
Calibration and homographies
Presentation transcript:

Management Science 461 Lecture 1b - Distance Metrics September 9, 2008

Distance Metrics Without distances, DM problems usually aren’t DM problems at all If not distances, then metrics based on distance  Time  Dependencies 2

Location Problems In large-scale location problems, it may be hard to obtain all distances Consider a problem with 1000 nodes: we need a 1000x1000 distance matrix (or do we?) Distance metrics allow us to estimate with relative accuracy, without resorting to more complicated methods 3

Basic Metrics Two fundamental metrics: Euclidean and rectilinear Rectilinear or right-angle distance metric Euclidean or straight-line distance metric 4

Do maps help us? Google Earth Pick two points – is the path between them a grid, straight line, or some combination? 5

Fit a Distance Metric 6 x1x1 x2x2 y1y1 y2y2

Distances Rectilinear: |x 1 -x 2 | + |y 1 -y 2 | Euclidean: [(x 1 -x 2 ) 2 + (y 1 -y 2 ) 2 ] 1/2 Can we combine these two into a single formula? 7

k and s Distance Metric If s=1: Rectilinear metric If s=2: Euclidean metric k is a scaling factor 8

Fit a Distance Metric Determine the actual distances for a subset and estimate parameters k and s Estimate k and s by minimizing the sum of squared differences between actual and estimate distances Choose as large and diverse a sample as possible; bigger sample means better fit  Be careful of overselecting one type! 9

Estimate k and s 10

Straight to the answer It may seem that the straight-line metric would be a poor approximation in most cases … … but straight-line metric provides a surprisingly good approximation of the total distance between many pairs of points 11

Some real-world examples Within the state of Wisconsin, road distances between cities are, on average, 18% longer than the straight-line metric In Ontario, they are about 30% longer So – when we set s = 2, then the optimal k comes out to be 1.18 and 1.30, assuming we use the same scale on the grid to generate the x and y coordinates as the scale on the map 12

Distances in Alberta To model highway distances in Alberta, it is a good idea to use the rectilinear metric (s = 1).  Rural road network is a grid (two miles between E-W roads and one mile between N- S roads, with corrections) Travel distances can be approximated quite accurately using the rectilinear metric 13

Distance Metrics – Final Note In some instances, actual distances will be longer (due to rivers, mountains), and in other instances, actual distances will be shorter (interprovincial highways) Note the difference between distance and time travelled 14