Bay-Yuan Hsu
ABSTRACT
The data of egocentric networks (ego networks) are very important for evaluating and validating the algorithms and machine learning approaches in Online Social Networks (OSNs). Nevertheless, obtaining the ego network data from OSNs is not a trivial task. Conventional manual approaches are time-consuming, and only a small number of users would agree to contribute their data. This is because there are two important factors that should be considered simultaneously for this data acquisition task: i) users' willingness to contribute their data, and ii) the structure of the ego network. However, addressing the above two factors to obtain the more complete ego network data has not received much research attention. Therefore, in this paper, we make our first attempt to address this issue by proposing a new research problem, named Willingness Maximization for Ego Network Extraction in Online Social Networks (WMEgo), to identify a set of ego networks from the OSN such that the willingness of the users to contribute their data is maximized. We prove that WMEgo is NP-hard and propose a 1/2*(1 1/e)-approximation algorithm, named Ego Network Identification with Maximum Willingness (EIMW). We conduct an evaluation study with 672 volunteers to validate the proposed WMEgo and EIMW, and perform extensive experiments on multiple real datasets to demonstrate the effectiveness and efficiency of our approach.
Supplemental Material
- Nesreen K Ahmed, Nick Duffield, Theodore L Willke, and Ryan A Rossi. 2017. On sampling from massive graph streams. Proceedings of the VLDB Endowment, Vol. 10, 11 (2017), 1430--1441.Google Scholar
Digital Library
- Nesreen K Ahmed, Jennifer Neville, and Ramana Kompella. 2014. Network sampling: From static to streaming graphs. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 8, 2 (2014), 7.Google ScholarDigital Library
- Norbert Blenn, Christian Doerr, Bas Van Kester, and Piet Van Mieghem. 2012. Crawling and detecting community structure in online social networks using local information. In International Conference on Research in Networking. Springer, 56--67.Google ScholarDigital Library
- Francesco Bonchi, Arijit Khan, and Lorenzo Severini. 2019. Distance-generalized Core Decomposition. In Proceedings of the 2019 International Conference on Management of Data. ACM, 1006--1023.Google ScholarDigital Library
- Nicholas A Christakis and James H Fowler. 2007. The spread of obesity in a large social network over 32 years. New England journal of medicine, Vol. 357, 4 (2007), 370--379.Google Scholar
- Maximilien Danisch, T-H Hubert Chan, and Mauro Sozio. 2017. Large scale density-friendly graph decomposition via convex programming. In Proceedings of the 26th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 233--242.Google ScholarDigital Library
- Abir De, Isabel Valera, Niloy Ganguly, Sourangshu Bhattacharya, and Manuel Gomez Rodriguez. 2016. Learning and forecasting opinion dynamics in social networks. In Advances in Neural Information Processing Systems. 397--405.Google Scholar
- Yixiang Fang, Reynold Cheng, Siqiang Luo, and Jiafeng Hu. 2016. Effective community search for large attributed graphs. Proceedings of the VLDB Endowment, Vol. 9, 12 (2016), 1233--1244.Google ScholarDigital Library
- Uriel Feige, David Peleg, and Guy Kortsarz. 2001. The dense k-subgraph problem. Algorithmica, Vol. 29, 3 (2001), 410--421.Google ScholarDigital Library
- Minas Gjoka, Maciej Kurant, Carter T Butts, and Athina Markopoulou. 2011. Practical recommendations on crawling online social networks. IEEE Journal on Selected Areas in Communications, Vol. 29, 9 (2011), 1872--1892.Google ScholarCross Ref
- Reinhard Heckel, Michail Vlachos, Thomas Parnell, and Celestine Dünner. 2017. Scalable and interpretable product recommendations via overlapping co-clustering. In 2017 IEEE 33rd International Conference on Data Engineering (ICDE). IEEE, 1033--1044.Google ScholarCross Ref
- Stephen T Hedetniemi and Renu C Laskar. 1991. Bibliography on domination in graphs and some basic definitions of domination parameters. In Annals of Discrete Mathematics. Vol. 48. Elsevier, 257--277.Google Scholar
- Bay-Yuan Hsu, Yi-Feng Lan, and Chih-Ya Shen. 2018. On automatic formation of effective therapy groups in social networks. IEEE Transactions on Computational Social Systems, Vol. 5, 3 (2018), 713--726.Google ScholarCross Ref
- Bay-Yuan Hsu, Chia-Lin Tu, Ming-Yi Chang, and Chih-Ya Shen. 2019. On crawling community-aware online social network data. In Proceedings of the 30th ACM Conference on Hypertext and Social Media. 265--266.Google ScholarDigital Library
- Xin Huang, Hong Cheng, Lu Qin, Wentao Tian, and Jeffrey Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data. ACM, 1311--1322.Google ScholarDigital Library
- Xin Huang, Laks VS Lakshmanan, Jeffrey Xu Yu, and Hong Cheng. 2015. Approximate closest community search in networks. Proceedings of the VLDB Endowment, Vol. 9, 4 (2015), 276--287.Google ScholarDigital Library
- Nadin Kökciyan and Pinar Yolum. 2016. Priguard: A semantic approach to detect privacy violations in online social networks. IEEE Transactions on Knowledge and Data Engineering, Vol. 28, 10 (2016), 2724--2737.Google ScholarDigital Library
- Pankaj Kumar and Akbar Zaheer. 2019. Ego-network stability and innovation in alliances. Academy of Management Journal, Vol. 62, 3 (2019), 691--716.Google ScholarCross Ref
- Ricky Laishram, Jeremy D Wendt, and Sucheta Soundarajan. 2019. Crawling the Community Structure of Multiplex Networks. In AAAI.Google Scholar
- Jure Leskovec, Kevin J Lang, Anirban Dasgupta, and Michael W Mahoney. 2009. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, Vol. 6, 1 (2009), 29--123.Google ScholarCross Ref
- Jure Leskovec and Julian J Mcauley. 2012. Learning to discover social circles in ego networks. In Advances in neural information processing systems. 539--547.Google Scholar
- Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. 2015. Influential community search in large networks. Proceedings of the VLDB Endowment, Vol. 8, 5 (2015), 509--520.Google ScholarDigital Library
- Xiang-Yang Li, Chunhong Zhang, Taeho Jung, Jianwei Qian, and Linlin Chen. 2016. Graph-based privacy-preserving data publication. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, 1--9.Google ScholarDigital Library
- Ye Li, Chaofeng Sha, Xin Huang, and Yanchun Zhang. 2018. Community detection in attributed graphs: an embedding approach. In Thirty-Second AAAI Conference on Artificial Intelligence.Google ScholarCross Ref
- Peter J. Mucha, Thomas Richardson, Kevin Macon, Mason A. Porter, and Jukka-Pekka Onnela. 2010. Community structure in time-dependent, multiscale, and multiplex networks. Science, Vol. 328, 5980 (2010), 876--878.Google Scholar
- Leonardo FR Ribeiro, Pedro HP Saverese, and Daniel R Figueiredo. 2017. Struc2vec: Learning node representations from structural identity. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 385--394.Google ScholarDigital Library
- J Niels Rosenquist, James H Fowler, and Nicholas A Christakis. 2011. Social network determinants of depression. Molecular psychiatry, Vol. 16, 3 (2011), 273.Google Scholar
- Ahmet Erdem Sariyüce and Ali Pinar. 2016. Fast hierarchy construction for dense subgraphs. Proceedings of the VLDB Endowment, Vol. 10, 3 (2016), 97--108.Google ScholarDigital Library
- David R Schaefer, Olga Kornienko, and Andrew M Fox. 2011. Misery does not love company: Network selection mechanisms and depression homophily. American Sociological Review, Vol. 76, 5 (2011), 764--785.Google ScholarCross Ref
- Chih-Ya Shen, CP Kankeu Fotsing, Yi-Shin Chen, Wang-chien Lee, et al. 2018. On organizing online soirees with live multi-streaming. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018. AAAI press, 151--159.Google ScholarCross Ref
- Chih-Ya Shen, Hong-Han Shuai, De-Nian Yang, Yi-Feng Lan, Wang-Chien Lee, Philip S Yu, and Ming-Syan Chen. 2015. Forming online support groups for internet and behavior related addictions. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. 163--172.Google ScholarDigital Library
- Chih-Ya Shen, De-Nian Yang, Wang-Chien Lee, and Ming-Syan Chen. 2016. Spatial-proximity optimization for rapid task group deployment. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 10, 4 (2016), 1--36.Google Scholar
- Jaewon Yang and Jure Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems, Vol. 42, 1 (2015), 181--213.Google ScholarDigital Library
- Shaozhi Ye, Juan Lang, and Felix Wu. 2010. Crawling online social graphs. In Proceedings of the 2010 12th International Asia-Pacific Web Conference. 236--242.Google ScholarDigital Library
- Daokun Zhang, Jie Yin, Xingquan Zhu, and Chengqi Zhang. 2017a. User profile preserving social network embedding. In IJCAI International Joint Conference on Artificial Intelligence.Google ScholarCross Ref
- Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2017b. When engagement meets similarity: efficient (k, r)-core computation on social networks. Proceedings of the VLDB Endowment, Vol. 10, 10 (2017), 998--1009.Google ScholarDigital Library
- Dingyuan Zhu, Peng Cui, Daixin Wang, and Wenwu Zhu. 2018. Deep variational network embedding in wasserstein space. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, 2827--2836.Google ScholarDigital Library
Index Terms
- WMEgo: Willingness Maximization for Ego Network Data Extraction in Online Social Networks
Recommendations
Ego network structure in online social networks and its impact on information diffusion
In the last few years, Online Social Networks (OSNs) attracted the interest of a large number of researchers, thanks to their central role in the society. Through the analysis of OSNs, many social phenomena have been studied, such as the viral diffusion ...
Ego-net digger: a new way to study ego networks in online social networks
HotSocial '12: Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks ResearchThe vast proliferation of Online Social Networks (OSN) is generating many new ways to interact and create social relationships with others. While substantial results have been obtained in anthropology literature describing the properties of human social ...
Towards a characterization of egocentric networks in online social networks
OTM'11: Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systemsOnline Social Networks (OSNs) are more and more establishing as one of the key means to create and enforce social relationships between individuals. While substantial results have been obtained in the anthropology literature describing the properties of ...
Comments