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

Social Circle Discovery in Ego-Networks by Mining the Latent Structure of User Connections and Profile Attributes

Published: 25 August 2015 Publication History

Abstract

Online Social Networks (OSN) allow their users to organize their friends into groups, also known as social circles. These social circles can be used to better manage who has access to users' posted content and also to control the content posted from other users that they view. Unfortunately, these social circles are generated manually and this can be a laborious process for users with more than a few friends. In this paper, we propose an approach for automatically generating social circles that takes into account both the profile information of the friends to be grouped and the social network connectivity between them, while it allows multiple membership of friends in social circles. The approach is based on an adaptation of the widely used Latent Dirichlet Allocation model and, despite the fact that it does not explicitly model social network connectivity, as other state of the art methods do, it manages to achieve results that are competitive and even better than those obtained from such methods, at a considerably lower computational cost.

References

[1]
M. Madejski, M. Johnson, and S. Bellovin, A study of privacy settings errors in an online social network, 2012 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), IEEE, 2012.
[2]
D. Blei, A. Ng, and M. Jordan, Latent Dirichlet Allocation, Journal of Machine Learning Research 3 (March 2003), 993-1022, 2003.
[3]
J. Leskovec and J. Mcauley, Learning to Discover Social Circles in Ego Networks, Advances in Neural Information Processing Systems 25, 2012.
[4]
S. Jones, and E. ONeill, Feasibility of structural network clustering for group-based privacy control in social networks, Proceedings of the 6th Symposium on Usable Privacy and Security, 2010.
[5]
X. Xu, N. Yuruk, Z. Feng and T. Schweiger, SCAN: a structural clustering algorithm for networks, In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '07). ACM, New York, NY, USA, 824-833, 2007.
[6]
P. Kelley, R. Brewer, Y. Mayer, L. Cranor, and N. Sadeh, An Investigation into Facebook Friend Grouping. Human-Computer Interaction INTERACT 2011. Lecture Notes in Computer Science Volume 6948, pp. 216--233, 2011.
[7]
E. Airoldi, D. Blei, S. Fienberg and E. Xing, Mixed Membership Stochastic Blockmodels, Journal of Machine Learning Research 9(Sep), 1981--2014, 2008.
[8]
Y. Liu, A. Niculescu-Mizil and W. Gryc, Topic-link LDA: joint models of topic and author community. In Proceedings of the 26th Annual International Conference on Machine Learning (ICML '09). ACM, New York, NY, USA, 665-672, 2009.
[9]
J. Chang and J. Boyd-Graber, Relational topic models for document networks, In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics AISTATS, 2009.
[10]
R. Balasubramanyan and W. Cohen, Block-LDA: Jointly modeling entity-annotated text and entity-entity links, In ICML 2010 Workshop on Topic Models: Structure, Applications, Evaluation, and Extensions, 2010.
[11]
A. Lancichinetti, F. Radicchi, J. Ramasco, and S. Fortunato, Finding statistically significant communities in networks. PLOS one 6, no. 4 (2011), e18961, 2011.
[12]
S. Gregory, Finding overlapping communities in networks by label propagation, New Journal of Physics 12, no. 10, 2010.
[13]
V. Blondel, J. Guillaume, R. Lambiotte and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics, 2008.
[14]
M. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical review E 69, no. 2, 2004.
[15]
M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural computation 15, no. 6, 2003.
[16]
M. Coscia, G. Rossetti, F. Giannotti and D. Pedreschi, Demon: a local-first discovery method for overlapping communities, In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 615-623. ACM, 2012.
[17]
G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature 435, 814, 2005.
[18]
E. Gilbert, and K. Karahalios, Predicting Tie Strength with Social Media, In Proceedings of the 27th International Conference on Human Factors in Computing Systems, 2009.
[19]
R. Fogues, J. Such, and A. Espinosa, BFF: A tool for eliciting tie strength and user communities in social networking services, Information Systems Frontiers 16.2, 225-237, 2014.
[20]
T. Spiliotopoulos, D. Pereira and I. Oakley, Predicting Tie Strength with the Facebook API, Proceedings of the 18th Panhellenic Conference on Informatics, 1-5, 2014.
[21]
S. Fortunato, Community Detection in Graphs, Physics Reports, 486 (3-5), 75-174, 2010.
[22]
S. Papadopoulos, Y. Kompatsiaris, A. Vakali and P. Spyridonos, Community Detection in Social Media, Data Mining and Knowledge Discovery 24, no. 3, 515-554, Springer, 2012.
[23]
M. Rosvall, and C. Bergstrom, Maps of Random Walks on Complex Networks Reveal Community Structure, Proceedings of the National Academy of Sciences (PNAS), 105, no. 4, 1118-1123, 2008.
[24]
F. Adu-Oppong, C. Gardiner, and P. Tsang, Social Circles: Tackling Privacy in Social Networks, Symposium on Usable Privacy and Security (SOUPS), 2008.
[25]
N. Mishra, R. Schreiber, I. Stanton and R. Tarjan, Clustering Social Networks, In 5th International Workshop on Algorithms and Models for the Web-Graph, LNCS volume 4863, 5667. Springer, 2007.
[26]
J. Yang, J. McAuley, and J. Leskovec, Community Detection in Networks with Node Attributes, ICDM '13, 2013.
[27]
H. Dev, M. Ali and T. Hashem, User Interaction Based Community Detection in Online Social Networks, Database Systems for Advanced Applications. LNCS volume 8422, 296-310. 2014.
[28]
T. Minka and J. Lafferty, Expectation-propagation for the generative aspect model, In Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, 2002.
[29]
C. Hurvich and C. Tsai, Regression and time series model selection in small samples, Biometrika 76, 297307, 1989.
[30]
M. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences (PNAS) 103, no. 23, 2006.
[31]
A. Streich, M. Frank, D. Basin and J. Buhmann, Multi-asignment clustering for boolean data, Journal of Machine Learning Research 13, no. 1, 459-489, 2012.
[32]
T. Yoshida, Towards finding hidden communities based on user profiles, In ICDM Workshops, 2010.
[33]
Y. Teh, M. Jordan, M. Beal, and D. Blei, Hierarchical Dirichlet Processes, Journal of the American Statistical Association 101, 15661581, 2006.
[34]
Y. Ruan, D. Fuhry and S. Parthasarathy, Efficient community detection in large networks using content and links, In Proceedings of the 22nd international conference on World Wide Web (WWW '13), 1089-1098, 2013.
[35]
Y. Zhou, H. Cheng and J. Xu Yu, Graph clustering based on structural/attribute similarities, Proceedings of the VLDB Endowment 2, no. 1 (August 2009), 718-729, 2009.

Cited By

View all
  • (2023)Rumor Detection on Social Media through Mining the Social Circles with High HomogeneityInformation Sciences10.1016/j.ins.2023.119083(119083)Online publication date: May-2023
  • (2020)Image Privacy Prediction Using Deep Neural NetworksACM Transactions on the Web10.1145/338608214:2(1-32)Online publication date: 9-Apr-2020
  • (2019)Privacy-aware Tag Recommendation for Accurate Image Privacy PredictionACM Transactions on Intelligent Systems and Technology10.1145/333505410:4(1-28)Online publication date: 12-Aug-2019
  • Show More Cited By
  1. Social Circle Discovery in Ego-Networks by Mining the Latent Structure of User Connections and Profile Attributes

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015
        August 2015
        835 pages
        ISBN:9781450338547
        DOI:10.1145/2808797
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 25 August 2015

        Permissions

        Request permissions for this article.

        Check for updates

        Qualifiers

        • Research-article
        • Research
        • Refereed limited

        Conference

        ASONAM '15
        Sponsor:

        Acceptance Rates

        Overall Acceptance Rate 116 of 549 submissions, 21%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)11
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 14 Dec 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2023)Rumor Detection on Social Media through Mining the Social Circles with High HomogeneityInformation Sciences10.1016/j.ins.2023.119083(119083)Online publication date: May-2023
        • (2020)Image Privacy Prediction Using Deep Neural NetworksACM Transactions on the Web10.1145/338608214:2(1-32)Online publication date: 9-Apr-2020
        • (2019)Privacy-aware Tag Recommendation for Accurate Image Privacy PredictionACM Transactions on Intelligent Systems and Technology10.1145/333505410:4(1-28)Online publication date: 12-Aug-2019
        • (2018)Leveraging Content Sensitiveness and User Trustworthiness to Recommend Fine-Grained Privacy Settings for Social Image SharingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2017.278798613:5(1317-1332)Online publication date: 1-May-2018
        • (2018)Ego-network probabilistic graphical model for discovering on-line communitiesApplied Intelligence10.1007/s10489-018-1137-y48:9(3038-3052)Online publication date: 1-Sep-2018
        • (2017)Inferring User Profiles in Online Social Networks Based on Convolutional Neural NetworkKnowledge Science, Engineering and Management10.1007/978-3-319-63558-3_23(274-286)Online publication date: 19-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