In social networks,weighted graph anonymity is gaining more and more attention.But fan-following graphs like Twitter’s are not protected by anonymity.Privacy protection based on directed graphs should arouse everyone...In social networks,weighted graph anonymity is gaining more and more attention.But fan-following graphs like Twitter’s are not protected by anonymity.Privacy protection based on directed graphs should arouse everyone’s importance,thus it requires effective anonymization techniques.In this paper,we propose a directed edge weighted graph anonymity scheme to model the shortest path in a directed network graph by Floyd algorithm and Dijkstra algorithm.Also,we execute the experiments on the number of anonymity solutions and time with different edge weights to verify their anonymity feasibility.Finally,we analyze the anonymity of two algorithms and to some extent concluded that Floyd algorithm is more suitable for anonymity of directed network graphs.展开更多
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.展开更多
Identification of cancer driver genes plays an important role in precision oncology research,which is helpful to understand cancer initiation and progression.However,most existing computational methods mainly used the...Identification of cancer driver genes plays an important role in precision oncology research,which is helpful to understand cancer initiation and progression.However,most existing computational methods mainly used the protein–protein interaction(PPI)networks,or treated the directed gene regulatory networks(GRNs)as the undirected gene–gene association networks to identify the cancer driver genes,which will lose the unique structure regulatory information in the directed GRNs,and then affect the outcome of the cancer driver gene identification.Here,based on the multi-omics pan-cancer data(i.e.,gene expression,mutation,copy number variation,and DNA methylation),we propose a novel method(called DGMP)to identify cancer driver genes by jointing directed graph convolutional network(DGCN)and multilayer perceptron(MLP).DGMP learns the multi-omics features of genes as well as the topological structure features in GRN with the DGCN model and uses MLP to weigh more on gene features for mitigating the bias toward the graph topological features in the DGCN learning process.The results on three GRNs show that DGMP outperforms other existing state-of-the-art methods.The ablation experimental results on the Dawn Net network indicate that introducing MLP into DGCN can offset the performance degradation of DGCN,and jointing MLP and DGCN can effectively improve the performance of identifying cancer driver genes.DGMP can identify not only the highly mutated cancer driver genes but also the driver genes harboring other kinds of alterations(e.g.,differential expression and aberrant DNA methylation)or genes involved in GRNs with other cancer genes.The source code of DGMP can be freely downloaded from https://github.com/NWPU-903PR/DGMP.展开更多
基金supported in part by the National Natural Science Foundation of China(Nos.62171132 and 62102088)Joint Funds for the Innovation of Science and Technology of Fujian Province(No.2024Y9491)Natural Science Foundation of Fujian Province(Nos.2024J09032 and 2025J01379).
文摘In social networks,weighted graph anonymity is gaining more and more attention.But fan-following graphs like Twitter’s are not protected by anonymity.Privacy protection based on directed graphs should arouse everyone’s importance,thus it requires effective anonymization techniques.In this paper,we propose a directed edge weighted graph anonymity scheme to model the shortest path in a directed network graph by Floyd algorithm and Dijkstra algorithm.Also,we execute the experiments on the number of anonymity solutions and time with different edge weights to verify their anonymity feasibility.Finally,we analyze the anonymity of two algorithms and to some extent concluded that Floyd algorithm is more suitable for anonymity of directed network graphs.
基金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.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.62173271 and 61873202 to SWZ)。
文摘Identification of cancer driver genes plays an important role in precision oncology research,which is helpful to understand cancer initiation and progression.However,most existing computational methods mainly used the protein–protein interaction(PPI)networks,or treated the directed gene regulatory networks(GRNs)as the undirected gene–gene association networks to identify the cancer driver genes,which will lose the unique structure regulatory information in the directed GRNs,and then affect the outcome of the cancer driver gene identification.Here,based on the multi-omics pan-cancer data(i.e.,gene expression,mutation,copy number variation,and DNA methylation),we propose a novel method(called DGMP)to identify cancer driver genes by jointing directed graph convolutional network(DGCN)and multilayer perceptron(MLP).DGMP learns the multi-omics features of genes as well as the topological structure features in GRN with the DGCN model and uses MLP to weigh more on gene features for mitigating the bias toward the graph topological features in the DGCN learning process.The results on three GRNs show that DGMP outperforms other existing state-of-the-art methods.The ablation experimental results on the Dawn Net network indicate that introducing MLP into DGCN can offset the performance degradation of DGCN,and jointing MLP and DGCN can effectively improve the performance of identifying cancer driver genes.DGMP can identify not only the highly mutated cancer driver genes but also the driver genes harboring other kinds of alterations(e.g.,differential expression and aberrant DNA methylation)or genes involved in GRNs with other cancer genes.The source code of DGMP can be freely downloaded from https://github.com/NWPU-903PR/DGMP.
