scholarly journals A novel similarity measure for missing link prediction in social networks

Author(s):  
Gogulamudi Naga Chandrika ◽  
E. Srinivasa Reddy

<p><span>Social Networks progress over time by the addition of new nodes and links, form associations with one community to the other community. Over a few decades, the fast expansion of Social Networks has attracted many researchers to pay more attention towards complex networks, the collection of social data, understand the social behaviors of complex networks and predict future conflicts. Thus, Link prediction is imperative to do research with social networks and network theory. The objective of this research is to find the hidden patterns and uncovered missing links over complex networks. Here, we developed a new similarity measure to predict missing links over social networks. The new method is computed on common neighbors with node-to-node distance to get better accuracy of missing link prediction. </span><span>We tested the proposed measure on a variety of real-world linked datasets which are formed from various linked social networks. The proposed approach performance is compared with contemporary link prediction methods. Our measure makes very effective and intuitive in predicting disappeared links in linked social networks.</span></p>

2022 ◽  
Vol 2022 ◽  
pp. 1-9
Author(s):  
Huazhang Liu

With the rapid development of the Internet, social networks have shown an unprecedented development trend among college students. Closer social activities among college students have led to the emergence of college students with new social characteristics. The traditional method of college students’ group classification can no longer meet the current demand. Therefore, this paper proposes a social network link prediction method-combination algorithm, which combines neighbor information and a random block. By mining the social networks of college students’ group relationships, the classification of college students’ groups can be realized. Firstly, on the basis of complex network theory, the essential relationship of college student groups under a complex network is analyzed. Secondly, a new combination algorithm is proposed by using the simplest linear combination method to combine the proximity link prediction based on neighbor information and the likelihood analysis link prediction based on a random block. Finally, the proposed combination algorithm is verified by using the social data of college students’ networks. Experimental results show that, compared with the traditional link prediction algorithm, the proposed combination algorithm can effectively dig out the group characteristics of social networks and improve the accuracy of college students’ association classification.


Author(s):  
Diane Harris Cline

This chapter views the “Periclean Building Program” through the lens of Actor Network Theory, in order to explore the ways in which the construction of these buildings transformed Athenian society and politics in the fifth century BC. It begins by applying some Actor Network Theory concepts to the process that was involved in getting approval for the building program as described by Thucydides and Plutarch in his Life of Pericles. Actor Network Theory blends entanglement (human-material thing interdependence) with network thinking, so it allows us to reframe our views to include social networks when we think about the political debate and social tensions in Athens that arose from Pericles’s proposal to construct the Parthenon and Propylaea on the Athenian Acropolis, the Telesterion at Eleusis, the Odeon at the base of the South slope of the Acropolis, and the long wall to Peiraeus. Social Network Analysis can model the social networks, and the clusters within them, that existed in mid-fifth century Athens. By using Social Network Analysis we can then show how the construction work itself transformed a fractious city into a harmonious one through sustained, collective efforts that engaged large numbers of lower class citizens, all responding to each other’s needs in a chaine operatoire..


Author(s):  
Lars Steiner

A new knowledge management perspective and tool, ANT/AUTOPOIESIS, for analysis of knowledge management in knowledge-intensive organizations is presented. An information technology (IT) research and innovation co-operation between university actors and companies interested in the area of smart home IT applications is used to illustrate analysis using this perspective. Actor-network theory (ANT) and the social theory of autopoiesis are used in analyzing knowledge management, starting from the foundation of a research co-operation. ANT provides the character of relations between actors and actants, how power is translated by actors and the transformation of relations over time. The social theory of autopoiesis provides the tools to analyze organizational closure and reproduction of organizational identity. The perspective used allows a process analysis, and at the same time analysis of structural characteristics of knowledge management. Knowledge management depends on powerful actors, whose power changes over time. Here this power is entrepreneurial and based on relations and actors’ innovation knowledge.


2017 ◽  
Vol 31 (02) ◽  
pp. 1650254 ◽  
Author(s):  
Shuxin Liu ◽  
Xinsheng Ji ◽  
Caixia Liu ◽  
Yi Bai

Many link prediction methods have been proposed for predicting the likelihood that a link exists between two nodes in complex networks. Among these methods, similarity indices are receiving close attention. Most similarity-based methods assume that the contribution of links with different topological structures is the same in the similarity calculations. This paper proposes a local weighted method, which weights the strength of connection between each pair of nodes. Based on the local weighted method, six local weighted similarity indices extended from unweighted similarity indices (including Common Neighbor (CN), Adamic-Adar (AA), Resource Allocation (RA), Salton, Jaccard and Local Path (LP) index) are proposed. Empirical study has shown that the local weighted method can significantly improve the prediction accuracy of these unweighted similarity indices and that in sparse and weakly clustered networks, the indices perform even better.


1998 ◽  
Vol 02 (02) ◽  
pp. 183-199 ◽  
Author(s):  
Ian Graham

This paper uses Callon's actor network theory (ANT) to analyse the emergence of an inter-organisational network innovation: electronic livestock auction systems in the United Kingdom. It is based on a study of the development of these systems by drawing on interviews with developers, operators and users of the competing systems and focusing on the social networks that evolved in their conception and adoption. The validity of ANT as a framework for the analysis of innovation is critically considered. The paper concludes that complexity and barriers to network building led the networks to be constructed from existing components and social linkages, thereby limiting the potential of the innovation to incorporate radical change in the social structure.


As Internet technologies develop continuously social networks are getting more popular day by day. People are connected with each other via virtual applications. Using the Link Prediction in social networks more people get connected, may be they are friends, may be work together at the same workplace and may be their education are. Machine learning techniques are used to analyze the link between the nodes of the network and also create a better link prediction model through deep learning. The objective of this research is to measure the performance using the different techniques to predict link between the social networks. Using deep learning, feature engineering can be reduced for link prediction. In this research, the feature based learning is used to predict the link for better performance. Dataset is obtained by scraping the profile of Facebook users and they are used along with the random forest and graph convolution neural network to measure the performance of link prediction in social networks.


2020 ◽  
Vol 34 (02) ◽  
pp. 1878-1885
Author(s):  
Matteo Castiglioni ◽  
Diodato Ferraioli ◽  
Nicola Gatti

We focus on the scenario in which messages pro and/or against one or multiple candidates are spread through a social network in order to affect the votes of the receivers. Several results are known in the literature when the manipulator can make seeding by buying influencers. In this paper, instead, we assume the set of influencers and their messages to be given, and we ask whether a manipulator (e.g., the platform) can alter the outcome of the election by adding or removing edges in the social network. We study a wide range of cases distinguishing for the number of candidates or for the kind of messages spread over the network. We provide a positive result, showing that, except for trivial cases, manipulation is not affordable, the optimization problem being hard even if the manipulator has an unlimited budget (i.e., he can add or remove as many edges as desired). Furthermore, we prove that our hardness results still hold in a reoptimization variant, where the manipulator already knows an optimal solution to the problem and needs to compute a new solution once a local modification occurs (e.g., in bandit scenarios where estimations related to random variables change over time).


Sign in / Sign up

Export Citation Format

Share Document