Inferring User Interest Familiarity and Topic Similarity with Social Neighbors in Facebook Department of Computer Science, KAIST Dabi Ahn, Taehun Kim,

Slides:



Advertisements
Similar presentations
An Online News Recommender System for Social Networks Department of Computer Science University of Illinois at Urbana-Champaign Manish Agrawal, Maryam.
Advertisements

Data Mining and Machine Learning Lab eTrust: Understanding Trust Evolution in an Online World Jiliang Tang, Huiji Gao and Huan Liu Computer Science and.
A Vector Space Model for Automatic Indexing
Active Learning for Streaming Networked Data Zhilin Yang, Jie Tang, Yutao Zhang Computer Science Department, Tsinghua University.
Title: The Author-Topic Model for Authors and Documents
Caimei Lu et al. (KDD 2010) Presented by Anson Liang.
University of Athens, Greece Pervasive Computing Research Group Predicting the Location of Mobile Users: A Machine Learning Approach 1 University of Athens,
Graphics Annotation Usability in eLearning Applications Dorian Gorgan, Teodor Ştefănuţ Computer Science Department Technical University of Cluj-Napoca.
Topic-Sensitive PageRank Taher H. Haveliwala. PageRank Importance is propagated A global ranking vector is pre-computed.
Modeling spatially-correlated sensor network data Apoorva Jindal, Konstantinos Psounis Department of Electrical Engineering-Systems University of Southern.
12 -1 Lecture 12 User Modeling Topics –Basics –Example User Model –Construction of User Models –Updating of User Models –Applications.
Distribution Function Estimation in Small Areas for Aquatic Resources Spatial Ensemble Estimates of Temporal Trends in Acid Neutralizing Capacity Mark.
A Social Help Engine for Online Social Network Mobile Users Tam Vu, Akash Baid WINLAB, Rutgers University May 21,
Query session guided multi- document summarization THESIS PRESENTATION BY TAL BAUMEL ADVISOR: PROF. MICHAEL ELHADAD.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Combining Content-based and Collaborative Filtering Department of Computer Science and Engineering, Slovak University of Technology
Temporal Event Map Construction For Event Search Qing Li Department of Computer Science City University of Hong Kong.
Recommender Systems on the Web: A Model-Driven Approach Gonzalo Rojas – Francisco Domínguez – Stefano Salvatori Department of Computer Science University.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Correlated Topic Models By Blei and Lafferty (NIPS 2005) Presented by Chunping Wang ECE, Duke University August 4 th, 2006.
Modeling Relationship Strength in Online Social Networks Rongjing Xiang: Purdue University Jennifer Neville: Purdue University Monica Rogati: LinkedIn.
Survey Of Music Information Needs, Uses, and Seeking Behaviors Jin Ha Lee J. Stephen Downie Graduate School of Library and Information Science University.
Topic Models in Text Processing IR Group Meeting Presented by Qiaozhu Mei.
Multi-agent Research Tool (MART) A proposal for MSE project Madhukar Kumar.
Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.
Probabilistic Question Recommendation for Question Answering Communities Mingcheng Qu, Guang Qiu, Xiaofei He, Cheng Zhang, Hao Wu, Jiajun Bu, Chun Chen.
Annealing Paths for the Evaluation of Topic Models James Foulds Padhraic Smyth Department of Computer Science University of California, Irvine* *James.
Statistical Estimation of Word Acquisition with Application to Readability Prediction Proceedings of the 2009 Conference on Empirical Methods in Natural.
Crowdsourcing with Multi- Dimensional Trust Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department of Electrical.
1 Linmei HU 1, Juanzi LI 1, Zhihui LI 2, Chao SHAO 1, and Zhixing LI 1 1 Knowledge Engineering Group, Dept. of Computer Science and Technology, Tsinghua.
Combined Central and Subspace Clustering for Computer Vision Applications Le Lu 1 René Vidal 2 1 Computer Science Department, Johns Hopkins University,
Topic Modelling: Beyond Bag of Words By Hanna M. Wallach ICML 2006 Presented by Eric Wang, April 25 th 2008.
1 Recommender Systems Collaborative Filtering & Content-Based Recommending.
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
Context-Sensitive Information Retrieval Using Implicit Feedback Xuehua Shen : department of Computer Science University of Illinois at Urbana-Champaign.
Probabilistic Models for Discovering E-Communities Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, Hongyuan Zha The Pennsylvania State University WWW.
You Are What You Like! Information Leakage Through Users’ Interests Abdelberi Chaabane, Gergely Acs, Mohamed Ali Kaafar INRIA France NDSS 2012.
Sociological Research Methods. The Research Process Sociologists answer questions about society through empirical research (observation and experiments)
1 A Biterm Topic Model for Short Texts Xiaohui Yan, Jiafeng Guo, Yanyan Lan, Xueqi Cheng Institute of Computing Technology, Chinese Academy of Sciences.
Click to Add Title A Systematic Framework for Sentiment Identification by Modeling User Social Effects Kunpeng Zhang Assistant Professor Department of.
A Novel Visualization Model for Web Search Results Nguyen T, and Zhang J IEEE Transactions on Visualization and Computer Graphics PAWS Meeting Presented.
Use of Agents in ECommerce Product Search/Identification (eg “Eyes” by amazon) Information Brokering Automated Negotiation Web Marketing.
Iowa State University Department of Computer Science Center for Computational Intelligence, Learning, and Discovery Harris T. Lin, Sanghack Lee, Ngot Bui.
CS246 Latent Dirichlet Analysis. LSI  LSI uses SVD to find the best rank-K approximation  The result is difficult to interpret especially with negative.
Dynamic Multi-Faceted Topic Discovery in Twitter Date : 2013/11/27 Source : CIKM’13 Advisor : Dr.Jia-ling, Koh Speaker : Wei, Chang 1.
Link Distribution on Wikipedia [0407]KwangHee Park.
Review of Statistical Terms Population Sample Parameter Statistic.
A New OLAP Aggregation Based on the AHC Technique DOLAP 2004 R. Ben Messaoud, O. Boussaid, S. Rabaséda Laboratoire ERIC – Université de Lyon 2 5, avenue.
Online Evolutionary Collaborative Filtering RECSYS 2010 Intelligent Database Systems Lab. School of Computer Science & Engineering Seoul National University.
Text Information Management ChengXiang Zhai, Tao Tao, Xuehua Shen, Hui Fang, Azadeh Shakery, Jing Jiang.
Inferring User Interest Familiarity and Topic Similarity with Social Neighbors in Facebook INSTRUCTOR: DONGCHUL KIM ANUSHA BOOTHPUR
A Collapsed Variational Bayesian Inference Algorithm for Latent Dirichlet Allocation Yee W. Teh, David Newman and Max Welling Published on NIPS 2006 Discussion.
Using Blog Properties to Improve Retrieval Gilad Mishne (ICWSM 2007)
Topic Modeling for Short Texts with Auxiliary Word Embeddings
Recommending Forum Posts to Designated Experts
Online Multiscale Dynamic Topic Models
Multimodal Learning with Deep Boltzmann Machines
Community-based User Recommendation in Uni-Directional Social Networks
Frontiers of Computer Science, 2015, 9(4):608–622
Shashi Shekhar Weili Wu Sanjay Chawla Ranga Raju Vatsavai
CHAPTER 1 Exploring Data
CHAPTER 1 Exploring Data
Michal Rosen-Zvi University of California, Irvine
Privacy Protection for Social Network Services
Chapter 7: Introduction to Sampling Distributions
CS246: Latent Dirichlet Analysis
Jinwen Guo, Shengliang Xu, Shenghua Bao, and Yong Yu
GhostLink: Latent Network Inference for Influence-aware Recommendation
Modeling Topic Diffusion in Scientific Collaboration Networks
Presentation transcript:

Inferring User Interest Familiarity and Topic Similarity with Social Neighbors in Facebook Department of Computer Science, KAIST Dabi Ahn, Taehun Kim, Soon J. Hyun, Dongman Lee IEEE 2012 Web Intelligence and Intelligent Agent Technology

System Workflow

Inferring User Interest Using Topic Structure We formally define Interest-Score for interest i k of user u i as: Correlation i,j,k , the strength of correlation between u i and u j for i k, is defined as:

Correlation-Weight We compute Correlation-Weight w i,j,k by estimating similarity between the two topic distribution vectors and averaging them h = 1 to H(the number of total social activities between u i and u j ) = a topic distribution vector of each social content = a topic distribution vector of each interest content

Latent Dirichlet Allocation(LDA) The parameters and are corpus-level parameters. The variables are document-level variables The variables z dn and w dn are word-level variables and are sampled once for each word in each document

Online Familiarity We formulate Online Familiarity f i,j as: Freq(i,j) is defined as: P i,j = u i writes a posting into u j ’s wall C i,j = u i writes comment(s) in u j ’s posting L i,j = u i likes u j ’s posting.

Dataset A user writes a posting on his social neighbor’s wall or a posting is written in his wall by the social neighbor. A user writes comment(s) in his social neighbor’s posting or comment(s) is written in his posting by the social neighbor. A user likes his social neighbor’s posting or his posting is liked by the social neighbor.(In Facebook, a user expresses his/her preference about a post by pressing the “Like” button.)

Evaluation Based on User Explicit Interest – EXP is set of the user’s explicit interests – INF N is a set of top-N inferred interests ordered by Interest-Score Based on Questionnaire

Result

Conclusion We consider topic similarity between communication contents and interest descriptions as well as the degree of familiarity We plan to extend the proposed scheme by using not only spatial aspects such as a user’s location, trace history or characteristics of a place, but also temporal context like time slots