6/2/2015 1 An Automatic Personalized Context- Aware Event Notification System for Mobile Users George Lee User Context-based Service Control Group Network.

Slides:



Advertisements
Similar presentations
Recommender Systems & Collaborative Filtering
Advertisements

Content-based Recommendation Systems
Context-Sensitive Query Auto-Completion AUTHORS:NAAMA KRAUS AND ZIV BAR-YOSSEF DATE OF PUBLICATION:NOVEMBER 2010 SPEAKER:RISHU GUPTA 1.
Distributed Advice-Seeking on an Evolving Social Network Dept Computer Science and Software Engineering The University of Melbourne - Australia Golriz.
Our purpose Giving a query on the Web, how can we find the most authoritative (relevant) pages?
Context-aware Query Suggestion by Mining Click-through and Session Data Authors: H. Cao et.al KDD 08 Presented by Shize Su 1.
Data Mining Techniques Cluster Analysis Induction Neural Networks OLAP Data Visualization.
George Lee User Context-based Service Control Group
0 General information Rate of acceptance 37% Papers from 15 Countries and 5 Geographical Areas –North America 5 –South America 2 –Europe 20 –Asia 2 –Australia.
Recommender Systems Aalap Kohojkar Yang Liu Zhan Shi March 31, 2008.
Information Retrieval in Practice
T.Sharon - A.Frank 1 Internet Resources Discovery (IRD) Classic Information Retrieval (IR)
Selective Dissemination of Streaming XML By Hyun Jin Moon, Hetal Thakkar.
ADVISE: Advanced Digital Video Information Segmentation Engine
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Carnegie Mellon University Complex queries in distributed publish- subscribe systems Ashwin R. Bharambe, Justin Weisz and Srinivasan Seshan.
Mobile Web Search Personalization Kapil Goenka. Outline Introduction & Background Methodology Evaluation Future Work Conclusion.
Modern Information Retrieval Chapter 2 Modeling. Can keywords be used to represent a document or a query? keywords as query and matching as query processing.
Recommender systems Ram Akella February 23, 2011 Lecture 6b, i290 & 280I University of California at Berkeley Silicon Valley Center/SC.
Recommender systems Ram Akella November 26 th 2008.
Interface for the University Library Catalogue Implementing Direct Manipulation Proposal 4.
Personalized Ontologies for Web Search and Caching Susan Gauch Information and Telecommunications Technology Center Electrical Engineering and Computer.
Overview of Search Engines
Technische Universität München Context-Aware Recommendations in Decentralized, Item-Based Collaborative Filtering on Mobile Devices Wolfgang Woerndl, Henrik.
Architecture Tutorial Overview of Today’s Talks Provenance Data Structures Recording and Querying Provenance –Break (30 minutes) Distribution and Scalability.
The 2nd International Conference of e-Learning and Distance Education, 21 to 23 February 2011, Riyadh, Saudi Arabia Prof. Dr. Torky Sultan Faculty of Computers.
Mark Levene, An Introduction to Search Engines and Web Navigation © Pearson Education Limited 2005 Slide 9.1 Chapter 9 : Social Networks What is a social.
Personalization in Local Search Personalization of Content Ranking in the Context of Local Search Philip O’Brien, Xiao Luo, Tony Abou-Assaleh, Weizheng.
SensIT PI Meeting, January 15-17, Self-Organizing Sensor Networks: Efficient Distributed Mechanisms Alvin S. Lim Computer Science and Software Engineering.
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Recommendation system MOPSI project KAROL WAGA
Chapter 2 Architecture of a Search Engine. Search Engine Architecture n A software architecture consists of software components, the interfaces provided.
Query Routing in Peer-to-Peer Web Search Engine Speaker: Pavel Serdyukov Supervisors: Gerhard Weikum Christian Zimmer Matthias Bender International Max.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
UOS 1 Ontology Based Personalized Search Zhang Tao The University of Seoul.
1 Evaluating top-k Queries over Web-Accessible Databases Paper By: Amelie Marian, Nicolas Bruno, Luis Gravano Presented By Bhushan Chaudhari University.
When Experts Agree: Using Non-Affiliated Experts To Rank Popular Topics Meital Aizen.
Sunilkumar S. Manvi and P. Venkataram Protocol Engineering and Technology Unit, ECE Dept. Indian Institute of Science Bangalore, , INDIA
A Recommendation System for Software Function Discovery Naoki Ohsugi Software Engineering Laboratory, Graduate School of Information Science, Nara Institute.
Proposal for Term Project J. H. Wang Mar. 2, 2015.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Wang-Chien Lee i Pervasive Data Access ( i PDA) Group Pennsylvania State University Mining Social Network Big Data Intelligent.
RCDL Conference, Petrozavodsk, Russia Context-Based Retrieval in Digital Libraries: Approach and Technological Framework Kurt Sandkuhl, Alexander Smirnov,
Google News Personalization: Scalable Online Collaborative Filtering
ICPP 2012 Indexing and Parallel Query Processing Support for Visualizing Climate Datasets Yu Su*, Gagan Agrawal*, Jonathan Woodring † *The Ohio State University.
Online Learning for Collaborative Filtering
Distributed Information Retrieval Server Ranking for Distributed Text Retrieval Systems on the Internet B. Yuwono and D. Lee Siemens TREC-4 Report: Further.
Parallel and Distributed Searching. Lecture Objectives Review Boolean Searching Indicate how Searches may be carried out in parallel Overview Distributed.
Personalized Course Navigation Based on Grey Relational Analysis Han-Ming Lee, Chi-Chun Huang, Tzu- Ting Kao (Dept. of Computer Science and Information.
Personalized Interaction With Semantic Information Portals Eric Schwarzkopf DFKI
Agents that Reduce Work and Information Overload and Beyond Intelligent Interfaces Presented by Maulik Oza Department of Information and Computer Science.
Advanced Software Engineering PROJECT November 2015.
Threshold Setting and Performance Monitoring for Novel Text Mining Wenyin Tang and Flora S. Tsai School of Electrical and Electronic Engineering Nanyang.
Collaborative Filtering via Euclidean Embedding M. Khoshneshin and W. Street Proc. of ACM RecSys, pp , 2010.
03/02/20061 Evaluating Top-k Queries Over Web-Accessible Databases Amelie Marian Nicolas Bruno Luis Gravano Presented By: Archana and Muhammed.
1 An infrastructure for context-awareness based on first order logic 송지수 ISI LAB.
KMS & Collaborative Filtering Why CF in KMS? CF is the first type of application to leverage tacit knowledge People-centric view of data Preferences matter.
Text Information Management ChengXiang Zhai, Tao Tao, Xuehua Shen, Hui Fang, Azadeh Shakery, Jing Jiang.
CiteData: A New Multi-Faceted Dataset for Evaluating Personalized Search Performance CIKM’10 Advisor : Jia-Ling, Koh Speaker : Po-Hsien, Shih.
哈工大信息检索研究室 HITIR ’ s Update Summary at TAC2008 Extractive Content Selection Using Evolutionary Manifold-ranking and Spectral Clustering Reporter: Ph.d.
Smart Web Search Agents Data Search Engines >> Information Search Agents - Traditional searching on the Web is done using one of the following three: -
September 2003, 7 th EDG Conference, Heidelberg – Roberta Faggian, CERN/IT CERN – European Organization for Nuclear Research The GRACE Project GRid enabled.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
1 Dongheng Sun 04/26/2011 Learning with Matrix Factorizations By Nathan Srebro.
Overview Issues in Mobile Databases – Data management – Transaction management Mobile Databases and Information Retrieval.
User Modeling for Personal Assistant
Recommender Systems & Collaborative Filtering
Proposal for Term Project
Augmenting (personal) IR
Author: Kazunari Sugiyama, etc. (WWW2004)
Presentation transcript:

6/2/ An Automatic Personalized Context- Aware Event Notification System for Mobile Users George Lee User Context-based Service Control Group Network Laboratories NTT DoCoMo R&D

6/2/ Overview The Problem: Mobile users cannot easily get desired information Proposed solution: automatic, personalized, context-aware event notification approach – Matching Engine to match users and events – User Agent to learn user interests

6/2/ Mobile users can’t easily get relevant information Relevant information is: – Appropriate for their context – Personalized based on individual interests – Current and up-to-date Static menu is inadequate – Too many choices – Difficult to navigate – Not personalized or context-aware Information retrieval has drawbacks – Requires queries – Not good for new or changing information

6/2/ MIT News CSAIL News The Tech Boston Dining News Italian Restaurants … Central Sq. Sports Red Sox Scores … Automatic, personalized, context- aware event notification Context: Going to lab CSAIL News: Talk at 3pm G825 Central Sq. Dining: New café opening Red Sox vs. Yankees: 4-3 (6 th inning) Mobile Handset 1.Automatic 2.Personalized 3.Context-aware 1. Learning user interests 2. Efficiently matching events to users 3. Determining user context

6/2/ Event Matching events and learning user interests User Event Matching Engine User Agent User input Event description User interests User Agent automatically learns user interests for the current context based on user input Matching Engine decides which users match an event based on event descriptions and user preferences

6/2/ Describing events and user interests using an event model User Interests Topic Weather Major League Baseball Location Boston User Interests Topic Yankees Train schedules Location New York Event Description Topic Yankees Red Sox Location USA matches Events and user interests are described and matched according to an Event Model Problem: existing event notification systems do not work well with complex event models

6/2/ Choosing an appropriate event model: expressiveness vs. efficiency Expressiveness Matching Speed Flat (e.g. Mailing lists) Content-based (e.g. XPath) Hierarchical (e.g. Newsgroups) Graph-structured (e.g. Yahoo!) Can we improve the matching efficiency of graph-structured event models?

6/2/ Regular matching Event topic: “Red Sox” Matches all users with “Red Sox” as a subtopic in their interests: – (Red Sox, Boston Sports, Baseball, Sports, and All) Sports Baseball Red SoxYankees All … … Boston Sports … Event Topic: Red Sox Must search graph to find related topics

6/2/ Optimized matching Compute a table of all supertopics of each topic (transitive closure) Sports Baseball Red SoxYankees All … … Boston Sports … Event Topic: Red Sox Gets all related topics in one table lookup

6/2/ Evaluation of efficient matching Objective: Evaluate optimized matching with many users and a complex event model Event Model – Topic: Open Directory Project (ODP) – Location: Getty Thesaurus of Geographic Names (TGN) – 44,506 topics, 6905 locations Simulated users – 100 to 100,000 users – Interests include 5 topics and 3 locations Simulated events – Contain 3 random topics and 2 random locations

6/2/ Efficient: Optimized matching is 30 times faster than unoptimized matching Expressive: Works well with complex event models with 45,000 topics and 7000 locations Scalable: Can match 10,000 users in less than 10 seconds

6/2/ Event A user agent for learning user interests User User Agent automatically learns user interests for the current context based on user input Event Matching Engine User Agent User input Event description User interests Context Server Challenges: 1.Implicitly learning user interests 2.Recommending topics in new contexts

6/2/ User Agent Mobile Handset Learning and automatically updating user interests Event List Topic 1 Topic 2 Topic 3 Topic Rating Learner Selected Topics User Interests Matched events Matching Engine Context Server Topic Recommender Automatically recommends new topics based on ratings of past topics Implicitly learns user ratings for topics based on user selections

6/2/ Recommending topics Recommendations needed for new topics and contexts Possible approaches: – Popularity: not personalized – Rating History: recommendations based on previous topic ratings – Collaborative Filtering (CF): recommendations based on interests of users with similar interests

6/2/ Context-aware Collaborative Filtering User X User A User D Is User X interested in “MIT News” for context “Go to lab”? User C Yes User B To calculate a recommendation for topic T in context C: 1. Find users who have rated topic T under context C 2. Find users with similar interests 3. Decide whether to recommend topic T based on ratings of similar users

6/2/ Enhanced Context-aware Collaborative Filtering Is User X interested in “MIT News” for context “Go to lab”? User X User A User D Yes Model relationships between topics and contexts when calculating user similarity Give greater weight to similar topics and contexts (e.g. give greater weight to same topic and same context)

6/2/ Recommender Evaluation Evaluate ability of Enhanced CF to provide relevant information in a new context User Interface: app on mobile handset 16 test subjects – 8 for data collection – 8 for evaluation 50 topics based on i-mode services 2 contexts – Going to see a movie in Tokyo – Going to Tokyo Disneyland 10 topics per recommender Interleave topics from two recommenders and observe which topics users selected – vs. Random – vs. Rating History – vs. Regular CF Mobile Handset Event List Topic 1A Topic 1B Topic 2A Topic 2B Topic 3A Topic 3B Recommender ARecommender B

6/2/ Effective: Enhanced CF can recommend relevant topics in new contexts Compared to other approaches, enhanced CF topics selected – 413% more than Random topics – 49.7% more than Rating History topics – 24.8% more than Regular CF topics More studies needed to increase confidence

6/2/ Conclusion I proposed an event notification system for mobile users – Automatic – Personalized – Context-aware Research contributions – Optimized content-graph event matching algorithm – Enhanced context-aware collaborative filtering topic recommender Future work – Distributed architectures – Learning and recommendation algorithms – Context models – User studies