Proceedings ArticleDOI
Predicting User-to-content Links in Flickr Groups
S. Negi,S. Chaudhury +1 more
- pp 124-131
Reads0
Chats0
TLDR
The proposed method for predicting user-to-content links takes into account both community effect and content effect and results on real-world Flickr Group data reveals that the proposed method shows good performance for the user- to-content link prediction task.Abstract:
The last few years have seen an exponential increase in the amount of multimedia content that is available online thanks to collaborative-online communities such as Flickr, You Tube etc. As opposed to "pure" social networking services these collaborative-online communities not only allow users to create new social links (e.g. add other users to their friend or contact list) but also allow users to contribute multimedia content and engage in content-driven interactions (called user-to-content interactions). A good example of this can be seen in Flickr, in general and Flickr Group in particular where users can comment on or "like" an image contributed by another user. This paper looks at the task of predicting the formation of such user-to-content links in Flickr Groups. More specifically, "what is the chance that a user will comment/like an image contributed by another user?". Our proposed method for predicting user-to-content links takes into account both community effect and content effect. Our results on real-world Flickr Group data reveals that the proposed method shows good performance for the user-to-content link prediction task.read more
Citations
More filters
Journal ArticleDOI
Interactive Mining of Strong Friends from Social Networks and Its Applications in E-Commerce
TL;DR: This study integrates data mining with social computing to form a social network mining algorithm, which helps the individual distinguish these strong friends from a large number of friends in a specific portion of the social networks in which he or she is interested.
Journal ArticleDOI
Predicting the number of comments on facebook posts using an ensemble regression model
TL;DR: It is concluded that the use of the ensemble model can reduce the average correlation coefficient (as one of the evaluation criteria of the model) to 74.4 ± 16.4, which is an acceptable result.
Journal ArticleDOI
Comment Volume Prediction using Regression
Mandeep Kaur,Prince Verma +1 more
TL;DR: This paper demonstrates a preliminary work to exhibit the sufficiency of machine learning prescient calculations on the remarks of most well known long range informal communication site, Facebook.
References
More filters
Structure and Evolution of Online Social Networks.
TL;DR: In this paper, the evolution of structure within large online social networks is studied. Butler et al. present a series of measurements of two such networks, together comprising in excess of five million people and ten million friendship links, annotated with metadata capturing the time of every event.
Proceedings Article
Supervised Topic Models
David M. Blei,Jon McAuliffe +1 more
TL;DR: The supervised latent Dirichlet allocation (sLDA) model, a statistical model of labelled documents, is introduced, which derives a maximum-likelihood procedure for parameter estimation, which relies on variational approximations to handle intractable posterior expectations.
Proceedings ArticleDOI
Structure and evolution of online social networks
TL;DR: A simple model of network growth is presented, characterizing users as either passive members of the network; inviters who encourage offline friends and acquaintances to migrate online; and linkers who fully participate in the social evolution of thenetwork.
Proceedings ArticleDOI
Fast maximum margin matrix factorization for collaborative prediction
TL;DR: This work investigates a direct gradient-based optimization method for MMMF and finds that MMMf substantially outperforms all nine methods he tested and demonstrates it on large collaborative prediction problems.
Proceedings ArticleDOI
Collaborative filtering with privacy via factor analysis
TL;DR: A new method for collaborative filtering which protects the privacy of individual data is described, based on a probabilistic factor analysis model, which has other advantages in speed and storage over previous algorithms.