[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2463656.2463657acmconferencesArticle/Chapter ViewAbstractPublication PageshtConference Proceedingsconference-collections
research-article

Network activity feed: finding needles in a haystack

Published: 01 May 2013 Publication History

Abstract

Social networks have evolved over the last decade into an omni-popular phenomenon that revolutionized both the online and offline interactions. They are used for a variety of purposes and are fast becoming the place to share and discover news, activities, and content of interest. Facebook alone reports more than 1 billion users, each having on average 130 friends and connected to 80 communities, and spending on Facebook less than one hour a day. The volume of the generated content of potential interest is, thus, overwhelming and ever growing, but the time spent on the social networks is fairly limited.
How can users stay abreast of the activities of interest given this severe information overload? Activity feed is a simple mechanism deployed nowadays by many social networks, which performs information filtering on the users' behalf. Typically, activity feed encompasses reverse chronologically ordered items corresponding to activities carried out by direct friends and followees. However, activity feed can hardly cope with the volume and diversity of the activities. In order to alleviate information overload, simplify content discovery, and sustain user engagement, there is a need to personalise the activity feed, i.e., identify items of a particular interest and relevance for the user and filter out irrelevant items.
The feed personalisation task can be naturally represented as a top-K recommendation problem. Let us denote by N the set of items corresponding to activities that can potentially be included in the feed, e.g., all the activities carried out since the user's last visit. Hence, the personalisation task aims at selecting and recommending a smaller set of items, K (|K|≪|N|), corresponding to activities of the highest relevance for the user. Essentially, the recommendation process entails scoring all the |N| candidate items and selecting |K| top-scoring items.
What information can facilitate the item scoring? When interacting with a social network, users typically leave very little explicit feedback, primarily their 'likes'. There is a moderate amount of strong implicit user-to-user feedback, e.g., friending and direct communication (messages and comments), and abundance of weak implicit user-to-activity feedback, such as content viewing and contribution, community membership, and event participation. Finally, there is some self-reported and often unreliable information pertaining to user demographics, location, preferences, skills, or interests.
How can all this this information be modelled, fused, mined, and eventually leveraged for scoring and recommending activity feed items? This problem has been investigated from different angles in the recent years [1-10]. In this talk, we will overview most prominent works into the personalisation of the activity feed. These works proposed a spectrum of algorithmic approaches and evaluated them with numerous social networks of a highly heterogeneous nature. We will summarise the main components underpinning these approaches, overview the obtained findings, discuss their advantages and shortcomings, survey their combinations, analyse evaluation metrics and methodologies, and, finally, identify gaps calling for further research.

References

[1]
Gilbert, E., Karahalios, K.: Predicting Tie Strength with Social Media, CHI-2009.
[2]
Wu, A., DiMicco, J. M., Millen, D. R.: Detecting Professional versus Personal Closeness using an Enterprise Social Network Site, CHI-2010.
[3]
Chen, J., Nairn, R., Nelson, L., Bernstein, M., Chi, E. H.: Short and Tweet: Experiments on Recommending Content from Information Streams, CHI-2010.
[4]
Paek, T., Gamon, M., Counts, S., Chickering D. M., Dhesi, A.: Predicting the Importance of Newsfeed Posts and Social Network Friends, AAAI-2010.
[5]
Freyne, J., Berkovsky, S., Smith, G.: Social Networking Feeds: Recommending Items of Interest, RecSys-2010.
[6]
Chen, J., Nairn, R., Chi, E. H.: Speak Little and Well: Recommending Conversations in Online Social Streams, CHI-2011.
[7]
Guy, I., Ronen, I., Raviv, A.: Personalized Activity Streams: Sifting through the 'River of News', RecSys-2011.
[8]
Uysal, I., Croft, B. W.: User Oriented Tweet Ranking: a Filtering Approach to Microblogs, CIKM-2011.
[9]
Berkovsky, S., Freyne, J., Smith, G.,: Personalized Network Updates: Increasing Social Interactions and Contributions in Social Networks, UMAP-2012.
[10]
Grineva, M., Grinev, M.: Information Overload in Social Media Streams and the Approaches to Solve it, WWW-2012.

Cited By

View all
  • (2017)Detection of Trending Topic CommunitiesProceedings of the 28th ACM Conference on Hypertext and Social Media10.1145/3078714.3078735(205-213)Online publication date: 4-Jul-2017

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
MSM '13: Proceedings of the 4th International Workshop on Modeling Social Media
May 2013
40 pages
ISBN:9781450320078
DOI:10.1145/2463656

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2013

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

HT '13
Sponsor:

Acceptance Rates

MSM '13 Paper Acceptance Rate 3 of 12 submissions, 25%;
Overall Acceptance Rate 3 of 12 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Detection of Trending Topic CommunitiesProceedings of the 28th ACM Conference on Hypertext and Social Media10.1145/3078714.3078735(205-213)Online publication date: 4-Jul-2017

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media