This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, ...This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.展开更多
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.展开更多
当前社区发现算法主要是针对无向图研究社区结构,但在实际复杂网络中,链接关系时常表现出非对称性或方向性,比如Twitter的用户关注关系,文献网络的引用关系,网页之间的超链接关系等应用网络。因此,本文依据信息在复杂网络中的传播规律...当前社区发现算法主要是针对无向图研究社区结构,但在实际复杂网络中,链接关系时常表现出非对称性或方向性,比如Twitter的用户关注关系,文献网络的引用关系,网页之间的超链接关系等应用网络。因此,本文依据信息在复杂网络中的传播规律和流动方向性,提出了k-Path共社区邻近相似性概念及计算方法,用于衡量结点在同一社区的相似性程度,并给出了把有向图转换为带方向权值的无向图的方法。基于带权无向图提出了一种从局部扩展来探测社区的重叠社区发现算法(Local and wave-like extension algorithm of detecting overlapping community,LWS-OCD)。在真实数据集上的实验表明,共社区邻近相似性概念实现了有向到无向的合理转换,而且提高了社区结点的聚集效果,LWSOCD算法能够有效地发现带权无向图中的重叠社区。展开更多
基金Project supported by Science Foundation of Shanghai MunicipalConmission of Education (Grant No .03A203)
文摘This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.
基金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.
文摘当前社区发现算法主要是针对无向图研究社区结构,但在实际复杂网络中,链接关系时常表现出非对称性或方向性,比如Twitter的用户关注关系,文献网络的引用关系,网页之间的超链接关系等应用网络。因此,本文依据信息在复杂网络中的传播规律和流动方向性,提出了k-Path共社区邻近相似性概念及计算方法,用于衡量结点在同一社区的相似性程度,并给出了把有向图转换为带方向权值的无向图的方法。基于带权无向图提出了一种从局部扩展来探测社区的重叠社区发现算法(Local and wave-like extension algorithm of detecting overlapping community,LWS-OCD)。在真实数据集上的实验表明,共社区邻近相似性概念实现了有向到无向的合理转换,而且提高了社区结点的聚集效果,LWSOCD算法能够有效地发现带权无向图中的重叠社区。
