Social Network

2012 ◽  
pp. 8-24
Author(s):  
Roby Muhamad
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Large Scale ◽  
The Internet ◽  
Computing Power ◽  
Network Research ◽  
Social Entities

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.

MapTap and Cornelia Slow Digital Art History and Formal Art Historical Social Network Research

2016 ◽  
Vol 79 (3) ◽  
pp. 315-330 ◽  
Author(s):  
Koenraad Brosens ◽  
Klara Alen ◽  
Astrid Slegten ◽  
Fred Truyen
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Early Modern ◽  
Data Model ◽  
Art History ◽  
Digital Art ◽  
Unique Data ◽  
Network Research ◽  
Custom Made

Abstract The essay introduces MapTap, a research project that zooms in on the ever-changing social networks underpinning Flemish tapestry (1620 – 1720). MapTap develops the young and still slightly amorphous field of Formal Art Historical Social Network Research (FAHSNR) and is fueled by Cornelia, a custom-made database. Cornelia’s unique data model allows researchers to organize attribution and relational data from a wide array of sources in such a way that the complex multiplex and multimode networks emerging from the data can be transformed into partial unimode networks that enable proper FAHSNR. A case study revealing the key roles played by women in the tapestry landscape shows how this kind of slow digital art history can further our understanding of early modern creative communities and industries.

scholarly journals Temporal Activity Path Based Character Correction in Heterogeneous Social Networks via Multimedia Sources

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Jun Long ◽  
Lei Zhu ◽  
Zhan Yang ◽  
Chengyuan Zhang ◽  
Xinpan Yuan
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Large Scale ◽  
Multimedia Data ◽  
Attribute Information ◽  
Novel Method ◽  
Relationship Network ◽  
Heterogeneous Social Networks ◽  
The Relationship ◽  
Over Time

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.

Analyzing Social Networks to Mine Important Friends

2013 ◽  
pp. 90-104 ◽  
Author(s):  
Carson K.-S. Leung ◽  
Irish J. M. Medina ◽  
Syed K. Tanbeer
Keyword(s):  
Social Networks ◽  
Social Media ◽  
Social Network ◽  
Social Networking Sites ◽  
Web Based ◽  
The Social ◽  
Social Entity ◽  
Social Entities ◽  
Media Data ◽  
Media Mining

The emergence of Web-based communities and social networking sites has led to a vast volume of social media data, embedded in which are rich sets of meaningful knowledge about the social networks. Social media mining and social network analysis help to find a systematic method or process for examining social networks and for identifying, extracting, representing, and exploiting meaningful knowledge—such as interdependency relationships among social entities in the networks—from the social media. This chapter presents a system for analyzing the social networks to mine important groups of friends in the networks. Such a system uses a tree-based mining approach to discover important friend groups of each social entity and to discover friend groups that are important to social entities in the entire social network.

Visualizing Co-Authorship Social Networks and Collaboration Recommendations With CNARe

2018 ◽  
pp. 173-188
Author(s):  
Michele A. Brandão ◽  
Matheus A. Diniz ◽  
Guilherme A. de Sousa ◽  
Mirella M. Moro
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Network Analysis ◽  
Network Analysis ◽  
Large Scale ◽  
Online Tool ◽  
Strength Of Ties ◽  
E Learning

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.

Extending Social Network Diagrams for Large Scale Collaboration

2012 ◽  
pp. 1-13
Author(s):  
I.T. Hawryszkiewycz
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Web 2.0 ◽  
Large Scale ◽  
Policy Planning ◽  
Web 2.0 Technologies ◽  
Enterprise Social Networks ◽  
Cloud Technologies ◽  
Common Vision ◽  
Network Diagrams

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.

Large-scale dynamic social data representation for structure feature learning

2020 ◽  
Vol 39 (4) ◽  
pp. 5253-5262
Author(s):  
Xiaoxian Zhang ◽  
Jianpei Zhang ◽  
Jing Yang
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Large Scale ◽  
Dynamic Change ◽  
Feature Learning ◽  
Data Representation ◽  
Feature Representation ◽  
Small Scale ◽  
Dynamic Feature ◽  
Dynamic Social Networks

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.

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
Keyword(s):  
Infectious Disease ◽  
Social Networks ◽  
Social Network ◽  
Data Privacy ◽  
Large Scale ◽  
Graph Search ◽  
Medical Testing ◽  
Background Checks ◽  
Network Search ◽  
Natural Variants

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.

Prediction of Social Influence for Provenance of Misinformation in Online Social Network Using Big Data Approach

2020 ◽  
Author(s):  
Kumaran P ◽  
Rajeswari Sridhar
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Law Enforcement ◽  
Online Social Networks ◽  
Large Scale ◽  
Online Social Network ◽  
Root Cause ◽  
Minimum Number ◽  
Targeted Marketing ◽  
Implicit And Explicit

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.

scholarly journals Federal Synergy Computing Model Based on Network Interconnection

2020 ◽  
Author(s):  
Sorush Niknamian
Keyword(s):  
Large Scale ◽  
Heterogeneous Computing ◽  
Computation Time ◽  
Research Problem ◽  
Computing System ◽  
The Internet ◽  
Collaborative Computing ◽  
Computing Power ◽  
Network Interconnection ◽  
Computing Model

Abstract: To solve the shortage problem of the computing power provided by the single machine or the small cluster system in scientific research, we offer a collaborative computing system for users. This system has massive operation ability. It introduced a scalable mixed collaborative computing model. Through the internet and the heterogeneous computing equipment, the system uses the task decomposition model. This system can solve the research and development problem because of the shortage of capacity. To test the model, a subtask decomposition example is used. The results of the example analysis show that the computing work can obtain the shortest computation time when the number of calculation nodes is more than the number of subtasks; Maximum calculation efficiency can be achieved when the number of the calculating nodes closes to the number of subtasks. Through joint collaborative computing, the extensible mixed collaborative computing mode can effectively solve the mass computing problem for the system with heterogeneous hardware and software. This paper provides the reference for the system, which provides large scale computing power through the Internet and the research problem of due to the lack of computing ability.

scholarly journals Federal Synergy Computing Model Based on Network Interconnection

2020 ◽  
Author(s):  
Sorush Niknamian
Keyword(s):  
Large Scale ◽  
Heterogeneous Computing ◽  
Computation Time ◽  
Research Problem ◽  
Computing System ◽  
The Internet ◽  
Collaborative Computing ◽  
Computing Power ◽  
Network Interconnection ◽  
Computing Model

To solve the shortage problem of the computing power provided by the single machine or the small cluster system in scientific research, we offer a collaborative computing system for users. This system has massive operation ability. It introduced a scalable mixed collaborative computing model. Through the internet and the heterogeneous computing equipment, the system uses the task decomposition model. This system can solve the research and development problem because of the shortage of capacity. To test the model, a subtask decomposition example is used. The results of the example analysis show that the computing work can obtain the shortest computation time when the number of calculation nodes is more than the number of subtasks; Maximum calculation efficiency can be achieved when the number of the calculating nodes closes to the number of subtasks. Through joint collaborative computing, the extensible mixed collaborative computing mode can effectively solve the mass computing problem for the system with heterogeneous hardware and software. This paper provides the reference for the system, which provides large scale computing power through the Internet and the research problem of due to the lack of computing ability.

Sign in / Sign up

Export Citation Format

Share Document