Probabilistic Autocomplete Suggestion Ranking with Localization and Personalization A Quick Notes for Geosearch
|
|
- Roberta Peters
- 5 years ago
- Views:
Transcription
1 Probabilistic Autocomplete Suggestion Ranking with Localization and Personalization A Quick Notes for Geosearch Xugang Ye Introduction We aim to formulate the problem of the autocomplete suggestion ranking in a general probabilistic way with localization and personalization. The common formulation is based on the relevance probability of the suggestion given the prefix. We now add the search location and user profile into the conditions so that the top ranked suggestion results are not only relevant to the user s typed input, but also relevant to user s location context and historical activities. 1. Formulation We denote P(sug pre, l, u) as the relevance probability of the suggestion sug given the prefix pre, the search location l, and the user u. In order to calculate this probability, we consider the Bayes rule: P(sug pre, l, u) =.(/01,l,2 324). Assume that (pre, l) and u are independent with or.(/01,l,2) without given sug, then P(sug pre, l, u).(/01,l 324).(2 324).(/01,l).(2) = P(sug pre, l).(324 2). (1) Therefore, the probability can be approximately factorized into two factors: P(sug pre, l) and.(324 2). The first one quantifies the relevance of sug for general user with location context; the second one quantifies the dependence of sug on u, i.e. personalization. For P(sug pre, l), we calculate it via conditioning on the geo-partition i. That is P(sug pre, l) = P(sug pre, l, i)p(i pre, l) 9 = P(sug pre, i)p(i l) 9, (2) where P(sug pre, i) is the local relevance probability for the partition i, and P(i l) is the weight of partition i given the search location l. To calculate P(sug pre, i) for a particular i, we expand it via conditioning on the synonym-space of the partition i. That is P(sug pre, i) = 3<=? (@) P(sug pre, i, syn)p(syn pre, i) = 3<=? (@) P(sug syn, i)p(syn pre, i), (3) where P(sug syn, i) is the local relevance probability of sug given the synonym syn and the partition number i, P(syn pre, i) is the probability of the synonym syn given the prefix pre and the partition number i, and S (9) is the synonym space of the partition i.
2 For.(324 2), we calculate P(sug u) via conditioning on a set of features f, that is P(sug u) = PDsug f EPDf ue =.DF 324E PDf ue.de = P(sug).DF 324E PDf ue.de P(sug).( 324) P(f 9 u) 9 = P(sug).( 324) 9 P(f 9 u), (4) where we have applied the Bayes rule and also assumed that f are independent with and without given sug. This yields.(324 2).( 324) 9 P(f 9 u). (5) 2. Implementation We adopt the two-phase greedy ranking for runtime efficiency. In phase 1, we calculate P(sug pre, l). In this phase, there is no personalization. That requires us to calculate P(i l) and P(sug pre, i) for all i. For P(i l), the formula could be distance-based, for example, P(i l) = HIJ N HIJ (LM(9 N,l)), where d(i, l) is a (relative) distance measure of partition i and the search location l. In practice, l can be geo-hashed so that in runtime P(i l) can be looked up from previous computed (geo-code, geopartition)-probability table. For P(sug pre, i), we need P(sug syn, i) and P(syn pre, i). Note that P(sug syn, i) can be precomputed and stored in the (synonym, suggestion)-probability table for the partition i. However, P(syn pre, i) has to be computed in runtime from the pre-built synonym-trie data structure of the partition i. In summary, in the phase 1, we need to build those things into the memory: 1) (geo-code, geopartition)-probability table; 2) (synonym, suggestion)-probability tables for all partitions, and 3) synonym-trie data structures for all partitions. Upon the completion of the phase 1, we would have retrieved a list of suggestions for the input pair (pre, l), and ranked them by the phase 1 ranking score as P(sug pre, l). In phase 2, for each suggestion sug, we calculate.(324 2) against the user u, which, by (5), can be.( 324) approximated by 9 P(f 9 u). We define a phase 2 ranking score as s(sug, u) = ln.( 324) 9 P(f 9 u) = ln.( 324) 9 P(f 9 u). To be able to calculate this, we need a pre-
3 built user-profile DB that stores P(f 9 u) and P(f 9 ) and a (suggestion, feature)-value table that stores P(f 9 sug). For runtime requirement, those values may be pre-sent to the user-cache so that the scoring function can read from in-memory. Upon the completion of the phase 2, we would have reranked the list returned in the phase Evaluation Metrics We use five click-based metrics: 1) Typing effort, which is measured by number of chars typed upon click. 2) Clicked position. 3) Click-recall of top k positions, defined as CR T = UVWXHY Z[ \]^\_` ^a [^Y`b T JZ`^b^Za` UVWXHY Z[ \]^\_` 4) Click-precision of top k positions, defined as CP T = UVWXHY Z[ \]^\_` c (e) fg k, ]Zh i Dcj9 (e) E. where i (k) is the clicked position of the click c, I 9 (e) nt is the indicator of whether i(k) k. 5) Session success, which is measured by number of chars entered upon click on search button. 4. Result demo typehead = sea, location = POINT( , ), user = general user Seattle Hill-Silver Firs, WA CITY POINT( ) POINT( ) Seattle Center - King County,WA LOCALE POINT( ) Capitol Hill, Seattle, WA NEIGHBORHOOD POINT( ) POINT( ) Magnolia, Seattle, WA NEIGHBORHOOD POINT( ) POINT( ) typehead = sea, location = POINT( , ), user = user ***0608 Seattle Hill-Silver Firs, WA CITY POINT( ) POINT( ) Seatac, WA CITY POINT( ) POINT( ) Seattle Center - King County,WA LOCALE POINT( ) Capitol Hill, Seattle, WA NEIGHBORHOOD POINT( ) POINT( ) typehead = sea, location = POINT( , ), user = general user Seabrook, NH CITY POINT( ) POINT( ) Sea Street Beach - Barnstable County,MA BEACH POINT( ) Cape Cod National Seashore - Barnstable County,MA PARK POINT( ) Sea Gull Beach - Barnstable County,MA BEACH POINT( )
4 typehead = sea, location = POINT( , ), user = user ***0608 Seabrook, NH CITY POINT( ) POINT( ) Sea Street Beach - Barnstable County,MA BEACH POINT( ) Cape Cod National Seashore - Barnstable County,MA PARK POINT( ) Seaside Park - Essex County,MA PARK POINT( ) 5. Running time We randomly generated 5000 typeheads or abbreviations from the synonym space. Length of typehead = 2: Length of typehead = Length of typehead = Length of typehead =
5 6. A/B Test Results Evaluation metrics are calculated from the three months user click-logs for the three types of settings: general ranking (GR), localized ranking (LR), localized and personalized ranking (LPR).
Probabilistic Autocomplete Suggestion Ranking with Localization and Personalization A Quick Notes for Geosearch
Probabilistic Autocomplete Suggestion Ranking with Localization and Personalization A Quick Notes for Geosearch Xugang Ye Introduction We aim to formulate the problem of the autocomplete suggestion ranking
More information搜索中的带区域化和个性化的自动补全和自动建议技术 叶旭刚
搜索中的带区域化和个性化的自动补全和自动建议技术 叶旭刚 Probabilistic Autocomplete Suggestion Ranking with Localization and Personalization Xugang Ye General Search vs. Vertical Search General Search General data General users Many
More informationTopics Covered in This Chapter:
Introduction to Powers of 10 Topics Covered in This Chapter: I-1: Scientific Notation I-2: Engineering Notation and Metric Prefixes I-3: Converting between Metric Prefixes I-4: Addition and Subtraction
More informationTHE DEVELOPMENT OF ROAD ACCIDENT DATABASE MANAGEMENT SYSTEM FOR ROAD SAFETY ANALYSES AND IMPROVEMENT
THE DEVELOPMENT OF ROAD ACCIDENT DATABASE MANAGEMENT SYSTEM FOR ROAD SAFETY ANALYSES AND IMPROVEMENT By T. H. Law Radin Umar R. S. (Road Safety Research Center, Faculty of Engineering, University Putra
More informationInformation Retrieval
Introduction to Information Retrieval Lecture 12: Language Models for IR Outline Language models Language Models for IR Discussion What is a language model? We can view a finite state automaton as a deterministic
More informationProofs, Strings, and Finite Automata. CS154 Chris Pollett Feb 5, 2007.
Proofs, Strings, and Finite Automata CS154 Chris Pollett Feb 5, 2007. Outline Proofs and Proof Strategies Strings Finding proofs Example: For every graph G, the sum of the degrees of all the nodes in G
More informationNon-Inferiority Tests for the Ratio of Two Proportions in a Cluster- Randomized Design
Chapter 236 Non-Inferiority Tests for the Ratio of Two Proportions in a Cluster- Randomized Design Introduction This module provides power analysis and sample size calculation for non-inferiority tests
More informationClick Models for Web Search
Click Models for Web Search Lecture 1 Aleksandr Chuklin, Ilya Markov Maarten de Rijke a.chuklin@uva.nl i.markov@uva.nl derijke@uva.nl University of Amsterdam Google Research Europe AC IM MdR Click Models
More informationIndependent Samples ANOVA
Independent Samples ANOVA In this example students were randomly assigned to one of three mnemonics (techniques for improving memory) rehearsal (the control group; simply repeat the words), visual imagery
More informationCitation for published version (APA): Andogah, G. (2010). Geographically constrained information retrieval Groningen: s.n.
University of Groningen Geographically constrained information retrieval Andogah, Geoffrey IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from
More information4 NORTH/EAST CITIES REGIONAL MUNICIPAL JAIL PLANNING 5 EIS SCOPING MEETING. 12 January 14, :30 p.m. 16 Seattle Center Olympic Room
1 1 2 3 4 NORTH/EAST CITIES REGIONAL MUNICIPAL JAIL PLANNING 5 EIS SCOPING MEETING 6 7 8 9 10 11 12 January 14, 2009 13 6:30 p.m. 14 15 16 Seattle Center Olympic Room 17 18 Seattle, Washington 19 20 21
More informationNebraska Core Academic Content Standards Science Grade: 2 - Adopted: 2010
Main Criteria: Nebraska Core Academic Content Standards Secondary Criteria: Subjects: Science, Social Studies Grade: 2 Correlation Options: Show Correlated Nebraska Core Academic Content Standards Science
More informationAlgorithms for Data Science
Algorithms for Data Science CSOR W4246 Eleni Drinea Computer Science Department Columbia University Tuesday, December 1, 2015 Outline 1 Recap Balls and bins 2 On randomized algorithms 3 Saving space: hashing-based
More informationApril 12, S5.3q Logarithmic Functions and Graphs
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 5: Exponential and Logarithmic Functions 5.1 Inverse Functions 5.2 Exponential Functions and Graphs 5.3 Logarithmic Functions
More informationRanked Retrieval (2)
Text Technologies for Data Science INFR11145 Ranked Retrieval (2) Instructor: Walid Magdy 31-Oct-2017 Lecture Objectives Learn about Probabilistic models BM25 Learn about LM for IR 2 1 Recall: VSM & TFIDF
More informationLarge-scale Collaborative Ranking in Near-Linear Time
Large-scale Collaborative Ranking in Near-Linear Time Liwei Wu Depts of Statistics and Computer Science UC Davis KDD 17, Halifax, Canada August 13-17, 2017 Joint work with Cho-Jui Hsieh and James Sharpnack
More informationQuantization. Robert M. Haralick. Computer Science, Graduate Center City University of New York
Quantization Robert M. Haralick Computer Science, Graduate Center City University of New York Outline Quantizing 1 Quantizing 2 3 4 5 6 Quantizing Data is real-valued Data is integer valued with large
More informationNC DWQ Stormwater Permitting Interactive Map
P a g e 1 NC DWQ Stormwater Permitting Interactive Map Using This Map This interactive map viewer uses Google Fusion Tables to show North Carolina permitting information in a Google Maps Interface. Finding
More informationCSCB63 Winter Week 11 Bloom Filters. Anna Bretscher. March 30, / 13
CSCB63 Winter 2019 Week 11 Bloom Filters Anna Bretscher March 30, 2019 1 / 13 Today Bloom Filters Definition Expected Complexity Applications 2 / 13 Bloom Filters (Specification) A bloom filter is a probabilistic
More informationDiscovering Geographical Topics in Twitter
Discovering Geographical Topics in Twitter Liangjie Hong, Lehigh University Amr Ahmed, Yahoo! Research Alexander J. Smola, Yahoo! Research Siva Gurumurthy, Twitter Kostas Tsioutsiouliklis, Twitter Overview
More informationLogistic Regression Models to Integrate Actuarial and Psychological Risk Factors For predicting 5- and 10-Year Sexual and Violent Recidivism Rates
Logistic Regression Models to Integrate Actuarial and Psychological Risk Factors For predicting 5- and 10-Year Sexual and Violent Recidivism Rates WI-ATSA June 2-3, 2016 Overview Brief description of logistic
More informationInformation Retrieval
Introduction to Information Retrieval Lecture 11: Probabilistic Information Retrieval 1 Outline Basic Probability Theory Probability Ranking Principle Extensions 2 Basic Probability Theory For events A
More informationIntroduction to Hugin.
Introduction to Hugin. Hugin is a commercial software package which allows the user to represent Bayesian networks using a relatively straightforward set of graphical tools. Hugin is also available in
More informationPrinciples of Pattern Recognition. C. A. Murthy Machine Intelligence Unit Indian Statistical Institute Kolkata
Principles of Pattern Recognition C. A. Murthy Machine Intelligence Unit Indian Statistical Institute Kolkata e-mail: murthy@isical.ac.in Pattern Recognition Measurement Space > Feature Space >Decision
More informationAd Placement Strategies
Case Study 1: Estimating Click Probabilities Tackling an Unknown Number of Features with Sketching Machine Learning for Big Data CSE547/STAT548, University of Washington Emily Fox 2014 Emily Fox January
More informationPDF / HOW TO GET KELVIN FROM CELSIUS
31 March, 2018 PDF / HOW TO GET KELVIN FROM CELSIUS Document Filetype: PDF 271.56 KB 0 PDF / HOW TO GET KELVIN FROM CELSIUS Quick and complete temperature conversion. What is 1 Fahrenheit to. The Easy
More informationMultiple Choice Tries and Distributed Hash Tables
Multiple Choice Tries and Distributed Hash Tables Luc Devroye and Gabor Lugosi and Gahyun Park and W. Szpankowski January 3, 2007 McGill University, Montreal, Canada U. Pompeu Fabra, Barcelona, Spain U.
More informationThe PEAC-WMD Gamma Radiation Dose Calculator
The PEAC-WMD Gamma Radiation Dose Calculator During the last couple of months newsletters I ve discussed some of the new computational tools included in the PEAC-WMD 2007 (v5.5) application. This month
More informationSign Changes By Bart Hopkins Jr. READ ONLINE
Sign Changes By Bart Hopkins Jr. READ ONLINE New Treatments For Depression. Helping you find available treatments for depression and anxiety 9/22/2017 Get DeJ Loaf's "Changes" here: Sign in to make your
More informationModern Information Retrieval
Modern Information Retrieval Chapter 3 Modeling Introduction to IR Models Basic Concepts The Boolean Model Term Weighting The Vector Model Probabilistic Model Retrieval Evaluation, Modern Information Retrieval,
More information10.2: The Chi Square Test for Goodness of Fit
10.2: The Chi Square Test for Goodness of Fit We can perform a hypothesis test to determine whether the distribution of a single categorical variable is following a proposed distribution. We call this
More informationInformation Retrieval and Web Search Engines
Information Retrieval and Web Search Engines Lecture 4: Probabilistic Retrieval Models April 29, 2010 Wolf-Tilo Balke and Joachim Selke Institut für Informationssysteme Technische Universität Braunschweig
More informationIR Models: The Probabilistic Model. Lecture 8
IR Models: The Probabilistic Model Lecture 8 ' * ) ( % $ $ +#! "#! '& & Probability of Relevance? ' ', IR is an uncertain process Information need to query Documents to index terms Query terms and index
More informationOnline Supplementary Material. MetaLP: A Nonparametric Distributed Learning Framework for Small and Big Data
Online Supplementary Material MetaLP: A Nonparametric Distributed Learning Framework for Small and Big Data PI : Subhadeep Mukhopadhyay Department of Statistics, Temple University Philadelphia, Pennsylvania,
More informationCIRCUITS AND ELECTRONICS. State and Memory
6.002 RUTS AND ELETRONS State and Memory ite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 ircuits and Electronics, Spring 2007. MT OpenourseWare (http://ocw.mit.edu/), Massachusetts nstitute
More informationMy Map Activity MINNESOTA SOCIAL STUDIES STANDARDS & BENCHMARKS
My Map Activity OVERVIEW & OBJECTIVES Students will learn the basics of Google Maps while using geospatial data to create their neighborhood map with the places they spend time. They will also collect
More informationProbabilistic classification CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2016
Probabilistic classification CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2016 Topics Probabilistic approach Bayes decision theory Generative models Gaussian Bayes classifier
More informationChapter 16: Correlation
Chapter : Correlation So far We ve focused on hypothesis testing Is the relationship we observe between x and y in our sample true generally (i.e. for the population from which the sample came) Which answers
More informationSpatial Analysis using Vector GIS THE GOAL: PREPARATION:
PLAN 512 GIS FOR PLANNERS Department of Urban and Environmental Planning University of Virginia Fall 2006 Prof. David L. Phillips Spatial Analysis using Vector GIS THE GOAL: This tutorial explores some
More informationYour web browser (Safari 7) is out of date. For more security, comfort and the best experience on this site: Update your browser Ignore
Your web browser (Safari 7) is out of date. For more security, comfort and the best experience on this site: Update your browser Ignore GIS ( GEO GRAPHIC INFO RMATIO N SYSTEM) geospatial information system
More informationReductionist View: A Priori Algorithm and Vector-Space Text Retrieval. Sargur Srihari University at Buffalo The State University of New York
Reductionist View: A Priori Algorithm and Vector-Space Text Retrieval Sargur Srihari University at Buffalo The State University of New York 1 A Priori Algorithm for Association Rule Learning Association
More informationLecture 3: Probabilistic Retrieval Models
Probabilistic Retrieval Models Information Retrieval and Web Search Engines Lecture 3: Probabilistic Retrieval Models November 5 th, 2013 Wolf-Tilo Balke and Kinda El Maarry Institut für Informationssysteme
More informationThe Night Sky [Optional - only for those interested] by Michael Kran - Thursday, 2 October 2008, 03:49 PM
The Night Sky [Optional - only for those interested] by Michael Kran - Thursday, 2 October 2008, 03:49 PM A question sometimes arises: "What's up in the sky at a particular moment?" There are several ways
More informationChemical Safety Software
Chemical Safety Software www.chemicalsafety.com ENVIRONMENTAL MANAGEMENT SYSTEMS EMS DEMO USER GUIDE V. 2017 Chemical Safety Software All Rights Reserved Page 1 Contents Wel o e to Che i al Safet s EMS
More informationDecoding Revisited: Easy-Part-First & MERT. February 26, 2015
Decoding Revisited: Easy-Part-First & MERT February 26, 2015 Translating the Easy Part First? the tourism initiative addresses this for the first time the die tm:-0.19,lm:-0.4, d:0, all:-0.65 tourism touristische
More informationPoisson Chris Piech CS109, Stanford University. Piech, CS106A, Stanford University
Poisson Chris Piech CS109, Stanford University Piech, CS106A, Stanford University Probability for Extreme Weather? Piech, CS106A, Stanford University Four Prototypical Trajectories Review Binomial Random
More informationsmart reply and implicit semantics Matthew Henderson and Brian Strope Google AI
smart reply and implicit semantics Matthew Henderson and Brian Strope Google AI collaborators include: Rami Al-Rfou, Yun-hsuan Sung Laszlo Lukacs, Ruiqi Guo, Sanjiv Kumar Balint Miklos, Ray Kurzweil and
More informationExploiting Geographic Dependencies for Real Estate Appraisal
Exploiting Geographic Dependencies for Real Estate Appraisal Yanjie Fu Joint work with Hui Xiong, Yu Zheng, Yong Ge, Zhihua Zhou, Zijun Yao Rutgers, the State University of New Jersey Microsoft Research
More informationGeog 210C Spring 2011 Lab 6. Geostatistics in ArcMap
Geog 210C Spring 2011 Lab 6. Geostatistics in ArcMap Overview In this lab you will think critically about the functionality of spatial interpolation, improve your kriging skills, and learn how to use several
More informationCompact Indexes for Flexible Top-k Retrieval
Compact Indexes for Flexible Top-k Retrieval Simon Gog Matthias Petri Institute of Theoretical Informatics, Karlsruhe Institute of Technology Computing and Information Systems, The University of Melbourne
More informationComposite Quantization for Approximate Nearest Neighbor Search
Composite Quantization for Approximate Nearest Neighbor Search Jingdong Wang Lead Researcher Microsoft Research http://research.microsoft.com/~jingdw ICML 104, joint work with my interns Ting Zhang from
More information4.5 Applications of Congruences
4.5 Applications of Congruences 287 66. Find all solutions of the congruence x 2 16 (mod 105). [Hint: Find the solutions of this congruence modulo 3, modulo 5, and modulo 7, and then use the Chinese remainder
More informationGIS Functions and Integration. Tyler Pauley Associate Consultant
GIS Functions and Integration Tyler Pauley Associate Consultant Contents GIS in AgileAssets products Displaying data within AMS Symbolizing the map display Display on Bing Maps Demo- Displaying a map in
More informationMolecular Similarity Searching Using Inference Network
Molecular Similarity Searching Using Inference Network Ammar Abdo, Naomie Salim* Faculty of Computer Science & Information Systems Universiti Teknologi Malaysia Molecular Similarity Searching Search for
More informationUnivariate analysis. Simple and Multiple Regression. Univariate analysis. Simple Regression How best to summarise the data?
Univariate analysis Example - linear regression equation: y = ax + c Least squares criteria ( yobs ycalc ) = yobs ( ax + c) = minimum Simple and + = xa xc xy xa + nc = y Solve for a and c Univariate analysis
More informationThe SI system and units of measurement
The SI system and units of measurement Scientists all over the world use a single measurement system called Le Systeme International d Units, Abbreviated SI. It was adopted in 1960. Advantages of the Metric
More informationPageRank. Ryan Tibshirani /36-662: Data Mining. January Optional reading: ESL 14.10
PageRank Ryan Tibshirani 36-462/36-662: Data Mining January 24 2012 Optional reading: ESL 14.10 1 Information retrieval with the web Last time we learned about information retrieval. We learned how to
More information5 10 12 32 48 5 10 12 32 48 4 8 16 32 64 128 4 8 16 32 64 128 2 3 5 16 2 3 5 16 5 10 12 32 48 4 8 16 32 64 128 2 3 5 16 docid score 5 10 12 32 48 O'Neal averaged 15.2 points 9.2 rebounds and 1.0 assists
More information1 of 6 7/10/2013 8:32 PM
1 of 6 7/10/2013 8:32 PM 2.2Basic Differentiation Rules and Rates of Change (2047326) Question 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 1. Question Details LarCalc9 2.2.003.
More informationBuilding Inflation Tables and CER Libraries
Building Inflation Tables and CER Libraries January 2007 Presented by James K. Johnson Tecolote Research, Inc. Copyright Tecolote Research, Inc. September 2006 Abstract Building Inflation Tables and CER
More information2011 Oracle Spatial Excellence Awards Presentation
2011 Oracle Spatial Excellence Awards Presentation May 19, 2011 Ronald Reagan Building and International Trade Center Washington, DC USA Thanks to our sponsors Media Sponsor Media Participants Media Sponsor
More informationSource localization in an ocean waveguide using supervised machine learning
Source localization in an ocean waveguide using supervised machine learning Haiqiang Niu, Emma Reeves, and Peter Gerstoft Scripps Institution of Oceanography, UC San Diego Part I Localization on Noise09
More informationIntroduction to Randomized Algorithms III
Introduction to Randomized Algorithms III Joaquim Madeira Version 0.1 November 2017 U. Aveiro, November 2017 1 Overview Probabilistic counters Counting with probability 1 / 2 Counting with probability
More informationName Date Class. Figure 1. The Google Earth Pro drop-down menu.
GIS Student Walk-Through Worksheet Procedure 1. Import historical tornado and hurricane data into Google Earth Pro by following these steps: A. In the Google Earth Pro drop-down menu > click File > Import
More informationGRASP A speedy introduction
GRASP A speedy introduction thst@man..dtu.dk DTU-Management Technical University of Denmark 1 GRASP GRASP is an abbreviation for Greedy Randomized Adaptive Search Procedure. It was invented by Feo and
More informationDatabase design and implementation CMPSCI 645
Database design and implementation CMPSCI 645 Lectures 20: Probabilistic Databases *based on a tutorial by Dan Suciu Have we seen uncertainty in DB yet? } NULL values Age Height Weight 20 NULL 200 NULL
More informationThe Kestrel Handheld Weather Tracker. 1) If the unit is configured to log data and it is turned off, will it continue to log temperature data?
The Kestrel Handheld Weather Tracker 1) If the unit is configured to log data and it is turned off, will it continue to log temperature data? Wind data? 2) If you turn on the unit and it doesn t take you
More informationTutorial: Urban Trajectory Visualization. Case Studies. Ye Zhao
Case Studies Ye Zhao Use Cases We show examples of the web-based visual analytics system TrajAnalytics The case study information and videos are available at http://vis.cs.kent.edu/trajanalytics/ Porto
More informationRETRIEVAL MODELS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
RETRIEVAL MODELS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Boolean model Vector space model Probabilistic
More informationFast Approximate k-way Similarity Search. Anshumali Shrivastava. Ping Li
Beyond Pairwise: Provably Fast Algorithms for Approximate k-way Similarity Search NIPS 2013 1 Fast Approximate k-way Similarity Search Anshumali Shrivastava Dept. of Computer Science Cornell University
More informationProbabilistic Information Retrieval
Probabilistic Information Retrieval Sumit Bhatia July 16, 2009 Sumit Bhatia Probabilistic Information Retrieval 1/23 Overview 1 Information Retrieval IR Models Probability Basics 2 Document Ranking Problem
More informationLecture 5: Introduction to (Robertson/Spärck Jones) Probabilistic Retrieval
Lecture 5: Introduction to (Robertson/Spärck Jones) Probabilistic Retrieval Scribes: Ellis Weng, Andrew Owens February 11, 2010 1 Introduction In this lecture, we will introduce our second paradigm for
More informationPredicate Logic 1. The Need for Predicate Logic. The Need for Predicate Logic. The Need for Predicate Logic. The Need for Predicate Logic
Predicate Logic 1 Background to Logic Paradigm Joseph Spring School of Computer Science This Lecture We consider the following topics: The Closed World Assumption Predicates in Extension The Universal
More informationTORO SENTINEL APPLICATION NOTE AN01: ET-BASED PROGRAMMING
TORO SENTINEL APPLICATION NOTE AN01: ET-BASED PROGRAMMING Version: 12-17-2010 ET-BASED IRRIGATION IN SENTINEL Irrigating by ET: In order to irrigate by ET in Sentinel, the user has to perform a number
More informationQuick Reference Manual. Ver. 1.3
Quick Reference Manual Ver. 1.3 1 EXASITE Voyage EXSITE Voyage is a web-based communication tool designed to support the following users; Ship operators who utilize Optimum Ship Routing (OSR) service in
More informationUnderstanding Inference: Confidence Intervals I. Questions about the Assignment. The Big Picture. Statistic vs. Parameter. Statistic vs.
Questions about the Assignment If your answer is wrong, but you show your work you can get more partial credit. Understanding Inference: Confidence Intervals I parameter versus sample statistic Uncertainty
More informationAnswer Key. Name: Seventh Grade Science Teacher: Page 1
Name: Seventh Grade Science Teacher: Page 1 Different tools in the SI system all measure to different precisions It doesn t matter what tool you are using as long as you remember to always measure to the
More informationNatural Language Processing. Topics in Information Retrieval. Updated 5/10
Natural Language Processing Topics in Information Retrieval Updated 5/10 Outline Introduction to IR Design features of IR systems Evaluation measures The vector space model Latent semantic indexing Background
More informationLarge-Scale Behavioral Targeting
Large-Scale Behavioral Targeting Ye Chen, Dmitry Pavlov, John Canny ebay, Yandex, UC Berkeley (This work was conducted at Yahoo! Labs.) June 30, 2009 Chen et al. (KDD 09) Large-Scale Behavioral Targeting
More informationSection 6.2 Hypothesis Testing
Section 6.2 Hypothesis Testing GIVEN: an unknown parameter, and two mutually exclusive statements H 0 and H 1 about. The Statistician must decide either to accept H 0 or to accept H 1. This kind of problem
More informationAccount Setup. STEP 1: Create Enhanced View Account
SpyMeSatGov Access Guide - Android DigitalGlobe Imagery Enhanced View How to setup, search and download imagery from DigitalGlobe utilizing NGA s Enhanced View license Account Setup SpyMeSatGov uses a
More informationCS533 Fall 2017 HW5 Solutions. CS533 Information Retrieval Fall HW5 Solutions
CS533 Information Retrieval Fall 2017 HW5 Solutions Q1 a) For λ = 1, we select documents based on similarity Thus, d 1> d 2> d 4> d 3 Start with d 1, S = {d1} R\S = { d 2, d 4, d 3} MMR(d 2) = 0.7 Maximum.
More informationINSTRUCTION MANUAL for No. 45 Altimeter-Compass
INSTRUTION MANUAL for No. 45 Altimeter-ompass English INTRODUTION The Altimeter-ompass No. 45 is a digital product that provides altimeter, barometer, compass, altimeter data, dual time, chronograph, chronograph
More informationF-tests and Nested Models
F-tests and Nested Models Nested Models: A core concept in statistics is comparing nested s. Consider the Y = β 0 + β 1 x 1 + β 2 x 2 + ǫ. (1) The following reduced s are special cases (nested within)
More informationWe have the following immediate corollary. 1
1. Thom Spaces and Transversality Definition 1.1. Let π : E B be a real k vector bundle with a Euclidean metric and let E 1 be the set of elements of norm 1. The Thom space T (E) of E is the quotient E/E
More informationUsing Simulation and Symbolic Computing in Linear Programming
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 571 Using Simulation and Symbolic Computing in Linear Programming
More informationLecture and notes by: Alessio Guerrieri and Wei Jin Bloom filters and Hashing
Bloom filters and Hashing 1 Introduction The Bloom filter, conceived by Burton H. Bloom in 1970, is a space-efficient probabilistic data structure that is used to test whether an element is a member of
More informationarxiv: v1 [cs.ir] 11 Mar 2015
From Group Recommendations to Group Formation Senjuti Basu Roy, Laks V. S. Lakshmanan, Rui Liu. University of Washington Tacoma, University of British Columbia {senjutib,ruiliu}@uw.edu,laks@cs.ubc.ca arxiv:13.373v1
More informationProviding Public Access to King County GIS Data. Presented by: Michael Jenkins King County GIS Center Seattle, WA
Providing Public Access to King County GIS Data Presented by: Michael Jenkins King County GIS Center Seattle, WA King County, Washington Microsoft Boeing Amazon.Com Starbucks Port of Seattle Weyerhauser
More informationLecture 13: More uses of Language Models
Lecture 13: More uses of Language Models William Webber (william@williamwebber.com) COMP90042, 2014, Semester 1, Lecture 13 What we ll learn in this lecture Comparing documents, corpora using LM approaches
More informationNational Capitol Region HAZUS User Group Call. June 20, :00 AM EST
National Capitol Region HAZUS User Group Call June 20, 2013 10:00 AM EST NCR HUG Call Details Conference Call Details: 1. Dial-in: 1-267-507-0240 2. Conference code: 697620 Join the Meeting through Adobe
More informationMy Geogr aphy Glasses
My Geogr aphy Glasses Local area: places to play Paula Owens Geography teaching resource Primary Digimap for Schools Geography Resources Title: My Geography Glasses Level Context Location Primary Local
More information1. INTRODUCTION 2. QPF
440 24th Weather and Forecasting/20th Numerical Weather Prediction HUMAN IMPROVEMENT TO NUMERICAL WEATHER PREDICTION AT THE HYDROMETEOROLOGICAL PREDICTION CENTER David R. Novak, Chris Bailey, Keith Brill,
More informationAdvanced Click Models & their Applications to IR
Advanced Click Models & their Applications to IR (Afternoon block 2) Aleksandr Chuklin, Ilya Markov Maarten de Rijke a.chuklin@uva.nl i.markov@uva.nl derijke@uva.nl University of Amsterdam Google Switzerland
More informationOakland Unified School District. Worksheet To Accompany USGS Map Adventures Teaching Packet
Worksheet To Accompany USGS Map Adventures Teaching Packet Lesson 7: Map Scale Is the large map of the park the same size as the real park? Maps almost always have to be drawn smaller than the actual area
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 8 Random Walks, Matrices and PageRank Graphs
More informationDetection and Estimation Theory
ESE 524 Detection and Estimation Theory Joseph A. O Sullivan Samuel C. Sachs Professor Electronic Systems and Signals Research Laboratory Electrical and Systems Engineering Washington University 2 Urbauer
More informationAditya Bhaskara CS 5968/6968, Lecture 1: Introduction and Review 12 January 2016
Lecture 1: Introduction and Review We begin with a short introduction to the course, and logistics. We then survey some basics about approximation algorithms and probability. We also introduce some of
More informationStatistical Machine Translation. Part III: Search Problem. Complexity issues. DP beam-search: with single and multi-stacks
Statistical Machine Translation Marcello Federico FBK-irst Trento, Italy Galileo Galilei PhD School - University of Pisa Pisa, 7-19 May 008 Part III: Search Problem 1 Complexity issues A search: with single
More informationA Gentle Introduction to Gradient Boosting. Cheng Li College of Computer and Information Science Northeastern University
A Gentle Introduction to Gradient Boosting Cheng Li chengli@ccs.neu.edu College of Computer and Information Science Northeastern University Gradient Boosting a powerful machine learning algorithm it can
More information