 Motivation  Reverse Queries  From Reverse to Inverse  Inverse Queries  Formal Definition  Applications  Framework  Experiments  Future Extensions.

Slides:



Advertisements
Similar presentations
Identifying the Most Influential Data Objects with Reverse Top-k Queries By Akrivi Vlachou 1, Christos Doulkeridis 1, Kjetil Nørvag 1 and Yannis Kotidis.
Advertisements

Group Recommendation: Semantics and Efficiency
Spatio-temporal Databases
Probabilistic Skyline Operator over Sliding Windows Wenjie Zhang University of New South Wales & NICTA, Australia Joint work: Xuemin Lin, Ying Zhang, Wei.
ADBIS 2003 Revisiting M-tree Building Principles Tomáš Skopal 1, Jaroslav Pokorný 2, Michal Krátký 1, Václav Snášel 1 1 Department of Computer Science.
Relational Database Alternatives NoSQL. Choosing A Data Model Relational database underpin legacy applications and meet business needs However, companies.
Active Collaborative Filtering Machine Learning Group Department of Computer Science University of Toronto.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Spatio-temporal Databases Time Parameterized Queries.
Spatio-Temporal Databases
Unit Three: Selecting Features In this unit… ► Find Tool ► Select by Attributes ► Select by Location ► Customizing Selection ► Review ► Selecting: An Overview.
Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..
Databases and Processing Modes. Fundamental Data Storage Concepts and Definitions What is an entity? An entity is something about which information is.
Recommender systems Ram Akella February 23, 2011 Lecture 6b, i290 & 280I University of California at Berkeley Silicon Valley Center/SC.
Techniques and Data Structures for Efficient Multimedia Similarity Search.
Slide 1-1 Irwin/McGraw-Hill© Andrew F. Siegel, 2003 Chapter 1 Introduction: Defining the Role of Statistics in Business.
Data-collection techniques. Contents Types of data Observations Event logs Questionnaires Interview.
Nearest Neighbor Retrieval Using Distance-Based Hashing Michalis Potamias and Panagiotis Papapetrou supervised by Prof George Kollios A method is proposed.
Video/Image Fingerprinting & Search Naren Chittar CS 223-B project, Winter 2008.
Recommender systems Ram Akella November 26 th 2008.
ICPCA 2008 Research of architecture for digital campus LBS in Pervasive Computing Environment 1.
12 -1 Lecture 12 User Modeling Topics –Basics –Example User Model –Construction of User Models –Updating of User Models –Applications.
Attribute Data Input and Management
What is machine learning? 1. A very trivial machine learning tool K-Nearest-Neighbors (KNN) The predicted class of the query sample depends on the voting.
SYSTEM ANALYSIS AND DESIGN
Introduction Using time property and location property from lost items’ pictures, we construct the Lost and Found System which combined with image search.
DATA BASES Team 3 Group 203. What is a DATABASE? A database is a collection of data from one context and systematically stored for later use. In this.
Information Systems: Databases Define the role of general information systems Describe the elements of a database management system (DBMS) Describe the.
Intro to GIS and ESRI Trainers: Randy Jones, GIS Technician, Douglas County Jon Fiskness, GISP GIS Coordinator, City of Superior.
Towards Robust Indexing for Ranked Queries Dong Xin, Chen Chen, Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign VLDB.
EXist Indexing Using the right index for you data Date: 9/29/2008 Dan McCreary President Dan McCreary & Associates (952) M.
WJEC Applied ICT Databases – Queries and Database Practice Queries When you create a database – one of the main strengths of it is the ability to.
Efficient Computation of Reverse Skyline Queries VLDB 2007.
DataBases & Data Mining Joined Specialization Project „Data Mining Classification Tool” By Mateusz Żochowski & Jakub Strzemżalski.
K-Hit Query: Top-k Query Processing with Probabilistic Utility Function SIGMOD2015 Peng Peng, Raymond C.-W. Wong CSE, HKUST 1.
NEAREST NEIGHBORS ALGORITHM Lecturer: Yishay Mansour Presentation: Adi Haviv and Guy Lev 1.
Order the featured book of the day Estimated effort: 2.
Efficient Processing of Top-k Spatial Preference Queries
Week III  Recap from Last Week Review Classes Review Domain Model for EU-Bid & EU-Lease Aggregation Example (Reservation) Attribute Properties.
Recommender Systems Debapriyo Majumdar Information Retrieval – Spring 2015 Indian Statistical Institute Kolkata Credits to Bing Liu (UIC) and Angshul Majumdar.
Intro to GIS & Pictometry Trainers: Randy Jones, GIS Technician, Douglas County Jon Fiskness, GISP GIS Coordinator, City of Superior.
Information Technology Selecting Representative Objects Considering Coverage and Diversity Shenlu Wang 1, Muhammad Aamir Cheema 2, Ying Zhang 3, Xuemin.
Lesson 13 Databases Unit 2—Using the Computer. Computer Concepts BASICS - 22 Objectives Define the purpose and function of database software. Identify.
User Modeling and Recommender Systems: Introduction to recommender systems Adolfo Ruiz Calleja 06/09/2014.
What is Marketing Research?. Marketing Research The process of getting the marketing information needed for determining what customers want.
On Top-n Reverse Top-k Queries: Variants, Algorithms, and Applications 陳良弼 Arbee L.P. Chen National Chengchi University 9/21/2012 at NCHU.
Bin Jiang, Jian Pei ICDE 2009 Online Interval Skyline Queries on Time Series 1.
CS Machine Learning Instance Based Learning (Adapted from various sources)
Eick: kNN kNN: A Non-parametric Classification and Prediction Technique Goals of this set of transparencies: 1.Introduce kNN---a popular non-parameric.
HKU CSIS DB Seminar Skyline Queries HKU CSIS DB Seminar 9 April 2003 Speaker: Eric Lo.
Retele de senzori Curs 2 - 1st edition UNIVERSITATEA „ TRANSILVANIA ” DIN BRAŞOV FACULTATEA DE INGINERIE ELECTRICĂ ŞI ŞTIINŢA CALCULATOARELOR.
WELLS AND TIME SERIES DATA. Framework Temporal Aquifers & Wells.
Geocoding Chapter 16 GISV431 &GEN405 Dr W Britz. Georeferencing, Transformations and Geocoding Georeferencing is the aligning of geographic data to a.
1 Spatial Query Processing using the R-tree Donghui Zhang CCIS, Northeastern University Feb 8, 2005.
1 Introduction to Spatial Databases Donghui Zhang CCIS Northeastern University.
Computer Science and Engineering Jianye Yang 1, Ying Zhang 2, Wenjie Zhang 1, Xuemin Lin 1 Influence based Cost Optimization on User Preference 1 The University.
Presented by: Omar Alqahtani Fall 2016
Statistics 202: Statistical Aspects of Data Mining
Recommender Systems & Collaborative Filtering
Ishan Sharma Abhishek Mittal Vivek Raj
K Nearest Neighbor Classification
Database.
Nearest-Neighbor Classifiers
Basic Grid Projects – Condor (Part I)
Click on the number that makes me equal a hundred
Lecture 2 Components of GIS
QGIS, the data model, use and storage
Mrs. Pearson’s Forensic Science
Relaxing Join and Selection Queries
Efficient Processing of Top-k Spatial Preference Queries
Presentation transcript:

 Motivation  Reverse Queries  From Reverse to Inverse  Inverse Queries  Formal Definition  Applications  Framework  Experiments  Future Extensions 2

Reverse Queries 3

Reverse kNN Queries 4

5 q k=1

Reverse kNN Queries 6 q k=1

From Reverse to Inverse 7

Inverse Queries 8

9

10

 Consider a movie database containing a large number of movie records.  Each movie record contains features such as humor, suspense, romance, etc. 11 humor

 Users of the database are represented by the same attributes, describing their preferences.  Assume that a group of users, such as a family, want to watch a movie together 12 humor

 Find movies sufficiently close to ALL users preferences 13 humor

 Find movies sufficiently close to ALL users preferences 14 humor Recommend me!

 Assume that a set of households and their spatial coordinates. Applications: Mono-Chromatic Inverse kNN query 15

 Some households have been robbed in short succession and the robber must be found. Applications: Mono-Chromatic Inverse kNN query 16

 Assume that the robber will only rob houses which are in his close vicinity, e.g. within the closest hundred households.  An inverse 100NN query returns a list of possible suspects Applications: Mono-Chromatic Inverse kNN query 17

 Assume that the robber will only rob houses which are in his close vicinity, e.g. within the closest hundred households.  An inverse 100NN query returns a list of possible suspects Applications: Mono-Chromatic Inverse kNN query 18 Suspects!

 An online-shop wants to recommend items to their customers by analyzing other items clicked by them.  Clicked items Q seen as samples of products the customer is interested in, and thus, is assumed to be in the customer’s dynamic skyline. Applications: General Inverse Dynamic Skyline Query 19

 The inverse dynamic skyline query can be used to narrow the space which the customers preferences are located in.  Case |Q|=1: Reverse Dynamic Skyline Query. 1 Applications: General Inverse Dynamic Skyline Query 20 1 Evangelos Dellis, Bernhard Seeger: Efficient Computation of Reverse Skyline Queries. VLDB 2007

 Case: Q>1 Applications: General Inverse Dynamic Skyline Query 21

Filter-Refinement Framework 22

Experiments 23

Future Directions 24

25