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

Slides:



Advertisements
Similar presentations
When Is Nearest Neighbors Indexable? Uri Shaft (Oracle Corp.) Raghu Ramakrishnan (UW-Madison)
Advertisements

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)
Clustering k-mean clustering Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein.
A Nonlinear Approach to Dimension Reduction Robert Krauthgamer Weizmann Institute of Science Joint work with Lee-Ad Gottlieb TexPoint fonts used in EMF.
1 Query Processing in Spatial Network Databases presented by Hao Hong Dimitris Papadias Jun Zhang Hong Kong University of Science and Technology Nikos.
k-Nearest Neighbors Search in High Dimensions
Nearest Neighbor Search
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order Edgar Chávez Karina Figueroa Gonzalo Navarro UNIVERSIDAD MICHOACANA, MEXICO.
PARTITIONAL CLUSTERING
Similarity Search on Bregman Divergence, Towards Non- Metric Indexing Zhenjie Zhang, Beng Chi Ooi, Srinivasan Parthasarathy, Anthony K. H. Tung.
School of Computer Science and Engineering Finding Top k Most Influential Spatial Facilities over Uncertain Objects Liming Zhan Ying Zhang Wenjie Zhang.
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree Yong-Sheng Chen Yi-Ping Hung Chiou-Shann Fuh 8 th International Conference on Computer.
Voronoi-based Nearest Neighbor Search for Multi-Dimensional Uncertain Databases Peiwu Zhang Reynold Cheng Nikos Mamoulis Yu Tang University of Hong Kong.
Classification and Decision Boundaries
Discriminative and generative methods for bags of features
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #20.
Multivariate Methods Pattern Recognition and Hypothesis Testing.
Effective Image Database Search via Dimensionality Reduction Anders Bjorholm Dahl and Henrik Aanæs IEEE Computer Society Conference on Computer Vision.
DIMENSIONALITY REDUCTION BY RANDOM PROJECTION AND LATENT SEMANTIC INDEXING Jessica Lin and Dimitrios Gunopulos Ângelo Cardoso IST/UTL December
RBF Neural Networks x x1 Examples inside circles 1 and 2 are of class +, examples outside both circles are of class – What NN does.
Approximate Nearest Subspace Search with Applications to Pattern Recognition Ronen Basri, Tal Hassner, Lihi Zelnik-Manor presented by Andrew Guillory and.
1. 2 General problem Retrieval of time-series similar to a given pattern.
1 Nearest Neighbor Learning Greg Grudic (Notes borrowed from Thomas G. Dietterich and Tom Mitchell) Intro AI.
An Intelligent & Incremental Approach to kNN using R-trees DJ Oneil & Esten Rye (G01)
CES 514 – Data Mining Lec 9 April 14 Mid-term k nearest neighbor.
Information retrieval Finding relevant data using irrelevant keys Example: database of photographic images sorted by number, date. DBMS: Well structured.
Nearest Neighbour Condensing and Editing David Claus February 27, 2004 Computer Vision Reading Group Oxford.
Computer Vision I Instructor: Prof. Ko Nishino. Today How do we recognize objects in images?
Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.
A fuzzy video content representation for video summarization and content-based retrieval Anastasios D. Doulamis, Nikolaos D. Doulamis, Stefanos D. Kollias.
Approximate Nearest Subspace Search with applications to pattern recognition Ronen Basri Tal Hassner Lihi Zelnik-Manor Weizmann Institute Caltech.
Data Mining. 2 Models Created by Data Mining Linear Equations Rules Clusters Graphs Tree Structures Recurrent Patterns.
嵌入式視覺 Pattern Recognition for Embedded Vision Template matching Statistical / Structural Pattern Recognition Neural networks.
Multimedia and Time-series Data
Clustering methods Course code: Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu,
DATA MINING LECTURE 10 Classification k-nearest neighbor classifier Naïve Bayes Logistic Regression Support Vector Machines.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
Nearest Neighbor Searching Under Uncertainty
K Nearest Neighbors Classifier & Decision Trees
Distributed Information Retrieval Server Ranking for Distributed Text Retrieval Systems on the Internet B. Yuwono and D. Lee Siemens TREC-4 Report: Further.
Pattern Recognition April 19, 2007 Suggested Reading: Horn Chapter 14.
CSE 185 Introduction to Computer Vision Face Recognition.
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality Piotr Indyk, Rajeev Motwani The 30 th annual ACM symposium on theory of computing.
DATA MINING LECTURE 10b Classification k-nearest neighbor classifier
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.
Eick: kNN kNN: A Non-parametric Classification and Prediction Technique Goals of this set of transparencies: 1.Introduce kNN---a popular non-parameric.
3D Face Recognition Using Range Images Literature Survey Joonsoo Lee 3/10/05.
Debrup Chakraborty Non Parametric Methods Pattern Recognition and Machine Learning.
WHAT IS DATA MINING?  The process of automatically extracting useful information from large amounts of data.  Uses traditional data analysis techniques.
Data Mining ICCM
Tutorial 3 – Computational Geometry
Haim Kaplan and Uri Zwick
Christian Wolf 1, Jean-Michel Jolion 2, Walter G
What is Pattern Recognition?
K Nearest Neighbor Classification
Image Segmentation Techniques
Object Modeling with Layers
Nearest-Neighbor Classifiers
Research Areas Christoph F. Eick
Chapter 2 Basic Models for the Location Problem
Distributed Probabilistic Range-Aggregate Query on Uncertain Data
COSC 4335: Other Classification Techniques
Cheng-Yi, Chuang (莊成毅), b99
CS4670: Intro to Computer Vision
Range Queries on Uncertain Data
Aggregate-Max Nearest Neighbor Searching in the Plane
Grouping/Segmentation
Research Institute for Future Media Computing
Ronen Basri Tal Hassner Lihi Zelnik-Manor Weizmann Institute Caltech
Presentation transcript:

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

Nearest-Neighbor Searching Applications Pattern Recognition, Data Compression Statistical Classification, Clustering Databases, Information Retrieval Computer Vision, etc. 2

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

Our Model and Problem Statement

Previous work and Our contribution 5

Summary of results 6 Distance function SettingsPreprocessing timeSpaceQuery time Squared Euclidean distance Uncertain data Uncertain query Rectilinear metric Uncertain data Uncertain query Uncertain data Uncertain query

Voronoi Diagram 7 Preprocessing time Space Query time

Expected Voronoi Diagram 8

Minimization diagram 9

Squared Euclidean distance Uncertain data 10 Preprocessing timeSpaceQuery time Remarks: Works for any distribution

Rectilinear metric Uncertain data 11

Rectilinear metric Uncertain data (cont.) 12 Linear!

Rectilinear metric Uncertain data (cont.) 13 Preprocessing timeSpaceQuery time Remarks: Extends to higher dimensions

14

15 Quadtree: 4-way tree Preprocessing timeSpaceQuery time

Further work 16

Squared Euclidean distance Uncertain query 17 Preprocessing timeSpaceQuery time Remarks: Extends to higher dimensions and works for any distribution

Rectilinear metric Uncertain query 18 Preprocessing time Space Query time

19 Preprocessing time Space Query time Remarks: Extends to higher dimensions