Social Interaction Based Video Recommendation: Recommending YouTube Videos to Facebook Users
|
|
- Dulcie Crawford
- 5 years ago
- Views:
Transcription
1 Social Interaction Based Video Recommendation: Recommending YouTube Videos to Facebook Users Bin Nie 1 Honggang Zhang 1 Yong Liu 2 1 Fordham University, Bronx, NY. {bnie, hzhang44}@fordham.edu 2 NYU Poly, Brooklyn, NY. yongliu@poly.edu
2 Background Online videos are popular topics for OSNs Recent researches: Recommender Systems can benefit from OSNs But, they mainly use Synthetic Network Pure content-sharing websites Our Work, based on Real-World Data Social Interactions Recommend 2
3 How to Recommend Videos by Leveraging Social Interactions? Our research: Step1: Collect Data from Facebook and YouTube Step2: Analyze Video Popularity and Social Interactions Step3: Develop Social-Interaction Based Algorithms to Recommend Videos 3
4 Data Collection: Sampling Facebook Network Pick a user as a root, and start a random-walk, neighborlimited breadth-first search process u f1 u f2 u f3 u f11 u f12 u f13 u depth 1: size = 3 1 depth 2: size = 3 2 depth 6: size = 3 6 * other types: status, photo, link, swf, checkin, offer. Ideally, from each root user, we can get 1093 nodes. ( = 6,558 in total.) Actually, from all six root users, we get 6,466 nodes, denoted as U orig. Collect videos uploaded or shared by users in U orig video set V orig Sampling time interval: April 18, 2013 ~ May 30,
5 Data Collection: Finalize Data Set V orig U inter U all V all U y V y U orig All YouTube # of Users 32,209 19,609 # of Direct Friends 111, ,176 # of Two-hops Friends 4,512, ,552 # of videos 294, ,151 It s the number of YouTube videos with unique links! 5
6 How to Recommend Videos by Leveraging Social Interactions? Our research: Step1: Collect Data from Facebook and YouTube Step2: Analyze Video Popularity and Social Interactions Step3: Develop Social-Interaction Based Algorithms to Recommend Videos 6
7 Video Popularity Study YouTube videos set V y and users set U y For a video v i V y, Popularity on Facebook F c / c i i j j 1 Popularity on YouTube n / n i i j j 1 W w w / n i i j j 1 L l l # of sharing + # of interactions watch count like count 7
8 Compare Popularity of Videos on Facebook and YouTube W i L i Pearson Coefficient = 0.03 Pearson Coefficient = 0.02 It might? be effective to exploit social interaction information to improve RS 8
9 Video Popularity Comparison on Facebook and YouTube Look at videos ranked among top 100 and lowest 100 on YouTube like count in the increasing order 9
10 Video Popularity Difference A Global View popularity increase like count in the increasing order * Each group has at least 100 videos 10
11 Video Popularity Difference A Global View G 1 pop increase G 45 G 46 pop decrease G 50 Mining social interactions might potentially help to improve recommendation of videos, especially Niche Videos! * Each group has at least 100 videos 11
12 Interest Similarity vs. Social Distance Cosine Similarity Alice interacted with v 3 4 times Binary Values v 1 v 2 v 3 v 4 v 5 Alice Bob Range: [0,1] cosinesim a, b = = 0.58 Social Distance One-hop friends Two-hops friends More-than-two-hops friends 12
13 Interest Similarity vs. Social Distance NO significant correlation between users interest similarity and social distance! 13
14 How to Recommend Videos by Leveraging Social Interactions? Our research: Step1: Collect Data from Facebook and YouTube Step2: Analyze Video Popularity and Social Interactions Step3: Develop Social-Interaction Based Algorithms to Recommend Videos 14
15 Example Scenario 5 users and 10 videos 5 10 matrix A Alice s Interest Vector v 0 v 1 v 2 v 3 v 4 v 5 v 6 v 7 v 8 v 9 Alice Bob Cindy Alice is 0not Alice is David 0 interested 1 in 1 v interested 1 in 1v Eddie * interested: at least interacted with this video once! 15
16 Example Scenario 5 users and 10 videos 5 10 matrix A Alice grouping Alice V a,1 V a,0 16
17 Example Scenario We consider users who have interaction with at least 50 videos in V y. 5 users and 10 videos 5 10 matrix A Alice grouping Alice V a,test V a,1 = 20% of V a,1 V a,train V a,0 Alice s candidate video set V a,cad 17
18 NaïveYouTube Algorithm Suppose recommend videos to Alice, Rank videos in V a,cad according to the like count, or watch count from YouTube in nonincreasing order Recommending Recommend Top-k videos in V a,cad to Alice Selecting Videos 18
19 CollabRecommend Algorithm Suppose recommend videos to Alice, l U y, calculate cosinesim(a, l) using V a,train S a =Top-50 similar Selecting Users Scoring Score videos in V a,cad according to S a users interest vectors Recommend Top-k videos, denoted as V a,rec Recommending 19
20 Example: How to Score V a,rec? Alice s V a,cad = {v 1, v 2, v 3, v 4, v 5 } Top 5 users in Alice s S a = {u 1, u 2, u 3, u 4, u 5 } Alice s Score Vector v 1 v 2 v 3 v 4 v u 1 s Interest Vector u 2 s Interest Vector u 3 s Interest Vector u 4 s Interest Vector u 5 s Interest Vector
21 Example: How to Score V a,rec? Alice s V a,cad = {v 1, v 2, v 3, v 4, v 5 } Top 5 users in Alice s S a = {u 1, u 2, u 3, u 4, u 5 } Alice s Final Score Vector Alice s Score Vector v 1 v 2 v 3 v 4 v u 1 s Interest Vector u 2 s Interest Vector u 3 s Interest Vector u 4 s Interest Vector u 5 s Interest Vector
22 Example: How to Score V a,rec? Alice s V a,cad = {v 1, v 2, v 3, v 4, v 5 } Top 5 users in Alice s S a = {u 1, u 2, u 3, u 4, u 5 } Alice s Final Score Vector Alice s Score Vector v 1 v 2 v 3 v 4 v sorting Recommend Top-2 to Alice, denoted as 2 V a, rec
23 Video-related Interactions Nice video! Bob interacted with Alice s video twice. 23
24 Video-related Interactions Bob interacted with Alice s video twice. Alice interacted with Bob s video once. Total video-related interactions between Alice and Bob = = 3 24
25 SocialRecommend Algorithm Suppose recommend videos to Alice, Similarity S a =Top-50 similar Social Interaction S a = S a Top-50 users with most interactions S a 100! Selecting Users Scoring Recommending 25
26 Evaluate Recommendation Accuracy Top-k Hit-Ratio k H a, k = ( V a,rec V a,test )/( V a,test ) NaiveYouTube (based on like count) CollabRecommend Most significant improvement SocialRecommend 26
27 Evaluate Recommendation Algorithm Recall recall = ( U y i=1 k V i,rec U y V i,test )/( V i,test ) i=1 About 20% ~ 25% relative accuracy improvement Barely visible! 27
28 Recommendation Algorithm Recall Social- Recommend recall = ( U y i=1 k V i,rec V i,test )/( U y Vary number of candidate users i=1 V i,test ) 28
29 Conclusion Video popularity on Facebook is not always well-aligned with video popularity on YouTube With rich social interactions information, even simple algorithm could achieve significantly better recommendation accuracy 29
30 Future Work Expand Dataset More diverse Improve SocialRecommend Performance More robust Better hit-ratio and recall 30
31 Thank you!
Recommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 21, 2014 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 21, 2014 1 / 52 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
More informationDetermining the Diameter of Small World Networks
Determining the Diameter of Small World Networks Frank W. Takes & Walter A. Kosters Leiden University, The Netherlands CIKM 2011 October 2, 2011 Glasgow, UK NWO COMPASS project (grant #12.0.92) 1 / 30
More informationDS504/CS586: Big Data Analytics Graph Mining II
Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6:00pm 8:50pm Mon. and Wed. Location: SL105 Spring 2016 Reading assignments We will increase the bar a little bit Please
More informationAssessment of Multi-Hop Interpersonal Trust in Social Networks by 3VSL
Assessment of Multi-Hop Interpersonal Trust in Social Networks by 3VSL Guangchi Liu, Qing Yang, Honggang Wang, Xiaodong Lin and Mike P. Wittie Presented by Guangchi Liu Department of Computer Science Montana
More informationLink Prediction. Eman Badr Mohammed Saquib Akmal Khan
Link Prediction Eman Badr Mohammed Saquib Akmal Khan 11-06-2013 Link Prediction Which pair of nodes should be connected? Applications Facebook friend suggestion Recommendation systems Monitoring and controlling
More informationInteract with Strangers
Interact with Strangers RATE: Recommendation-aware Trust Evaluation in Online Social Networks Wenjun Jiang 1, 2, Jie Wu 2, and Guojun Wang 1 1. School of Information Science and Engineering, Central South
More informationRecommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 29-30, 2015 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 29-30, 2015 1 / 61 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
More informationWeb Structure Mining Nodes, Links and Influence
Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.
More informationCS425: Algorithms for Web Scale Data
CS: Algorithms for Web Scale Data Most of the slides are from the Mining of Massive Datasets book. These slides have been modified for CS. The original slides can be accessed at: www.mmds.org Customer
More informationPower Laws & Rich Get Richer
Power Laws & Rich Get Richer CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2015 Hadi Amiri hadi@umd.edu Lecture Topics Popularity as a Network Phenomenon
More informationWiki Definition. Reputation Systems I. Outline. Introduction to Reputations. Yury Lifshits. HITS, PageRank, SALSA, ebay, EigenTrust, VKontakte
Reputation Systems I HITS, PageRank, SALSA, ebay, EigenTrust, VKontakte Yury Lifshits Wiki Definition Reputation is the opinion (more technically, a social evaluation) of the public toward a person, a
More informationData Mining Recitation Notes Week 3
Data Mining Recitation Notes Week 3 Jack Rae January 28, 2013 1 Information Retrieval Given a set of documents, pull the (k) most similar document(s) to a given query. 1.1 Setup Say we have D documents
More informationSOCIAL MEDIA IN THE COMMUNICATIONS CENTRE
SOCIAL MEDIA IN THE COMMUNICATIONS CENTRE Karen Gordon Gordon Strategy www.gordonstrategy.ca v 1 WHAT WE ARE GOING TO TALK ABOUT TODAY T h e s o c i a l m e d i a i n c i d e n t W h a t c a n h a p p
More informationPoint-of-Interest Recommendations: Learning Potential Check-ins from Friends
Point-of-Interest Recommendations: Learning Potential Check-ins from Friends Huayu Li, Yong Ge +, Richang Hong, Hengshu Zhu University of North Carolina at Charlotte + University of Arizona Hefei University
More informationELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties
ELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties Prof. James She james.she@ust.hk 1 Last lecture 2 Selected works from Tutorial
More informationClass President: A Network Approach to Popularity. Due July 18, 2014
Class President: A Network Approach to Popularity Due July 8, 24 Instructions. Due Fri, July 8 at :59 PM 2. Work in groups of up to 3 3. Type up the report, and submit as a pdf on D2L 4. Attach the code
More informationLink Analysis Ranking
Link Analysis Ranking How do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it? Naïve ranking of query results Given query
More information6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search
6.207/14.15: Networks Lecture 7: Search on Networks: Navigation and Web Search Daron Acemoglu and Asu Ozdaglar MIT September 30, 2009 1 Networks: Lecture 7 Outline Navigation (or decentralized search)
More informationDS504/CS586: Big Data Analytics Graph Mining II
Welcome to DS504/CS586: Big Data Analytics Graph Mining II Prof. Yanhua Li Time: 6-8:50PM Thursday Location: AK233 Spring 2018 v Course Project I has been graded. Grading was based on v 1. Project report
More informationCircle-based Recommendation in Online Social Networks
Circle-based Recommendation in Online Social Networks Xiwang Yang, Harald Steck*, and Yong Liu Polytechnic Institute of NYU * Bell Labs/Netflix 1 Outline q Background & Motivation q Circle-based RS Trust
More informationImproving Diversity in Ranking using Absorbing Random Walks
Improving Diversity in Ranking using Absorbing Random Walks Andrew B. Goldberg with Xiaojin Zhu, Jurgen Van Gael, and David Andrzejewski Department of Computer Sciences, University of Wisconsin, Madison
More informationFacebook Friends! and Matrix Functions
Facebook Friends! and Matrix Functions! Graduate Research Day Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Network Analysis Use linear algebra
More informationWhere to Find My Next Passenger?
Where to Find My Next Passenger? Jing Yuan 1 Yu Zheng 2 Liuhang Zhang 1 Guangzhong Sun 1 1 University of Science and Technology of China 2 Microsoft Research Asia September 19, 2011 Jing Yuan et al. (USTC,MSRA)
More informationDescribing and Forecasting Video Access Patterns
Boston University OpenBU Computer Science http://open.bu.edu CAS: Computer Science: Technical Reports -- Describing and Forecasting Video Access Patterns Gursun, Gonca CS Department, Boston University
More informationMining Molecular Fragments: Finding Relevant Substructures of Molecules
Mining Molecular Fragments: Finding Relevant Substructures of Molecules Christian Borgelt, Michael R. Berthold Proc. IEEE International Conference on Data Mining, 2002. ICDM 2002. Lecturers: Carlo Cagli
More informationAn Efficient reconciliation algorithm for social networks
An Efficient reconciliation algorithm for social networks Silvio Lattanzi (Google Research NY) Joint work with: Nitish Korula (Google Research NY) ICERM Stochastic Graph Models Outline Graph reconciliation
More informationModels, Data, Learning Problems
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Models, Data, Learning Problems Tobias Scheffer Overview Types of learning problems: Supervised Learning (Classification, Regression,
More informationCommunity Detection. fundamental limits & efficient algorithms. Laurent Massoulié, Inria
Community Detection fundamental limits & efficient algorithms Laurent Massoulié, Inria Community Detection From graph of node-to-node interactions, identify groups of similar nodes Example: Graph of US
More informationCSE 258, Winter 2017: Midterm
CSE 258, Winter 2017: Midterm Name: Student ID: Instructions The test will start at 6:40pm. Hand in your solution at or before 7:40pm. Answers should be written directly in the spaces provided. Do not
More informationBEYOND ASSORTATIVITY PROCLIVITY INDEX FOR ATTRIBUTED NETWORKS (PRONE) Reihaneh Rabbany Dhivya Eswaran*
PROCLIVITY INDEX FOR ATTRIBUTED NETWORKS (PRONE) Reihaneh Rabbany rrabbany@andrew.cmu.edu Artur W. Dubrawski awd@andrew.cmu.edu Dhivya Eswaran* deswaran@cs.cmu.edu Christos Faloutsos christos@cs.cmu.edu
More informationItem Recommendation for Emerging Online Businesses
Item Recommendation for Emerging Online Businesses Chun-Ta Lu Sihong Xie Weixiang Shao Lifang He Philip S. Yu University of Illinois at Chicago Presenter: Chun-Ta Lu New Online Businesses Emerge Rapidly
More informationMobiHoc 2014 MINIMUM-SIZED INFLUENTIAL NODE SET SELECTION FOR SOCIAL NETWORKS UNDER THE INDEPENDENT CASCADE MODEL
MobiHoc 2014 MINIMUM-SIZED INFLUENTIAL NODE SET SELECTION FOR SOCIAL NETWORKS UNDER THE INDEPENDENT CASCADE MODEL Jing (Selena) He Department of Computer Science, Kennesaw State University Shouling Ji,
More informationCollaborative topic models: motivations cont
Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: " boy Two articles: article A! girl article B Preferences: The boy likes A and B --- no problem.
More informationDATA MINING LECTURE 6. Similarity and Distance Sketching, Locality Sensitive Hashing
DATA MINING LECTURE 6 Similarity and Distance Sketching, Locality Sensitive Hashing SIMILARITY AND DISTANCE Thanks to: Tan, Steinbach, and Kumar, Introduction to Data Mining Rajaraman and Ullman, Mining
More informationMining Newsgroups Using Networks Arising From Social Behavior by Rakesh Agrawal et al. Presented by Will Lee
Mining Newsgroups Using Networks Arising From Social Behavior by Rakesh Agrawal et al. Presented by Will Lee wwlee1@uiuc.edu September 28, 2004 Motivation IR on newsgroups is challenging due to lack of
More informationDATA MINING LECTURE 13. Link Analysis Ranking PageRank -- Random walks HITS
DATA MINING LECTURE 3 Link Analysis Ranking PageRank -- Random walks HITS How to organize the web First try: Manually curated Web Directories How to organize the web Second try: Web Search Information
More informationPrediction of Citations for Academic Papers
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationPreliminaries. Data Mining. The art of extracting knowledge from large bodies of structured data. Let s put it to use!
Data Mining The art of extracting knowledge from large bodies of structured data. Let s put it to use! 1 Recommendations 2 Basic Recommendations with Collaborative Filtering Making Recommendations 4 The
More informationHeat Kernel Based Community Detection
Heat Kernel Based Community Detection Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Local Community Detection Given seed(s) S in G, find a
More informationPurnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.)
Purnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.) Which pair of nodes {i,j} should be connected? Variant: node i is given Alice Bob Charlie Friend
More informationSPONSORSHIP GOLD SILVER BRONZE WHAT? WHEN? WHERE? HOW MUCH?
SPONSORSHIP WHAT? P u r p l e D a y 2 0 1 8 i s a s e r i e s o f c o m m u n i t y e v e n t s c o o r d i n a t e d b y a n a r m y o f v o l u n t e e r s a n d f u n d r a i s e r s n a t i o n a l
More informationSupporting Statistical Hypothesis Testing Over Graphs
Supporting Statistical Hypothesis Testing Over Graphs Jennifer Neville Departments of Computer Science and Statistics Purdue University (joint work with Tina Eliassi-Rad, Brian Gallagher, Sergey Kirshner,
More informationON SOCIAL-TEMPORAL GROUP QUERY WITH ACQUAINTANCE CONSTRAINT
1 ON SOCIAL-TEMPORAL GROUP QUERY WITH ACQUAINTANCE CONSTRAINT D.N Yang Y.L Chen W.C Lee M.S Chen Sep 2011 Presented by Roi Fridburg AGENDA Activity Planning Social Graphs Proposed Algorithms SGSelect SGTSelect
More informationLinear Classifiers (Kernels)
Universität Potsdam Institut für Informatik Lehrstuhl Linear Classifiers (Kernels) Blaine Nelson, Christoph Sawade, Tobias Scheffer Exam Dates & Course Conclusion There are 2 Exam dates: Feb 20 th March
More informationPerformance Evaluation. Analyzing competitive influence maximization problems with partial information: An approximation algorithmic framework
Performance Evaluation ( ) Contents lists available at ScienceDirect Performance Evaluation journal homepage: www.elsevier.com/locate/peva Analyzing competitive influence maximization problems with partial
More informationChallenges in Geocoding Socially-Generated Data
Challenges in Geocoding Socially-Generated Data Jonny Huck (2 nd year part-time PhD student) Duncan Whyatt Paul Coulton Lancaster Environment Centre School of Computing and Communications Royal Wedding
More informationDepartment of Computer Science, Guiyang University, Guiyang , GuiZhou, China
doi:10.21311/002.31.12.01 A Hybrid Recommendation Algorithm with LDA and SVD++ Considering the News Timeliness Junsong Luo 1*, Can Jiang 2, Peng Tian 2 and Wei Huang 2, 3 1 College of Information Science
More informationFILE // ASHCROFT SOLID STATE PHYSICS SOLUTION MANUAL
12 February, 2018 FILE // ASHCROFT SOLID STATE PHYSICS SOLUTION MANUAL Document Filetype: PDF 466.29 KB 0 FILE // ASHCROFT SOLID STATE PHYSICS SOLUTION MANUAL Our solution manuals are written by Chegg
More informationCS 584 Data Mining. Association Rule Mining 2
CS 584 Data Mining Association Rule Mining 2 Recall from last time: Frequent Itemset Generation Strategies Reduce the number of candidates (M) Complete search: M=2 d Use pruning techniques to reduce M
More informationEfficient Subgraph Matching by Postponing Cartesian Products. Matthias Barkowsky
Efficient Subgraph Matching by Postponing Cartesian Products Matthias Barkowsky 5 Subgraph Isomorphism - Approaches search problem: find all embeddings of a query graph in a data graph NP-hard, but can
More informationDeep Reinforcement Learning for Unsupervised Video Summarization with Diversity- Representativeness Reward
Deep Reinforcement Learning for Unsupervised Video Summarization with Diversity- Representativeness Reward Kaiyang Zhou, Yu Qiao, Tao Xiang AAAI 2018 What is video summarization? Goal: to automatically
More informationMining Triadic Closure Patterns in Social Networks
Mining Triadic Closure Patterns in Social Networks Hong Huang, University of Goettingen Jie Tang, Tsinghua University Sen Wu, Stanford University Lu Liu, Northwestern University Xiaoming Fu, University
More informationComprehensive Evaluation of Social Benefits of Mineral Resources Development in Ordos Basin
Studies in Sociology of Science Vol. 4, No. 1, 2013, pp. 25-29 DOI:10.3968/j.sss.1923018420130401.2909 ISSN 1923-0176 [Print] ISSN 1923-0184 [Online] www.cscanada.net www.cscanada.org Comprehensive Evaluation
More informationDistributed ML for DOSNs: giving power back to users
Distributed ML for DOSNs: giving power back to users Amira Soliman KTH isocial Marie Curie Initial Training Networks Part1 Agenda DOSNs and Machine Learning DIVa: Decentralized Identity Validation for
More informationLink Analysis Information Retrieval and Data Mining. Prof. Matteo Matteucci
Link Analysis Information Retrieval and Data Mining Prof. Matteo Matteucci Hyperlinks for Indexing and Ranking 2 Page A Hyperlink Page B Intuitions The anchor text might describe the target page B Anchor
More informationTrinity: Walking on a User-Object-Tag Heterogeneous Network for Personalised Recommendations
Gan MX, Sun L, Jiang R. : Walking on a user-object-tag heterogeneous network for personalised recommendations. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 31(3): 577 594 May 2016. DOI 10.1007/s11390-016-1648-0
More informationLink Analysis. Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze
Link Analysis Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze 1 The Web as a Directed Graph Page A Anchor hyperlink Page B Assumption 1: A hyperlink between pages
More informationCommunity weather observations: development, applications and benefits
Community weather observations: development, applications and benefits HO Chun-kit, Chan Ying-wa and Tam Kwong-hung Hong Kong Observatory 134A Nathan Road, Tsim Sha Tsui, Kowloon, Hong Kong, China Tel:+852
More informationSpam ain t as Diverse as It Seems: Throttling OSN Spam with Templates Underneath
Spam ain t as Diverse as It Seems: Throttling OSN Spam with Templates Underneath Hongyu Gao, Yi Yang, Kai Bu, Yan Chen, Doug Downey, Kathy Lee, Alok Choudhary Northwestern University, USA Zhejiang University,
More informationDegree (k)
0 1 Pr(X k) 0 0 1 Degree (k) Figure A1: Log-log plot of the complementary cumulative distribution function (CCDF) of the degree distribution for a sample month (January 0) network is shown (blue), along
More informationMS&E 233 Lecture 9 & 10: Network models
MS&E 233 Lecture 9 & 10: Networ models Ashish Goel, scribed by Riley Matthews April 30, May 2 Review: Application of PR to Netflix movie suggestions Client x: relm 1 ǫ # of users who lied m m: i lies m
More informationEFFICIENT ALGORITHMS FOR PERSONALIZED PAGERANK
EFFICIENT ALGORITHMS FOR PERSONALIZED PAGERANK A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE
More informationDescriptive Data Summarization
Descriptive Data Summarization Descriptive data summarization gives the general characteristics of the data and identify the presence of noise or outliers, which is useful for successful data cleaning
More informationYour World is not Red or Green. Good Practice in Data Display and Dashboard Design
Your World is not Red or Green Good Practice in Data Display and Dashboard Design References Tufte, E. R. (2). The visual display of quantitative information (2nd Ed.). Cheshire, CT: Graphics Press. Few,
More informationLecture 7: Fingerprinting. David Woodruff Carnegie Mellon University
Lecture 7: Fingerprinting David Woodruff Carnegie Mellon University How to Pick a Random Prime How to pick a random prime in the range {1, 2,, M}? How to pick a random integer X? Pick a uniformly random
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/7/2012 Jure Leskovec, Stanford C246: Mining Massive Datasets 2 Web pages are not equally important www.joe-schmoe.com
More informationPageRank algorithm Hubs and Authorities. Data mining. Web Data Mining PageRank, Hubs and Authorities. University of Szeged.
Web Data Mining PageRank, University of Szeged Why ranking web pages is useful? We are starving for knowledge It earns Google a bunch of money. How? How does the Web looks like? Big strongly connected
More informationCSCI 3210: Computational Game Theory. Cascading Behavior in Networks Ref: [AGT] Ch 24
CSCI 3210: Computational Game Theory Cascading Behavior in Networks Ref: [AGT] Ch 24 Mohammad T. Irfan Email: mirfan@bowdoin.edu Web: www.bowdoin.edu/~mirfan Course Website: www.bowdoin.edu/~mirfan/csci-3210.html
More informationData Science Mastery Program
Data Science Mastery Program Copyright Policy All content included on the Site or third-party platforms as part of the class, such as text, graphics, logos, button icons, images, audio clips, video clips,
More informationGeographic Knowledge Discovery Using Ground-Level Images and Videos
This work was funded in part by a DOE Early Career award, an NSF CAREER award (#IIS- 1150115), and a PECASE award. We gratefully acknowledge NVIDIA for their donated hardware. Geographic Knowledge Discovery
More informationBeating Social Pulse: Understanding Information Propagation via Online Social Tagging Systems 1
Journal of Universal Computer Science, vol. 18, no. 8 (2012, 1022-1031 submitted: 16/9/11, accepted: 14/12/11, appeared: 28/4/12 J.UCS Beating Social Pulse: Understanding Information Propagation via Online
More informationSlide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University.
Slide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University http://www.mmds.org #1: C4.5 Decision Tree - Classification (61 votes) #2: K-Means - Clustering
More informationLINK ANALYSIS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
LINK ANALYSIS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Retrieval evaluation Link analysis Models
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationLesson 4 Linear Functions and Applications
In this lesson, we take a close look at Linear Functions and how real world situations can be modeled using Linear Functions. We study the relationship between Average Rate of Change and Slope and how
More informationIntelligent Data Analysis Lecture Notes on Document Mining
Intelligent Data Analysis Lecture Notes on Document Mining Peter Tiňo Representing Textual Documents as Vectors Our next topic will take us to seemingly very different data spaces - those of textual documents.
More informationProbabilistic Near-Duplicate. Detection Using Simhash
Probabilistic Near-Duplicate Detection Using Simhash Sadhan Sood, Dmitri Loguinov Presented by Matt Smith Internet Research Lab Department of Computer Science and Engineering Texas A&M University 27 October
More informationMulti-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems
Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User
More informationTutorial: Urban Trajectory Visualization. Case Studies. Ye Zhao
Case Studies Ye Zhao Use Cases We show examples of the web-based visual analytics system TrajAnalytics The case study information and videos are available at http://vis.cs.kent.edu/trajanalytics/ Porto
More informationEfficient Respondents Selection for Biased Survey using Online Social Networks
Efficient Respondents Selection for Biased Survey using Online Social Networks Donghyun Kim 1, Jiaofei Zhong 2, Minhyuk Lee 1, Deying Li 3, Alade O. Tokuta 1 1 North Carolina Central University, Durham,
More informationTrust-Based Infinitesimals for Enhanced Collaborative Filtering
Trust-Based Infinitesimals for Enhanced Collaborative Filtering Maria Chowdhury, Alex Thomo, Bill Wadge University of Victoria BC, Canada {mwchow,thomo,wwadge}@cs.uvic.ca Abstract In this paper we propose
More informationHong Kong Observatory Summer Placement Programme 2018
Hong Kong Observatory Summer Placement Programme 2018 Training Programme : supervise the student. A mentor from the Hong Kong Observatory with relevant expertise will Training Period : 8 weeks, starting
More informationHW 3: Heavy-tails and Small Worlds. 1 When monkeys type... [20 points, collaboration allowed]
CS/EE/CMS 144 Assigned: 01/18/18 HW 3: Heavy-tails and Small Worlds Guru: Yu Su/Rachael Due: 01/25/18 by 10:30am We encourage you to discuss collaboration problems with others, but you need to write up
More informationOLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks. Fan Zhang 1, Wenjie Zhang 2, Ying Zhang 1, Lu Qin 1, Xuemin Lin 2
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks Fan Zhang 1, Wenjie Zhang 2, Ying Zhang 1, Lu Qin 1, Xuemin Lin 2 1 University of Technology Sydney, Computer 2 University Science
More informationUNIT 4 RANK CORRELATION (Rho AND KENDALL RANK CORRELATION
UNIT 4 RANK CORRELATION (Rho AND KENDALL RANK CORRELATION Structure 4.0 Introduction 4.1 Objectives 4. Rank-Order s 4..1 Rank-order data 4.. Assumptions Underlying Pearson s r are Not Satisfied 4.3 Spearman
More informationSpatial Big Data. Amol G. Deshmukh Geomatics Specialist
6% Spatial Big Data Amol G. Deshmukh Geomatics Specialist % Everyone talks about it, nobody really knows how to use it, everyone thinks everyone else is using it, so everyone claims they are using it...
More informationAnalysis of an Optimal Measurement Index Based on the Complex Network
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 5 Special Issue on Application of Advanced Computing and Simulation in Information Systems Sofia 2016 Print ISSN: 1311-9702;
More informationCentrality. Structural Importance of Nodes
Centrality Structural Importance of Nodes Life in the Military A case by David Krackhardt Roger was in charge of a prestigious Advisory Team, which made recommendations to the Joint Chiefs of Staff. His
More informationA Comparative Study of Matrix Factorization and Random Walk with Restart in Recommender Systems
A Comparative Study of Matrix Factorization and Random Walk with Restart in Recommender Systems Haekyu Park Computer Science and Engineering Seoul National University Seoul, Republic of Korea Email: hkpark627@snu.ac.kr
More informationCSC 576: Variants of Sparse Learning
CSC 576: Variants of Sparse Learning Ji Liu Department of Computer Science, University of Rochester October 27, 205 Introduction Our previous note basically suggests using l norm to enforce sparsity in
More informationIDEAL CUSTOMER AVATAR
1 Creating Your Ideal Customer Avatar Creating an Ideal Customer Avatar enables you to really connect with your clients If you follow the Avatar Framework, your prospective clients will feel like your
More informationarxiv: v1 [cs.si] 26 Dec 2013
Deriving Latent Social Impulses to Determine Longevous Videos Qingbo Hu University of Illinois at Chicago, USA qhu5@uic.edu Philip S. Yu University of Illinois at Chicago, USA King Abdulaziz University,
More informationUsing Phase for Pharmacophore Modelling. 5th European Life Science Bootcamp March, 2017
Using Phase for Pharmacophore Modelling 5th European Life Science Bootcamp March, 2017 Phase: Our Pharmacohore generation tool Significant improvements to Phase methods in 2016 New highly interactive interface
More informationIntroduction to Data Mining
Introduction to Data Mining Lecture #9: Link Analysis Seoul National University 1 In This Lecture Motivation for link analysis Pagerank: an important graph ranking algorithm Flow and random walk formulation
More informationAssignment 2. Team Volcano. Tate Hanawalt - Alexis Kuprel - Bret Miller - Chloe Sult - Mark Woodford
Assignment 2 Team Volcano Tate Hanawalt - Alexis Kuprel - Bret Miller - Chloe Sult - Mark Woodford Team Website: Home Page: The Team: Team Contract/UI Design/Design Documents/Assignments/DB Schemas (etc.):
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationANÁLISE DOS DADOS. Daniela Barreiro Claro
ANÁLISE DOS DADOS Daniela Barreiro Claro Outline Data types Graphical Analysis Proimity measures Prof. Daniela Barreiro Claro Types of Data Sets Record Ordered Relational records Video data: sequence of
More informationIntroduction to Google Mapping Tools
Introduction to Google Mapping Tools Google s Mapping Tools Explore geographic data. Organize your own geographic data. Visualize complex data. Share your data with the world. Tell your story and educate
More informationCounting Rules. Counting operations on n objects. Sort, order matters (perms) Choose k (combinations) Put in r buckets. None Distinct.
Probability Counting Rules Counting operations on n objects Sort, order matters (perms) Choose k (combinations) Put in r buckets Distinct n! Some Distinct n! n 1!n 2!... n k Distinct = n! k!(n k)! Distinct
More informationA Study of YouTube recommendation graph based on measurements and stochastic tools
A Study of YouTube recommendation graph based on measurements and stochastic tools Yonathan Portilla, Alexandre Reiffers, Eitan Altman, Rachid El-Azouzi To cite this version: Yonathan Portilla, Alexandre
More information