ValuePick : Towards a Value-Oriented Dual-Goal Recommender System Leman Akoglu Christos Faloutsos OEDM in conjunction with ICDM 2010 Sydney, Australia.

Slides:



Advertisements
Similar presentations
Supporting Cooperative Caching in Disruption Tolerant Networks
Advertisements

Complex Land Valuation in current times Short review of the methods.
RecMax – Can we combine the power of Social Networks and Recommender Systems? Amit Goyal and L. RecMax: Exploting Recommender Systems for Fun and Profit.
1 © Aberdeen Group 2013 – Not For Distribution ™ Meeting the Rising Challenge of Modern Networks.
November 5, 2007 ACM WEASEL Tech Efficient Time-Aware Prioritization with Knapsack Solvers Sara Alspaugh Kristen R. Walcott Mary Lou Soffa University of.
Active Learning and Collaborative Filtering
Maggie Zhou COMP 790 Data Mining Seminar, Spring 2011
Neighborhood Formation and Anomaly Detection in Bipartite Graphs Jimeng Sun Huiming Qu Deepayan Chakrabarti Christos Faloutsos Speaker: Jimeng Sun.
The Rational Decision-Making Process
Retrieval Evaluation. Brief Review Evaluation of implementations in computer science often is in terms of time and space complexity. With large document.
SCS CMU Proximity Tracking on Time- Evolving Bipartite Graphs Speaker: Hanghang Tong Joint Work with Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos.
1 Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques Huseyin Polat and Wenliang (Kevin) Du Department of EECS Syracuse.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
+ Doing More with Less : Student Modeling and Performance Prediction with Reduced Content Models Yun Huang, University of Pittsburgh Yanbo Xu, Carnegie.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
RecMax: Exploiting Recommender Systems for Fun and Profit RecMax – Recommendation Maximization Previous research in Recommender Systems mostly focused.
IE 594 : Research Methodology – Discrete Event Simulation David S. Kim Spring 2009.
Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.
Optimal Stopping of the Context Collection Process in Mobile Sensor Networks Christos Anagnostopoulos 1, Stathes Hadjiefthymiades 2, Evangelos Zervas 3.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
DEXA 2005 Quality-Aware Replication of Multimedia Data Yicheng Tu, Jingfeng Yan and Sunil Prabhakar Department of Computer Sciences, Purdue University.
MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.
A Comparative Study of Search Result Diversification Methods Wei Zheng and Hui Fang University of Delaware, Newark DE 19716, USA
Consensus-based Distributed Estimation in Camera Networks - A. T. Kamal, J. A. Farrell, A. K. Roy-Chowdhury University of California, Riverside
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
Two Approaches to Calculating Correlated Reserve Indications Across Multiple Lines of Business Gerald Kirschner Classic Solutions Casualty Loss Reserve.
Recursion and Dynamic Programming. Recursive thinking… Recursion is a method where the solution to a problem depends on solutions to smaller instances.
Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.
Interconnect Performance Modeling. Performance modeling Given an interconnect topology, routing, and other parameters, predict the interconnect performance.
1 Background A new class of continuous factor (C-Factor) models have been proposed as a parsimonious alternative to HB for conjoint and choice modeling.
Approximation Algorithms for Knapsack Problems 1 Tsvi Kopelowitz Modified by Ariel Rosenfeld.
A Graph-based Friend Recommendation System Using Genetic Algorithm
MAP: Multi-Auctioneer Progressive Auction in Dynamic Spectrum Access Lin Gao, Youyun Xu, Xinbing Wang Shanghai Jiaotong University.
1 Exploring Custom Instruction Synthesis for Application-Specific Instruction Set Processors with Multiple Design Objectives Lin, Hai Fei, Yunsi ACM/IEEE.
Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim
Performance Analysis of Bayesian Networks-based Distributed Call Admission Control for NGN Abul Bashar, College of Computer Engineering.
P-Rank: A Comprehensive Structural Similarity Measure over Information Networks CIKM’ 09 November 3 rd, 2009, Hong Kong Peixiang Zhao, Jiawei Han, Yizhou.
Efficient Instant-Fuzzy Search with Proximity Ranking Authors: Inci Centidil, Jamshid Esmaelnezhad, Taewoo Kim, and Chen Li IDCE Conference 2014 Presented.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Downlink Scheduling With Economic Considerations to Future Wireless Networks Bader Al-Manthari, Nidal Nasser, and Hossam Hassanein IEEE Transactions on.
1 Panther: Fast Top-K Similarity Search on Large Networks Jing Zhang 1, Jie Tang 1, Cong Ma 1, Hanghang Tong 2, Yu Jing 1, and Juanzi Li 1 1 Department.
Hanghang Tong, Brian Gallagher, Christos Faloutsos, Tina Eliassi-Rad
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Supporting Top-k join Queries in Relational Databases Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid Presented by: Z. Joseph, CSE-UT Arlington.
1 Branch and Bound Searching Strategies Updated: 12/27/2010.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Tetris Agent Optimization Using Harmony Search Algorithm
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
Opportunistic Service Centric Scheduling with Strict Deadlines DAVID RAMIREZ 26/JAN/
1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.
Kijung Shin Jinhong Jung Lee Sael U Kang
Multicasting in delay tolerant networks a social network perspective networks October2012 In-Seok Kang
Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Experimental Study on Item-based P-Tree Collaborative Filtering for Netflix Prize.
Load Balancing : The Goal Given a collection of tasks comprising a computation and a set of computers on which these tasks may be executed, find the mapping.
Paper Presentation Social influence based clustering of heterogeneous information networks Qiwei Bao & Siqi Huang.
The following principles must be kept in mind while formulating models.  PRINCIPLE OF SIMPLICITY Mathematicians are of the habit of making complex models.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
Greedy & Heuristic algorithms in Influence Maximization
Privacy Preserving Subgraph Matching on Large Graphs in Cloud
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
Jinhong Jung, Woojung Jin, Lee Sael, U Kang, ICDM ‘16
by Xiang Mao and Qin Chen
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Branch and Bound Searching Strategies
Presentation transcript:

ValuePick : Towards a Value-Oriented Dual-Goal Recommender System Leman Akoglu Christos Faloutsos OEDM in conjunction with ICDM 2010 Sydney, Australia

Recommender Systems Traditional recommender systems try to achieve high user satisfaction 2 of 19

Dual-goal Recommender Systems Dual-goal recommender systems try to achieve (1) high user satisfaction as well as (2) high-“value” vendor gain -“value” Trade-off user satisfaction vs. vendor profit 3 of 19

vertices ranked by proximity v253 v162 v261 v Dual-goal Recommender Systems network-“value” 4 of 19 query vertex

v253 v162 v261 v Dual-goal Recommender Systems vertices ranked by proximity network-“value” 5 of 19

Dual-goal Recommender Systems v253 v162 v261 v network-“value” vertices ranked by proximity network-“value” Trade-off user satisfaction vs. network connectivity 6 of 19

Vendor Main concerns:  We cannot make the highest value recommendations  Recommendations should still reflect users’ likes relatively well Dual-goal Recommender Systems 7 of 19 User

Vendor Carefully perturb (change the order of) the proximity-ranked list of recommendations Controlled by a tolerance for each user ValuePick: Main idea ζ ζ 8 of 19

ValuePick Optimization Framework “value” proximity Total expected gain (assuming proximity ~ acceptance prob.) tolerance [0,1] average proximity score of original top-k 9 of 19 DETAILS

ValuePick ~ 0-1 Knapsack value maximum weight W allowed weight of item i We use CPLEX to solve our integer programming optimization problem 10 of 19 DETAILS

Pros and Cons of ValuePick Cons: In marketing, it is hard to predict the effect of an intervention in the marketing scheme, i.e., not clear how users will respond to ‘adjustments’ Pros:  Tolerance ζ can flexibly (and even dynamically) control the `level-of-adjustment’  Users rate same item differently at different times, i.e., users have natural variability in their decisions. 11 of 19

Experimental Setup I Two real networks  Netscience – collaboration network  DBLP – co-authorship network Four recommendation schemes: 1) No Gain Optimization (ζ = 0) 2) ValuePick (ζ = 0.01, ζ = 0.02) 3) Max Gain Optimization (ζ = 1) 4) Random “value” is centrality 12 of 19

Experimental Setup II Given a recommendation scheme s At each step T  For each node i Make a set K of recommendations to node i using s Node i links to node jK with prob. proximity( i, j )  Re-compute proximity and centrality scores Simulation steps: We use k =5 and T =30 13 of 19

Comparison of schemes ValuePick provides a balance between user satisfaction (high E), and vendor gain (small diameter). EXPERIMENTS 14 of 19

Recommend by heuristic Simple perturbation heuristics do not balance user satisfaction and vendor gain properly. EXPERIMENTS 15 of 19

Computational complexity EXPERIMENTS 16 of 19 Making k ValuePick recommendations to a given node involves: 1 - finding PPR scores O(#edges) 2 - solving ValuePick optimization w/ CPLEX 1/10 sec. to solve among top 1K nodes

Conclusions Problem formulation: incorporate the “value” of recommendations into the system Design of ValuePick :  parsimonious  single parameter ζ  flexible  adjust ζ for each user dynamically  general  use any “value” metric Performance study :  experiments to show proper trade of user acceptance in exchange for higher gain  CPLEX with fast solutions 17 of 19

User Vendor ζ THANK YOU 18 of 19