scholarly journals Private algorithms for the protected in social network search

2016 ◽  
Vol 113 (4) ◽  
pp. 913-918 ◽  
Author(s):  
Michael Kearns ◽  
Aaron Roth ◽  
Zhiwei Steven Wu ◽  
Grigory Yaroslavtsev

Motivated by tensions between data privacy for individual citizens and societal priorities such as counterterrorism and the containment of infectious disease, we introduce a computational model that distinguishes between parties for whom privacy is explicitly protected, and those for whom it is not (the targeted subpopulation). The goal is the development of algorithms that can effectively identify and take action upon members of the targeted subpopulation in a way that minimally compromises the privacy of the protected, while simultaneously limiting the expense of distinguishing members of the two groups via costly mechanisms such as surveillance, background checks, or medical testing. Within this framework, we provide provably privacy-preserving algorithms for targeted search in social networks. These algorithms are natural variants of common graph search methods, and ensure privacy for the protected by the careful injection of noise in the prioritization of potential targets. We validate the utility of our algorithms with extensive computational experiments on two large-scale social network datasets.

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Jun Long ◽  
Lei Zhu ◽  
Zhan Yang ◽  
Chengyuan Zhang ◽  
Xinpan Yuan

Vast amount of multimedia data contains massive and multifarious social information which is used to construct large-scale social networks. In a complex social network, a character should be ideally denoted by one and only one vertex. However, it is pervasive that a character is denoted by two or more vertices with different names; thus it is usually considered as multiple, different characters. This problem causes incorrectness of results in network analysis and mining. The factual challenge is that character uniqueness is hard to correctly confirm due to lots of complicated factors, for example, name changing and anonymization, leading to character duplication. Early, limited research has shown that previous methods depended overly upon supplementary attribute information from databases. In this paper, we propose a novel method to merge the character vertices which refer to the same entity but are denoted with different names. With this method, we firstly build the relationship network among characters based on records of social activities participating, which are extracted from multimedia sources. Then we define temporal activity paths (TAPs) for each character over time. After that, we measure similarity of the TAPs for any two characters. If the similarity is high enough, the two vertices should be considered as the same character. Based on TAPs, we can determine whether to merge the two character vertices. Our experiments showed that this solution can accurately confirm character uniqueness in large-scale social network.


Author(s):  
Michele A. Brandão ◽  
Matheus A. Diniz ◽  
Guilherme A. de Sousa ◽  
Mirella M. Moro

Studies have analyzed social networks considering a plethora of metrics for different goals, from improving e-learning to recommend people and things. Here, we focus on large-scale social networks defined by researchers and their common published articles, which form co-authorship social networks. Then, we introduce CNARe, an online tool that analyzes the networks and present recommendations of collaborations based on three different algorithms (Affin, CORALS and MVCWalker). Through visualizations and social networks metrics, CNARe also allows to investigate how the recommendations affect the co-authorship social networks, how researchers' networks are in a central and eagle-eye context, and how the strength of ties behaves in large co-authorship social networks. Furthermore, users can upload their own network in CNARe and make their own recommendation and social network analysis.


Author(s):  
I.T. Hawryszkiewycz

The chapter provides a way for modeling large scale collaboration using an extension to social network diagrams called enterprise social networks (ESNs). The chapter uses the ESN diagrams to describe activities in policy planning and uses these to define the services to be provided by cloud technologies to support large scale collaboration. This chapter describes collaboration by an architecture made up of communities each with a role to ensure that collaboration is sustainable. The architecture is based on the idea of an ensemble of communities all working to a common vision supported by services provided by the collaboration cloud using Web 2.0 technologies.


2020 ◽  
Vol 39 (4) ◽  
pp. 5253-5262
Author(s):  
Xiaoxian Zhang ◽  
Jianpei Zhang ◽  
Jing Yang

The problems caused by network dimension disasters and computational complexity have become an important issue to be solved in the field of social network research. The existing methods for network feature learning are mostly based on static and small-scale assumptions, and there is no modified learning for the unique attributes of social networks. Therefore, existing learning methods cannot adapt to the dynamic and large-scale of current social networks. Even super large scale and other features. This paper mainly studies the feature representation learning of large-scale dynamic social network structure. In this paper, the positive and negative damping sampling of network nodes in different classes is carried out, and the dynamic feature learning method for newly added nodes is constructed, which makes the model feasible for the extraction of structural features of large-scale social networks in the process of dynamic change. The obtained node feature representation has better dynamic robustness. By selecting the real datasets of three large-scale dynamic social networks and the experiments of dynamic link prediction in social networks, it is found that DNPS has achieved a large performance improvement over the benchmark model in terms of prediction accuracy and time efficiency. When the α value is around 0.7, the model effect is optimal.


2020 ◽  
Author(s):  
Kumaran P ◽  
Rajeswari Sridhar

Abstract Online social networks (OSNs) is a platform that plays an essential role in identifying misinformation like false rumors, insults, pranks, hoaxes, spear phishing and computational propaganda in a better way. Detection of misinformation finds its applications in areas such as law enforcement to pinpoint culprits who spread rumors to harm the society, targeted marketing in e-commerce to identify the user who originates dissatisfaction messages about products or services that harm an organizations reputation. The process of identifying and detecting misinformation is very crucial in complex social networks. As misinformation in social network is identified by designing and placing the monitors, computing the minimum number of monitors for detecting misinformation is a very trivial work in the complex social network. The proposed approach determines the top suspected sources of misinformation using a tweet polarity-based ranking system in tandem with sarcasm detection (both implicit and explicit sarcasm) with optimization approaches on large-scale incomplete network. The algorithm subsequently uses this determined feature to place the minimum set of monitors in the network for detecting misinformation. The proposed work focuses on the timely detection of misinformation by limiting the distance between the suspected sources and the monitors. The proposed work also determines the root cause of misinformation (provenance) by using a combination of network-based and content-based approaches. The proposed work is compared with the state-of-art work and has observed that the proposed algorithm produces better results than existing methods.


Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu

The evolution analysis of community structure of social network will help us understand the composition of social organizations and the evolution of society better. In order to discover the community structure and the regularity of community evolution in large-scale social networks, this paper analyzes the formation process and influencing factors of communities, and proposes a community evolution analysis method of crowd attraction driven. This method uses the traditional community division method to divide the basic community, and introduces the theory of information propagation into complex network to simulate the information propagation of dynamic social networks. Then defines seed node, the activity of basic community and crowd attraction to research the influence of groups on individuals in social networks. Finally, making basic communities as fixed groups in the network and proposing community detection algorithm based on crowd attraction. Experimental results show that the scheme can effectively detect and identify the community structure in large-scale social networks.


Author(s):  
Silvana Rossy de Brito ◽  
Aleksandra do Socorro da Silva ◽  
Dalton Lopes Martins ◽  
Cláudio Alex Jorge da Rocha ◽  
João Crisóstomo Weyl Albuquerque Costa ◽  
...  

This chapter summarizes several previous studies on the analysis of social networks and presents some challenges in monitoring and evaluating large-scale training programs that make use of social networks. The main objective is to understand the dynamics and identify how information is shared among the participating agents of the training program. In this regard, the authors present various algorithms that apply metrics to social network analysis to assess the evolution of networks throughout the training process, and specifically, to discuss the application of these metrics in the evaluation of large-scale training programs for digital inclusion.


Author(s):  
Roby Muhamad

Social network concerns the study of the structure of the patterns of relations among social entities. The study of social networks has a long history starting around 1930s when psychologist Moreno conducted the first known sociometric survey. Since then, the field of social network, first developed in sociology, has grown both empirically and theoretically, especially toward the end of the last century. The advent of powerful computing power and the Internet spurred growth on social network research. This combination of the proliferation of digital traces and increases in computing power provides opportunities to study large scale social networks and relevant dynamics.


PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0244619
Author(s):  
Amaia Albizua ◽  
Elena M. Bennett ◽  
Guillaume Larocque ◽  
Robert W. Krause ◽  
Unai Pascual

The social-ecological effects of agricultural intensification are complex. We explore farmers’ perceptions about the impacts of their land management and the impact of social information flows on their management through a case study in a farming community in Navarra, Spain, that is undergoing agricultural intensification due to adoption of large scale irrigation. We found that modern technology adopters are aware that their management practices often have negative social-ecological implications; by contrast, more traditional farmers tend to recognize their positive impacts on non-material benefits such as those linked with traditions and traditional knowledge, and climate regulation. We found that farmers’ awareness about nature contributions to people co-production and their land management decisions determine, in part, the structure of the social networks among the farming community. Since modern farmers are at the core of the social network, they are better able to control the information flow within the community. This has important implications, such as the fact that the traditional farmers, who are more aware of their impacts on the environment, rely on information controlled by more intensive modern farmers, potentially jeopardizing sustainable practices in this region. We suggest that this might be counteracted by helping traditional farmers obtain information tailored to their practices from outside the social network.


2020 ◽  
Vol 17 (171) ◽  
pp. 20200667
Author(s):  
Raiyan Abdul Baten ◽  
Daryl Bagley ◽  
Ashely Tenesaca ◽  
Famous Clark ◽  
James P. Bagrow ◽  
...  

Creativity is viewed as one of the most important skills in the context of future-of-work. In this paper, we explore how the dynamic (self-organizing) nature of social networks impacts the fostering of creative ideas. We run six trials ( N = 288) of a web-based experiment involving divergent ideation tasks. We find that network connections gradually adapt to individual creative performances, as the participants predominantly seek to follow high-performing peers for creative inspirations. We unearth both opportunities and bottlenecks afforded by such self-organization. While exposure to high-performing peers is associated with better creative performances of the followers, we see a counter-effect that choosing to follow the same peers introduces semantic similarities in the followers’ ideas. We formulate an agent-based simulation model to capture these intuitions in a tractable manner, and experiment with corner cases of various simulation parameters to assess the generality of the findings. Our findings may help design large-scale interventions to improve the creative aptitude of people interacting in a social network.


Sign in / Sign up

Export Citation Format

Share Document