Please use this identifier to cite or link to this item: https://doi.org/10.1145/2304536.2304540
Title: Towards Ad-hoc circles in Social Networking Sites
Authors: Xiao, Q.
Aung, H.H.
Tan, K.-L. 
Keywords: Algorithms
Design
Human factors
Issue Date: 2012
Citation: Xiao, Q.,Aung, H.H.,Tan, K.-L. (2012). Towards Ad-hoc circles in Social Networking Sites. Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks, DBSocial 2012 : 19-24. ScholarBank@NUS Repository. https://doi.org/10.1145/2304536.2304540
Abstract: Social Networking Sites (SNSs) allow users to publish posts to certain user-defined circles (sets of users). However, existing SNS models are limited in several ways. First, it is not practical to predefine all circles a user will ever need for disseminating her posts. Second, existing SNSs do not currently have an effecitive mechanism for a user to create and/or customize dynamic (ad-hoc) circles for each publishing session. Third, SNSs do not have features to assist users to manage and use the circles in an easy way by considering the user's ever-changing habits accordingly. In this paper, we propose a novel model for creating ad-hoc circles as needs arise. We present a recommendation framework - the Circle OpeRation RECommendaTion (CORRECT) framework - to assist users in easily utilizing our proposed model. Contrary to current SNS offerings, our proposed model does not require a user to create an extensive list of predefined circles; instead, ad-hoc circles are recommended based on a few building-block circles the user has defined and historical ad-hoc circles the user has created. Copyright 2012 ACM.
Source Title: Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks, DBSocial 2012
URI: http://scholarbank.nus.edu.sg/handle/10635/41530
ISBN: 9781450314954
DOI: 10.1145/2304536.2304540
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.