Learning to Question: Leveraging User Preferences for Shopping Advice

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advanced Piloting Cruise Plot.
Kapitel 21 Astronomie Autor: Bennett et al. Galaxienentwicklung Kapitel 21 Galaxienentwicklung © Pearson Studium 2010 Folie: 1.
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Chapter 1 Image Slides Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Determine Eligibility Chapter 4. Determine Eligibility 4-2 Objectives Search for Customer on database Enter application signed date and eligibility determination.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
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.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chien Lee VLDB 07 Approaching the Skyline in Z Order 1.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
1 of Audience Survey Results Larry D. Gustke, Ph.D. – October 5, 2013.
ABC Technology Project
Megastore: Providing Scalable, Highly Available Storage for Interactive Services. Presented by: Hanan Hamdan Supervised by: Dr. Amer Badarneh 1.
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
VOORBLAD.
Quadratic Inequalities
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Identifying Our Own Style Extended DISC ® Personal Analysis.
Squares and Square Root WALK. Solve each problem REVIEW:
Energy & Green Urbanism Markku Lappalainen Aalto University.
Do you have the Maths Factor?. Maths Can you beat this term’s Maths Challenge?
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Chapter 5 Test Review Sections 5-1 through 5-4.
SIMOCODE-DP Software.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
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
Januar MDMDFSSMDMDFSSS
Week 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
How Cells Obtain Energy from Food
Chapter 30 Induction and Inductance In this chapter we will study the following topics: -Faraday’s law of induction -Lenz’s rule -Electric field induced.
Learning to Recommend Questions Based on User Ratings Ke Sun, Yunbo Cao, Xinying Song, Young-In Song, Xiaolong Wang and Chin-Yew Lin. In Proceeding of.
Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search Date: 2014/03/25 Author: Taifeng Wang, Jiang Bian, Shusen.
Traktor- og motorlære Kapitel 1 1 Kopiering forbudt.
Davide Mottin, Senjuti Basu Roy, Alice Marascu, Yannis Velegrakis, Themis Palpanas, Gautam Das A Probabilistic Optimization Framework for the Empty-Answer.
Learning to Question: Leveraging User Preferences for Shopping Advice Author : Mahashweta Das, Aristides Gionis, Gianmarco De Francisci Morales, and Ingmar.
Presentation transcript:

Learning to Question: Leveraging User Preferences for Shopping Advice Date : 2013/12/11 Author : Mahashweta Das, Aristides Gionis, Gianmarco De Francisci Morales, and Ingmar Weber Source : KDD’13 Advisor : Jia-ling Koh Speaker : Yi-hsuan Yeh

Outline Introduction Method Experiments Conclusion

Introduction Motivation Customers shop online, from their homes, without any human interaction involved. Catalogs of online shops are so big and with so many continuous updates that no human, however expert, can effectively comprehend the space of available products. Use a flowchart asks the shopper a question, and the sequence of answers leads the shopper to the suggested shopping option.

Introduction SHOPPINGADVISOR is a novel recommender system that helps users in shopping for technical products. car

Introduction SHOPPINGADVISOR generates a tree-shaped flowchart, in which the internal nodes of the tree contain questions involve only attributes from the user space. non-expert users can understand easily.

Introduction Find the best user attribute to ask at each node. How to learn the structure of the tree, i.e., which questions to ask at each node. Find the best user attribute to ask at each node. This paper focus on identifying the attribute of interest, and not on the task of formulating the question in a human interpretable way. How to produce a suitable ranking at each node. Learning-to-rank approach

Outline Introduction Method Experiments Conclusion LEARNSATREE algorithm Experiments Conclusion

LEARNSATREE algorithm Table U (user) attributes users Table P (product) Table R (review)

User attributes Car (from Yahoo! Autos) Camera (form Flickr) Ex:fuel economy, comfortable interior, stylish exterior Camera (form Flickr) Photo’s tag topic Ex:food topic (tags:fruit, market)

Problem definition Build tree Rank products node 𝑞 A user attribute 𝛼 Top-k list of product recommendations

Learning product rankings RANKSVM Goal:Learn a weight vector 𝑤= 𝑤 1 , …, 𝑤 𝑚𝑝 for the 𝑚 𝑝 technical attributes of the products 𝑃 A > B B > C B > D . RANKSVM model A B D C features Product’s technical attributes

a1 a2 a3 a4 a5 Product A 1 Product B 𝑤= 0.2, 0.1, 0.5, 0.1, 0.1 rank(A) =0.2+0+0.5+0.1+0.1=0.9 rank(B) =0.2+0+0+0.1+0=0.3

Learning the tree structure Goal:determine the best user attribute “𝛼” to split 𝑈 𝑞 at node 𝑞 𝑠𝑢𝑚

𝑝 1 𝑝 2 𝑝 3 𝑝 1 𝑝 3 𝑝 2 Example: Correctly-rank: 𝑝 1 > 𝑝 2 >𝑝 3 System result System result eval(rank) = 2∗3 3∗(3−1) =1 eval(rank) = 2∗2 3∗(3−1) =0.66 𝑝 1 𝑝 2 𝑝 3 𝑝 1 𝑝 3 𝑝 2 ( 𝑝 1 , 𝑝 2 ), ( 𝑝 1 , 𝑝 3 ), ( 𝑝 2 , 𝑝 3 ) ( 𝑝 1 , 𝑝 3 ), ( 𝑝 1 , 𝑝 2 ), ( 𝑝 3 , 𝑝 2 )

user attribute 𝛼 𝑈 𝑞 𝛼 𝑈 𝑞 𝛼 Review table 𝑅 node 𝑞 split user 𝑈 𝑞

Rank list RANKSVM Count payoff product A B D C . F E Rank list RANKSVM Count payoff Consider all possible user attributes 𝛼, and choose as splitter the one that maximizes the pay-off.

Stopping criterion Grow the tree to its “entirety” Post-pruning If a node’s child node is split by the “near-synonomous” tag trim the child node Example: travel vacation Employ pruning rules on the validation set.

Outline Introduction Method Experiments Conclusion

Datasets Car datasets Camera datasets Synthetic datasets Yahoo! Autos 606 cars, 60 attributes 2180 reviews 2180 user, 15 tags (as attributes) Ex:fuel economy, comfortable interior, stylish exterior Camera datasets Flickr tags 645 cameras (CNET) 11468 reviews 5647 user, 25 topic tags (as attributes) Ex:food topic (tags:fruit, market) Synthetic datasets 200 products, 4000 comments, 1000 users

Experiment setup SHOPPINGADVISOR RANKSVM k-NN SA.k-NN Author’s method The ranked list returned by SHOPPINGADVISOR at the root k-NN k-nearest neighbors algorithm SA.k-NN Features are selected from SHOPPINGADVISOR

Quality evaluation A B D 25 topics 12 topics . System result ranking list average MRR If user prefer “B”  1 𝑟𝑎𝑛𝑘 𝑖 = 1 2

Performance evaluation

Outline Introduction Method Experiments Conclusion

Conclusion Proposed a novel recommender system, SHOPPINGADVISOR, that helps users to shop for technical products. SHOPPINGADVISOR leverages both user preferences and technical product attributes in order to generate its suggestions. At each node, SHOPPINGADVISOR suggests a ranking of products matching the preferences of the user. Compared with a baseline, and demonstrated the effectiveness of the approach.