Nearest-Neighbor Searching Under Uncertainty II Pankaj K. Agarwal(Duke) Boris Aronov(NYU-Poly) Sariel Har-Peled(UIUC) Jeff M. Phillips(Utah) Ke Yi(HKUST)

Slides:

Advertisements

Similar presentations

Efficient classification for metric data Lee-Ad GottliebWeizmann Institute Aryeh KontorovichBen Gurion U. Robert KrauthgamerWeizmann Institute TexPoint.

Advertisements

4.1- Plot Points in a Coordinate Plane

Whether it rains, Whether it pours, Wherever I go,

Vorlesung Datawarehousing Table of Contents Prof. Rudolf Bayer, Ph.D. Institut für Informatik, TUM SS 2002.

Slide 1 Insert your own content. Slide 2 Insert your own content.

1 Uncertainty in Spatial Trajectories Goce Trajcevski.

1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 3.1 Chapter 3.

1 Chapter 58 - Clinical Syndromes of Metabolic Alkalosis Copyright © 2013 Elsevier Inc. All rights reserved.

1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 14.

Quest ion 1? A.) answer B.) answer C.) correct answerD.) answer L C.) correct answer F.

Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.

List and Search Grants Chapter 2. List and Search Grants 2-2 Objectives Understand the option My Grants List Grant Screen Viewing a Grant Understand the.

Classifying Complex Numbers Instructions The following slides list a set containing various types of numbers that you are to categorize as being strictly.

DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.

ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.

SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION

MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.

Teacher Name Class / Subject Date A:B: Write an answer here #1 Write your question Here C:D: Write an answer here.

CS4026 Formal Models of Computation Running Haskell Programs – power.

Empty Box Problems Subtraction = 3 If you start on 6 and jump back 3 spaces you land on

BALANCING 2 AIM: To solve equations with variables on both sides.

1 Reverse a Journal Find an existing journal and reverse it in either: A original period B a different period.

ABC Technology Project

1 What Is Mobile Computing? (Cont.) A simple definition could be: Mobile Computing is using a computer (of one kind or another) while on the move Another.

O X Click on Number next to person for a question.

© S Haughton more than 3?

5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:

1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.

Twenty Questions Subject: Twenty Questions

K-means Clustering Ke Chen.

Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.

Solving Absolute Value Equations Solving Absolute Value Equations

Limits (Algebraic) Calculus Fall, What can we do with limits?

Properties of Exponents

1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.

Addition 1’s to 20.

25 seconds left…...

Test B, 100 Subtraction Facts

Click your mouse to move the card ahead! Work with a buddy using two Abacuses. First click and follow along using your abacus. After each click talk about.

What is Slope Assignment. List the four types of slope and sketch each type. 1.

11 = This is the fact family. You say: 8+3=11 and 3+8=11

1.Name the quadrant a. (-5, 1)b. (6, -4) c. (5, 8) d. (-8, -1) e. (7, 2)f. (-9, 4)

1 Ke – Kitchen Elements Newport Ave. – Lot 13 Bethesda, MD.

Bottoms Up Factoring. Start with the X-box 3-9 Product Sum

FIND THE AREA ( ROUND TO THE NEAREST TENTHS) 2.7 in 15 in in.

O X Click on Number next to person for a question.

X-box Factoring. X- Box 3-9 Product Sum Factor the x-box way Example: Factor 3x 2 -13x (3)(-10)= x 2x 3x 2 x-5 3x +2.

1 of 15Laws 13 and 14 Overview LAW 13 Free kicks LAW 14 Penalty Kicks An OVERVIEW.

Use addition to eliminate a variable

Parallel Banding Algorithm to Compute Exact Distance Transform with the GPU Thanh-Tung Cao Ke Tang Anis Mohamed Tiow-Seng Tan.

k-Nearest Neighbors Search in High Dimensions

Spatio-temporal Databases

Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order Edgar Chávez Karina Figueroa Gonzalo Navarro UNIVERSIDAD MICHOACANA, MEXICO.

Nearest Neighbor Search in High Dimensions Seminar in Algorithms and Geometry Mica Arie-Nachimson and Daniel Glasner April 2009.

Cheng, Xie, Yiu, Chen, Sun UV-diagram: a Voronoi Diagram for uncertain data 26th IEEE International Conference on Data Engineering Reynold Cheng (University.

Euripides G.M. PetrakisIR'2001 Oulu, Sept Indexing Images with Multiple Regions Euripides G.M. Petrakis Dept.

Approximate Nearest Subspace Search with applications to pattern recognition Ronen Basri Tal Hassner Lihi Zelnik-Manor Weizmann Institute Caltech.

Nearest Neighbor Searching Under Uncertainty

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality Piotr Indyk, Rajeev Motwani The 30 th annual ACM symposium on theory of computing.

Euripides G.M. PetrakisIR'2001 Oulu, Sept Indexing Images with Multiple Regions Euripides G.M. Petrakis Dept. of Electronic.

Nearest-Neighbor Searching Under Uncertainty Wuzhou Zhang Joint work with Pankaj K. Agarwal, Alon Efrat, and Swaminathan Sankararaman. To appear in PODS.

Spatio-temporal Databases

Nearest-Neighbor Classifiers

Preprocessing to accelerate 1-NN

Aggregate-Max Nearest Neighbor Searching in the Plane

Spatio-temporal Databases

Ronen Basri Tal Hassner Lihi Zelnik-Manor Weizmann Institute Caltech

Presentation transcript:

Nearest-Neighbor Searching Under Uncertainty II Pankaj K. Agarwal(Duke) Boris Aronov(NYU-Poly) Sariel Har-Peled(UIUC) Jeff M. Phillips(Utah) Ke Yi(HKUST) Wuzhou Zhang(Duke)

Nearest Neighbor (NN) Searching 2 Post office problem Find the closest one

Voronoi Diagram 3 Preprocessing time Space Query time

Data Uncertainty Location of data is imprecise: Sensor databases, face recognition, mobile data, etc. 4

Uncertainty Models 5 Uncertainty region

Probabilistic Nearest Neighbor (PNN) 6

Problem Definition 7

Prior Work 8

Our Results Nonzero NNs 9 Preprocessing time (expected) SpaceQuery time

Our Results Nonzero NNs 10 Preprocessing time SpaceQuery time Preprocessing time SpaceQuery time

11 Preprocessing time SpaceQuery time Preprocessing time SpaceQuery time

12

13 Preprocessing time SpaceQuery time

Future Work 14 The PNN problem under the existential model The non-zero NN definition does not make sense Solutions here cannot be directly adapted