Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate ...Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.展开更多
With the emergence of network-centric data,social network graph publishing is conducive to data analysts to mine the value of social networks,analyze the social behavior of individuals or groups,implement personalized...With the emergence of network-centric data,social network graph publishing is conducive to data analysts to mine the value of social networks,analyze the social behavior of individuals or groups,implement personalized recommendations,and so on.However,published social network graphs are often subject to re-identification attacks from adversaries,which results in the leakage of users’privacy.The-anonymity technology is widely used in the field of graph publishing,which is quite effective to resist re-identification attacks.However,the current researches still exist some issues to be solved:the protection of directed graphs is less concerned than that of undirected graphs;the protection of graph structure is often ignored while achieving the protection of nodes’identities;the same protection is performed for different users,which doesn’t meet the different privacy requirements of users.Therefore,to address the above issues,a multi-level-degree anonymity(MLDA)scheme on directed social network graphs is proposed in this paper.First,node sets with different importance are divided by the firefly algorithm and constrained connectedness upper approximation,and they are performed different-degree anonymity protection to meet the different privacy requirements of users.Second,a new graph anonymity method is proposed,which achieves the addition and removal of edges with the help of fake nodes.In addition,to improve the utility of the anonymized graph,a new edge cost criterion is proposed,which is used to select the most appropriate edge to be removed.Third,to protect the community structure of the original graph as much as possible,fake nodes contained in a same community are merged prior to fake nodes contained in different communities.Experimental results on real datasets show that the newly proposed MLDA scheme is effective to balance the privacy and utility of the anonymized graph.展开更多
The advent of the time of big data along with social networks makes the visualization and analysis of networks information become increasingly important in many fields. Based on the information from social networks, t...The advent of the time of big data along with social networks makes the visualization and analysis of networks information become increasingly important in many fields. Based on the information from social networks, the idea of information visualization and development of tools are presented. Popular social network micro-blog （＇Weibo＇） is chosen to realize the process of users＇ interest and communications data analysis. User interest visualization methods are discussed and chosen and programs are developed to collect users＇ interest and describe it by graph. The visualization results may be used to provide the commercial recommendation or social investigation application for decision makers.展开更多
Using Kripke semantics, we have identified and reduced an epistemic incompleteness in the metaphor commonly employed in Social Networks Analysis (SNA), which basically compares information flows with current flows in ...Using Kripke semantics, we have identified and reduced an epistemic incompleteness in the metaphor commonly employed in Social Networks Analysis (SNA), which basically compares information flows with current flows in advanced centrality measures. Our theoretical approach defines a new paradigm for the semantic and dynamic analysis of social networks including shared content. Based on our theoretical findings, we define a semantic and predictive model of dynamic SNA for Enterprises Social Networks (ESN), and experiment it on a real dataset.展开更多
Based on previous works, we give further investigations on the Prisoners＇ Dilemma Game （PDG） on two different types of homogeneous networks, i.e. the homogeneous small-world network （HSWN） and the regular ring gr...Based on previous works, we give further investigations on the Prisoners＇ Dilemma Game （PDG） on two different types of homogeneous networks, i.e. the homogeneous small-world network （HSWN） and the regular ring graph. We find that the so-called resonance-like character can occur on both the networks. Different from the viewpoint in previous publications, we think the small-world effect may be unnecessary to produce this character. Therefore, over these two types of networks, we suggest a common understanding in the viewpoint of clustering coefficient. Detailed simulation results can sustain our viewpoint quite well. Furthermore, we investigate the Snowdrift Game （SG） on the same networks. The difference between the outputs of the PDG and the SG can also sustain our viewpoint.展开更多
This paper proposes an analytical mining tool for big graph data based on MapReduce and bulk synchronous parallel （BSP） com puting model. The tool is named Mapreduce and BSP based Graphmining tool （MBGM）. The core...This paper proposes an analytical mining tool for big graph data based on MapReduce and bulk synchronous parallel （BSP） com puting model. The tool is named Mapreduce and BSP based Graphmining tool （MBGM）. The core of this mining system are four sets of parallel graphmining algorithms programmed in the BSP parallel model and one set of data extractiontransformationload ing （ETE） algorithms implemented in MapReduce. To invoke these algorithm sets, we designed a workflow engine which optimized for cloud computing. Finally, a welldesigned data management function enables users to view, delete and input data in the Ha doop distributed file system （HDFS）. Experiments on artificial data show that the components of graphmining algorithm in MBGM are efficient.展开更多
With the growth of the internet it is becoming increasingly important to understand how the behaviour of players is affected by the topology of the network interconnecting them. Many models which involve networks of i...With the growth of the internet it is becoming increasingly important to understand how the behaviour of players is affected by the topology of the network interconnecting them. Many models which involve networks of interacting players have been proposed and best response games are amongst the simplest. In best response games each vertex simultaneously updates to employ the best response to their current surroundings. We concentrate upon trying to understand the dynamics of best response games on regular graphs with many strategies. When more than two strategies are present highly complex dynamics can ensue. We focus upon trying to understand exactly how best response games on regular graphs sample from the space of possible cellular automata. To understand this issue we investigate convex divisions in high dimensional space and we prove that almost every division of k - 1 dimensional space into k convex regions includes a single point where all regions meet. We then find connections between the convex geometry of best response games and the theory of alternating circuits on graphs. Exploiting these unexpected connections allows us to gain an interesting answer to our question of when cellular automata are best response games.展开更多
Both farmers and traders benefit from trade networking, which is crucial for the local economy. Therefore, it is crucial to understand how these networks operate, and how they can be managed more effectively. Througho...Both farmers and traders benefit from trade networking, which is crucial for the local economy. Therefore, it is crucial to understand how these networks operate, and how they can be managed more effectively. Throughout this study, we examine the economic networks formed between farmers and traders through the trade of food products. These networks are analyzed from the perspective of their structure and the factors that influence their development. Using data from 18 farmers and 15 traders, we applied exponential random graph models. The results of our study showed that connectivity, Popularity Spread, activity spread, good transportation systems, and high yields all affected the development of networks. Therefore, farmers’ productivity and high market demand can contribute to local food-crop trade. The network was not affected by reciprocity, open markets, proximity to locations, or trade experience of actors. Policy makers should consider these five factors when formulating policies for local food-crop trade. Additionally, local actors should be encouraged to use these factors to improve their network development. However, it is important to note that these factors alone cannot guarantee success. Policy makers and actors must also consider other factors such as legal frameworks, economic policies, and resource availability. Our approach can be used in future research to determine how traders and farmers can enhance productivity and profit in West Africa. This study addresses a research gap by examining factors influencing local food trade in a developing country.展开更多
At present, the emotion classification method of Weibo public opinions based on graph neural network cannot solve the polysemy problem well, and the scale of global graph with fixed weight is too large. This paper pro...At present, the emotion classification method of Weibo public opinions based on graph neural network cannot solve the polysemy problem well, and the scale of global graph with fixed weight is too large. This paper proposes a feature fusion network model Bert-TextLevelGCN based on BERT pre-training and improved TextGCN. On the one hand, Bert is introduced to obtain the initial vector input of graph neural network containing rich semantic features. On the other hand, the global graph connection window of traditional TextGCN is reduced to the text level, and the message propagation mechanism of global sharing is applied. Finally, the output vector of BERT and TextLevelGCN is fused by interpolation update method, and a more robust mapping of positive and negative sentiment classification of public opinion text of “Tangshan Barbecue Restaurant beating people” is obtained. In the context of the national anti-gang campaign, it is of great significance to accurately and efficiently analyze the emotional characteristics of public opinion in sudden social violence events with bad social impact, which is of great significance to improve the government’s public opinion warning and response ability to public opinion in sudden social security events. .展开更多
基金supported by the Natural Science Foundation of China(No.U22A2099)the Innovation Project of Guangxi Graduate Education(YCBZ2023130).
文摘Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.
基金supported by the National Natural Science Foundation of China (Grant Nos.61966009,U22A2099).
文摘With the emergence of network-centric data,social network graph publishing is conducive to data analysts to mine the value of social networks,analyze the social behavior of individuals or groups,implement personalized recommendations,and so on.However,published social network graphs are often subject to re-identification attacks from adversaries,which results in the leakage of users’privacy.The-anonymity technology is widely used in the field of graph publishing,which is quite effective to resist re-identification attacks.However,the current researches still exist some issues to be solved:the protection of directed graphs is less concerned than that of undirected graphs;the protection of graph structure is often ignored while achieving the protection of nodes’identities;the same protection is performed for different users,which doesn’t meet the different privacy requirements of users.Therefore,to address the above issues,a multi-level-degree anonymity(MLDA)scheme on directed social network graphs is proposed in this paper.First,node sets with different importance are divided by the firefly algorithm and constrained connectedness upper approximation,and they are performed different-degree anonymity protection to meet the different privacy requirements of users.Second,a new graph anonymity method is proposed,which achieves the addition and removal of edges with the help of fake nodes.In addition,to improve the utility of the anonymized graph,a new edge cost criterion is proposed,which is used to select the most appropriate edge to be removed.Third,to protect the community structure of the original graph as much as possible,fake nodes contained in a same community are merged prior to fake nodes contained in different communities.Experimental results on real datasets show that the newly proposed MLDA scheme is effective to balance the privacy and utility of the anonymized graph.
文摘The advent of the time of big data along with social networks makes the visualization and analysis of networks information become increasingly important in many fields. Based on the information from social networks, the idea of information visualization and development of tools are presented. Popular social network micro-blog （＇Weibo＇） is chosen to realize the process of users＇ interest and communications data analysis. User interest visualization methods are discussed and chosen and programs are developed to collect users＇ interest and describe it by graph. The visualization results may be used to provide the commercial recommendation or social investigation application for decision makers.
文摘Using Kripke semantics, we have identified and reduced an epistemic incompleteness in the metaphor commonly employed in Social Networks Analysis (SNA), which basically compares information flows with current flows in advanced centrality measures. Our theoretical approach defines a new paradigm for the semantic and dynamic analysis of social networks including shared content. Based on our theoretical findings, we define a semantic and predictive model of dynamic SNA for Enterprises Social Networks (ESN), and experiment it on a real dataset.
基金Supported by the National Basic Research Programme of China under Grant No 2006CB705500, the National Natural Science Foundation of China under Grant Nos 60744003, 10635040, 10532060, 10472116 and 10404025, and the Specialized Research Fund for the Doctoral Programme of Higher Education of China.
文摘Based on previous works, we give further investigations on the Prisoners＇ Dilemma Game （PDG） on two different types of homogeneous networks, i.e. the homogeneous small-world network （HSWN） and the regular ring graph. We find that the so-called resonance-like character can occur on both the networks. Different from the viewpoint in previous publications, we think the small-world effect may be unnecessary to produce this character. Therefore, over these two types of networks, we suggest a common understanding in the viewpoint of clustering coefficient. Detailed simulation results can sustain our viewpoint quite well. Furthermore, we investigate the Snowdrift Game （SG） on the same networks. The difference between the outputs of the PDG and the SG can also sustain our viewpoint.
基金supported by ZTE Industry-Academia-Research Cooperaton Funds
文摘This paper proposes an analytical mining tool for big graph data based on MapReduce and bulk synchronous parallel （BSP） com puting model. The tool is named Mapreduce and BSP based Graphmining tool （MBGM）. The core of this mining system are four sets of parallel graphmining algorithms programmed in the BSP parallel model and one set of data extractiontransformationload ing （ETE） algorithms implemented in MapReduce. To invoke these algorithm sets, we designed a workflow engine which optimized for cloud computing. Finally, a welldesigned data management function enables users to view, delete and input data in the Ha doop distributed file system （HDFS）. Experiments on artificial data show that the components of graphmining algorithm in MBGM are efficient.
文摘With the growth of the internet it is becoming increasingly important to understand how the behaviour of players is affected by the topology of the network interconnecting them. Many models which involve networks of interacting players have been proposed and best response games are amongst the simplest. In best response games each vertex simultaneously updates to employ the best response to their current surroundings. We concentrate upon trying to understand the dynamics of best response games on regular graphs with many strategies. When more than two strategies are present highly complex dynamics can ensue. We focus upon trying to understand exactly how best response games on regular graphs sample from the space of possible cellular automata. To understand this issue we investigate convex divisions in high dimensional space and we prove that almost every division of k - 1 dimensional space into k convex regions includes a single point where all regions meet. We then find connections between the convex geometry of best response games and the theory of alternating circuits on graphs. Exploiting these unexpected connections allows us to gain an interesting answer to our question of when cellular automata are best response games.
文摘Both farmers and traders benefit from trade networking, which is crucial for the local economy. Therefore, it is crucial to understand how these networks operate, and how they can be managed more effectively. Throughout this study, we examine the economic networks formed between farmers and traders through the trade of food products. These networks are analyzed from the perspective of their structure and the factors that influence their development. Using data from 18 farmers and 15 traders, we applied exponential random graph models. The results of our study showed that connectivity, Popularity Spread, activity spread, good transportation systems, and high yields all affected the development of networks. Therefore, farmers’ productivity and high market demand can contribute to local food-crop trade. The network was not affected by reciprocity, open markets, proximity to locations, or trade experience of actors. Policy makers should consider these five factors when formulating policies for local food-crop trade. Additionally, local actors should be encouraged to use these factors to improve their network development. However, it is important to note that these factors alone cannot guarantee success. Policy makers and actors must also consider other factors such as legal frameworks, economic policies, and resource availability. Our approach can be used in future research to determine how traders and farmers can enhance productivity and profit in West Africa. This study addresses a research gap by examining factors influencing local food trade in a developing country.
文摘At present, the emotion classification method of Weibo public opinions based on graph neural network cannot solve the polysemy problem well, and the scale of global graph with fixed weight is too large. This paper proposes a feature fusion network model Bert-TextLevelGCN based on BERT pre-training and improved TextGCN. On the one hand, Bert is introduced to obtain the initial vector input of graph neural network containing rich semantic features. On the other hand, the global graph connection window of traditional TextGCN is reduced to the text level, and the message propagation mechanism of global sharing is applied. Finally, the output vector of BERT and TextLevelGCN is fused by interpolation update method, and a more robust mapping of positive and negative sentiment classification of public opinion text of “Tangshan Barbecue Restaurant beating people” is obtained. In the context of the national anti-gang campaign, it is of great significance to accurately and efficiently analyze the emotional characteristics of public opinion in sudden social violence events with bad social impact, which is of great significance to improve the government’s public opinion warning and response ability to public opinion in sudden social security events. .
