Analysis of Saudi Arabian Social Network Using Analytic Measures and Community Detection

Recently, Social Network Analysis has received an enormous popularity in the field of social and computer sciences. The majority of the studied problems have concentrated on research of information diffusion and social influence. The aim of this research is to analyze the Saudi Arabian social network to measure its capability for information diffusion. We are targeting Saudi Arabian social network because of its importance within Arab region. It is considered the most dominant and influence among the others. Social Network Analysis measures (degree, closeness, betweenness, and eigenvector). Community detection, on the other hand, has guaranteed its ability in identifying corresponding community depends on social properties, network structure, or influencers interests. In this article, Griven-Newman community detection algorithm has been adopted to identify the corresponding community. It has been tested and visualized using NodeXL tool. Experiment was applied on Twitter users. The communities resulted and analysis measures' results showed the suitability of the Saudi Arabian network for information diffusion.

InfoFlow: Mining Information Flow Based on User Community in Social Networking Services

Online social networking services (SNSs) have emerged rapidly and have become huge data sources for social network analysis. The spread of the content generated by users is crucial in SNS, but there is only a handful of research works on information diffusion and, more precisely, information diffusion flow. In this paper, we propose a novel method to discover information diffusion processes from SNS data. The method starts preprocessing the SNS data using a user-centric algorithm of community detection based on modularity maximization with the purpose of reducing the complexity of the noisy data. After that, the InfoFlow miner generates information diffusion flow models among the user communities discovered from the data. The algorithm is an extension of a traditional process discovery technique called the Flexible Heuristics miner, but the visualization ability of the generated process model is improved with a new measure called response weight, which effectively captures and represents the interactions among communities. An experiment with Facebook data was conducted, and information flow among user communities was visualized. Additionally, a quality assessment of the models was carried out to demonstrate the effectiveness of the method. The final constructed models allowed us to identify useful information such as how the information flows between communities and information disseminators and receptors within communities.11Ysciescopu

Dynamic Core Community Detection and Information Diffusion Processes on Networks

Interest in network science has been increasingly shared among various research communities due to its broad range of applications. Many real world systems can be abstracted as networks, a group of nodes connected by pairwise edges, and examples include friendship networks, metabolic networks, and world wide web among others. Two of the main research areas in network science that have received a lot of focus are community detection and information diffusion. As for community detection, many well developed algorithms are available for such purposes in static networks, for example, spectral partitioning and modularity function based optimization algorithms. As real world data becomes richer, community detection in temporal networks becomes more and more desirable and algorithms such as tensor decomposition and generalized modularity function optimization are developed. One scenario not well investigated is when the core community structure persists over long periods of time with possible noisy perturbations and changes only over periods of small time intervals. The contribution of this thesis in this area is to propose a new algorithm based on low rank component recovery of adjacency matrices so as to identify the phase transition time points and improve the accuracy of core community structure recovery. As for information diffusion, traditionally it was studied using either threshold models or independent interaction models as an epidemic process. But information diffusion mechanism is different from epidemic process such as disease transmission because of the reluctance to tell stale news and to address this issue other models such as DK model was proposed taking into consideration of the reluctance of spreaders to diffuse the information as time goes by. However, this does not capture some cases such as the losing interest of information receivers as in viral marketing. The contribution of this thesis in this area is we proposed two new models coined susceptible-informed-immunized (SIM) model and exponentially time decaying susceptible-informed (SIT) model to successfully capture the intrinsic time value of information from both the spreader and receiver points of view. Rigorous analysis of the dynamics of the two models were performed based mainly on mean field theory. The third contribution of this thesis is on the information diffusion optimization. Controlling information diffusion has been widely studied because of its important applications in areas such as social census, disease control and marketing. Traditionally the problem is formulated as identifying the set of k seed nodes, informed initially, so as to maximize the diffusion size. Heuristic algorithms have been developed to find approximate solutions for this NP-hard problem, and measures such as k-shell, node degree and centrality have been used to facilitate the searching for optimal solutions. The contribution of this thesis in this field is to design a more realistic objective function and apply binary particle swarm optimization algorithm for this combinatorial optimization problem. Instead of fixating the seed nodes size and maximize the diffusion size, we maximize the profit defined as the revenue, which is simply the diffusion size, minus the cost of setting those seed nodes, which is designed as a function of degrees of the seed nodes or a measure that is similar to the centrality of nodes. Because of the powerful algorithm, we were able to study complex scenarios such as information diffusion optimization on multilayer networks.PHDPhysicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/145937/1/wbao_1.pd

LATTE: Application Oriented Social Network Embedding

In recent years, many research works propose to embed the network structured data into a low-dimensional feature space, where each node is represented as a feature vector. However, due to the detachment of embedding process with external tasks, the learned embedding results by most existing embedding models can be ineffective for application tasks with specific objectives, e.g., community detection or information diffusion. In this paper, we propose study the application oriented heterogeneous social network embedding problem. Significantly different from the existing works, besides the network structure preservation, the problem should also incorporate the objectives of external applications in the objective function. To resolve the problem, in this paper, we propose a novel network embedding framework, namely the "appLicAtion orienTed neTwork Embedding" (Latte) model. In Latte, the heterogeneous network structure can be applied to compute the node "diffusive proximity" scores, which capture both local and global network structures. Based on these computed scores, Latte learns the network representation feature vectors by extending the autoencoder model model to the heterogeneous network scenario, which can also effectively unite the objectives of network embedding and external application tasks. Extensive experiments have been done on real-world heterogeneous social network datasets, and the experimental results have demonstrated the outstanding performance of Latte in learning the representation vectors for specific application tasks.Comment: 11 Pages, 12 Figures, 1 Tabl