Friends and Locations Recommendation with the use of LBSN By EKUNDAYO OLUFEMI ADEOLA 27.02.2014.

Slides:



Advertisements
Similar presentations
15th CTI Workshop, July 26, Smart Itinerary Recommendation based on User-Generated GPS Trajectories Hyoseok Yoon 1, Y. Zheng 2, X. Xie 2 and W.
Advertisements

Vincent W. Zheng, Yu Zheng, Xing Xie, Qiang Yang Hong Kong University of Science and Technology Microsoft Research Asia This work was done when Vincent.
Location-Based Social Networks Yu Zheng and Xing Xie Microsoft Research Asia Chapter 8 and 9 of the book Computing with Spatial Trajectories.
Mining User Similarity Based on Location History Yu Zheng, Quannan Li, Xing Xie Microsoft Research Asia.
Indexing DNA Sequences Using q-Grams
5.4 Basis And Dimension.
Urban Computing with Taxicabs
Clustering.
Hongliang Li, Senior Member, IEEE, Linfeng Xu, Member, IEEE, and Guanghui Liu Face Hallucination via Similarity Constraints.
Dimensionality Reduction PCA -- SVD
Computing a tree Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
Learning Location Correlation From GPS Trajectories Yu Zheng Microsoft Research Asia March 16, 2010.
Data Mining Techniques: Clustering
Geographical and Temporal Similarity Measurement in Location-based Social Networks Chongqing University of Posts and Telecommunications KTH – Royal Institute.
Constructing Popular Routes from Uncertain Trajectories Authors of Paper: Ling-Yin Wei (National Chiao Tung University, Hsinchu) Yu Zheng (Microsoft Research.
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
Introduction to Information Retrieval (Manning, Raghavan, Schutze) Chapter 6 Scoring term weighting and the vector space model.
Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Yu Zheng, Lizhu Zhang, Xing Xie, Wei-Ying Ma Microsoft Research Asia
Query Operations: Automatic Local Analysis. Introduction Difficulty of formulating user queries –Insufficient knowledge of the collection –Insufficient.
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Probabilistic Information Retrieval.
Mining Interesting Locations and Travel Sequences from GPS Trajectories defense by Alok Rakkhit.
1 CS 430 / INFO 430 Information Retrieval Lecture 3 Vector Methods 1.
1 A DATA MINING APPROACH FOR LOCATION PREDICTION IN MOBILE ENVIRONMENTS* by Gökhan Yavaş Feb 22, 2005 *: To appear in Data and Knowledge Engineering, Elsevier.
Mining Interesting Locations and Travel Sequences From GPS Trajectories Yu Zheng and Xing Xie Microsoft Research Asia March 16, 2009.
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
Friends and Locations Recommendation with the use of LBSN
 Clustering of Web Documents Jinfeng Chen. Zhong Su, Qiang Yang, HongHiang Zhang, Xiaowei Xu and Yuhen Hu, Correlation- based Document Clustering using.
Guiding Motif Discovery by Iterative Pattern Refinement Zhiping Wang, Mehmet Dalkilic, Sun Kim School of Informatics, Indiana University.
Mining Interesting Locations and Travel Sequences from GPS Trajectories IDB & IDS Lab. Seminar Summer 2009 강 민 석강 민 석 July 23 rd,
Recommendation system MOPSI project KAROL WAGA
Glasgow 02/02/04 NN k networks for content-based image retrieval Daniel Heesch.
1 University of Palestine Topics In CIS ITBS 3202 Ms. Eman Alajrami 2 nd Semester
Wang-Chien Lee i Pervasive Data Access ( i PDA) Group Pennsylvania State University Mining Social Network Big Data Intelligent.
Spatial-Temporal Models in Location Prediction Jingjing Wang 03/29/12.
Term Frequency. Term frequency Two factors: – A term that appears just once in a document is probably not as significant as a term that appears a number.
Learning Geographical Preferences for Point-of-Interest Recommendation Author(s): Bin Liu Yanjie Fu, Zijun Yao, Hui Xiong [KDD-2013]
Wei Feng , Jiawei Han, Jianyong Wang , Charu Aggarwal , Jianbin Huang
Ranking in Information Retrieval Systems Prepared by: Mariam John CSE /23/2006.
SINGULAR VALUE DECOMPOSITION (SVD)
Improving Web Search Results Using Affinity Graph Benyu Zhang, Hua Li, Yi Liu, Lei Ji, Wensi Xi, Weiguo Fan, Zheng Chen, Wei-Ying Ma Microsoft Research.
Enhancing Cluster Labeling Using Wikipedia David Carmel, Haggai Roitman, Naama Zwerdling IBM Research Lab (SIGIR’09) Date: 11/09/2009 Speaker: Cho, Chin.
Semantic Wordfication of Document Collections Presenter: Yingyu Wu.
Answering Similar Region Search Queries Chang Sheng, Yu Zheng.
Algorithmic Detection of Semantic Similarity WWW 2005.
Spatial Analysis of Crime Data: A Case Study Mike Tischler Presented by Arnold Boedihardjo.
DOCUMENT UPDATE SUMMARIZATION USING INCREMENTAL HIERARCHICAL CLUSTERING CIKM’10 (DINGDING WANG, TAO LI) Advisor: Koh, Jia-Ling Presenter: Nonhlanhla Shongwe.
2005/12/021 Content-Based Image Retrieval Using Grey Relational Analysis Dept. of Computer Engineering Tatung University Presenter: Tienwei Tsai ( 蔡殿偉.
Intelligent DataBase System Lab, NCKU, Taiwan Josh Jia-Ching Ying 1, Wang-Chien Lee 2, Tz-Chiao Weng 1 and Vincent S. Tseng 1 1 Department of Computer.
Trajectory Data Mining Dr. Yu Zheng Lead Researcher, Microsoft Research Chair Professor at Shanghai Jiao Tong University Editor-in-Chief of ACM Trans.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
1 CS 430: Information Discovery Lecture 5 Ranking.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Detecting Remote Evolutionary Relationships among Proteins by Large-Scale Semantic Embedding Xu Linhe 14S
Location-based Social Networks 6/11/20161 CENG 770.
Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods.
INFORMATION RETRIEVAL MEASUREMENT OF RELEVANCE EFFECTIVENESS 1Adrienn Skrop.
IR 6 Scoring, term weighting and the vector space model.
Multinomial Regression and the Softmax Activation Function Gary Cottrell.
Diversified Trajectory Pattern Ranking in Geo-Tagged Social Media
Mining User Similarity from Semantic Trajectories
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
Representation of documents and queries
CS 430: Information Discovery
Topic 5: Cluster Analysis
Topological Signatures For Fast Mobility Analysis
Conceptual grounding Nisheeth 26th March 2019.
Topic: Semantic Text Mining
Presentation transcript:

Friends and Locations Recommendation with the use of LBSN By EKUNDAYO OLUFEMI ADEOLA

Outline Understanding Users Users routine activities minning Semantic location history User similarities calculation Travel Recommendations Location minning Detecting travel sequence Itinerary Recommendation

TERMINOLOGIES LBSN (Location Base Social Networks) POI (Points of Interest)  Specific point on earth.

TERMINOLOGIES… Stay Point  Time threshold (t out – t in >∂ time ). It is also dependent on distance. User Trajectory  P 1 ->P 2 ->P 3 ->…->P n PS: Where tin and tout are the time the user got to the region and the time the user leave the region respectively.

Law of Geography Everything is related to everything else, but near things are more related than distant things. Here we consider: – Users – Location

3 kinds of graphs are shown here; User - Location graph (Left hand side) User - User graph (Top right hand) Location - Location graph (Lower right hand) Relationship Users & Locations

Understanding Users One day Activity; User’s location history in one day. Routine Activities; A representation of all the similar 1-day activities. R1 R2 House (20:00 – 7:30) Work (8:00 – 19:30) House (20:00 – 7:30) Work (8:00 – 17:30) Gym (18:00 – 19:30) where R1 and R2 are Routine activities 1 and 2 respectively.

Understanding Users… Stay Point; Already explained in slide 4. Reference Point; Significant places eg. School, Shopping mall etc.

Routine activities mining Discovering activities patterns from multiple 1-day activities. – Find groups of similar 1-day activities – Represent 1-day activities within the same group with a routine activity model. Similarity can br measured by; where X and Y reference places vectors and D is total extracted reference places of the user, and x i and y i are the time duration the user stayed at the ith reference place during the corresponding time span in two different days.

Modeling human location history in semantic spaces Stay Point Representation; Stay region Using IT-IDF (Term Frequency Inverse Document Frequency) a feature vector could be created for stay region, and with this information the semantic meaning of a region could be gotten. If we regard POIs as word and treat stay region as documents. Identifying the exact POI a user has visited.

Modeling human location history in semantic spaces… Feature Vector; The feature of a stay region r in a collection of regions R is f r =. where w i is the weight of POI category i in the region r, n i is the nos of similar reference places eg resturants, N is the total no of reference places, and R is the total nos of stay regions created by all users.

Feature Vector… Example; Suppose that a building S1 contains two restaurants and one museum, and another building S2 only has four restaurants. The total number of stay regions created by all the users is 100, in which 50 have restaurants and two contain museums. So, the feature vectors of s1 and s2 are f1 and f2 respectively: PS: Although we still cannot identify the exact POI category visited by an individual, this feature vector determines the interests of a user to some extent by extracting the semantic meaning of a region accessed by the individual.

Building a Semantic Location History Using IT-IDF the semantic meaning of a region could be gotten. Regards POIs as word and treat stay region as documents.

User Similarities Calculations Popularity of different locations Hierarchical property of geographic spaces Sequential property of users’ movements; Loc A -> LocB -> LocC ->…-> LocN. – Here we consider Travel Match

User Similarities Calculations (contd) Travel Match The locations in a travel match do not have to be consecutive in the user’s original location history What we need to detect for the calculating of user similarity are the maximum travel matches

User Similarities Calculations (contd) Similarity Score N = Total number of users in the database, n = number of users visiting location c. f w (l) is employed to assign a bigger weight to the similarity of sequences occurring at a lower layer, where l = depth of a layer in the hierarchy.

Hierarchical User clustering Representative user is determined according to the similarity score between each pair of users. E.g. the individual with the minimal distance to others users in the clusters can be selected as the representative user of the cluster.

Travel Recommendations  Interesting Places  Popular Travel Sequence  Itinerary Planning  Activities Recommendation.

Mining Interesting Locations 1) Formulate a shared hierarchical framework F, using the stay points detected from user's GPS logs, which are then clustered into hierarchy geospatial region. 2) Build location graphs on each layer based on shared framework F and user’s location histories

Factors considered Location Interest  Uses HIT (Hypertext Induced Topic Search) to give Authority score and Hub score to places. Location interest (c ij ) is represented by; where I ij = authority score of cluster c ij conditioned by its ascendant nodes on level l, where 1 ≤ l < i.

Factors considered… Travel Experience; In our system, a user’s (e.g., u k ) travel experience is represented by a set of hub scores: Where denoted uk’s hub score conditioned by region cij.

Detecting travel sequences Example: Demonstrates the calculation of the popularity score for a 2-length sequence (i.e., a sequence containing two locations),A→C. First we consider the authority score of location A(I A ), weighted by the Probability of people leaving by the sequence (Out AC ) = 5/7. Secondly authority score of location C(Ic) Then the hub score of users (U AC ) who have taken this sequence.

Following this method, the popularity score of sequence C → D is calculated as follows: Thus, the popularity score of sequence A→C→D equals: PS: This calculation will continue until we get the K-length most travel sequence.

Itinerary Recommendation Query Verification; Check the feasibility of query according to spatial and temporal constraints. Trip Candidate Selection; Searches a location- interest graph for candidate itineraries satisfying a user’s query Trip Candidate Ranking; It ranks candidate itineraries according to three factor namely;

Itinerary Recommendation… Elapsed Time ratio (ETR): Ratio between the time length of a recommended itinerary and that given by a user. Stay Time Ratio (STR): Ratio between time a user could spend in a location and that for traveling between locations. Interest Density Ratio (IDR): Sum of the interest values of the locations contained in an itinerary. Itineraries is ranked by the euclidean distance in these three dimensions : NB: Popular travel sequence could also be considered here.

Itinerary Recommendation

Location-Activity Recommendation Location – feature Matrix ; It uses IT-IDF to assign a feature to a location (e.g. Restaurants, movies theatre). Activities – Activities : It models the correlation between two differents activities that can be performed at a location.

Questions and Comments THANK YOU.