Objective:To elucidate the biological basis of the heart qi deficiency(HQD)pattern,an in-depth understanding of which is essential for improving clinical herbal therapy.Methods: We predicted and characterized HQD patt...Objective:To elucidate the biological basis of the heart qi deficiency(HQD)pattern,an in-depth understanding of which is essential for improving clinical herbal therapy.Methods: We predicted and characterized HQD pattern genes using the new strategy,TCM-HIN2Vec,which involves heterogeneous network embedding and transcriptomic experiments.First,a heterogeneous network of traditional Chinese medicine(TCM)patterns was constructed using public databases.Next,we predicted HQD pattern genes using a heterogeneous network-embedding algorithm.We then analyzed the functional characteristics of HQD pattern genes using gene enrichment analysis and examined gene expression levels using RNA-seq.Finally,we identified TCM herbs that demonstrated enriched interactions with HQD pattern genes via herbal enrichment analysis.Results: Our TCM-HIN2Vec strategy revealed that candidate genes associated with HQD pattern were significantly enriched in energy metabolism,signal transduction pathways,and immune processes.Moreover,we found that these candidate genes were significantly differentially expressed in the transcriptional profile of mice model with heart failure with a qi deficiency pattern.Furthermore,herbal enrichment analysis identified TCM herbs that demonstrated enriched interactions with the top 10 candidate genes and could potentially serve as drug candidates for treating HQD.Conclusion: Our results suggested that TCM-HIN2Vec is capable of not only accurately identifying HQD pattern genes,but also deciphering the basis of HQD pattern.Furthermore our finding indicated that TCM-HIN2Vec may be further expanded to develop other patterns,leading to a new approach aimed at elucidating general TCM patterns and developing precision medicine.展开更多
Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature space.However,the existing deep learningbased NE methods are time-consuming as they need to tra...Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature space.However,the existing deep learningbased NE methods are time-consuming as they need to train a dense architecture for deep neural networks with extensive unknown weight parameters.A sparse deep autoencoder(called SPDNE)for dynamic NE is proposed,aiming to learn the network structures while preserving the node evolution with a low computational complexity.SPDNE tries to use an optimal sparse architecture to replace the fully connected architecture in the deep autoencoder while maintaining the performance of these models in the dynamic NE.Then,an adaptive simulated algorithm to find the optimal sparse architecture for the deep autoencoder is proposed.The performance of SPDNE over three dynamical NE models(i.e.sparse architecture-based deep autoencoder method,DynGEM,and ElvDNE)is evaluated on three well-known benchmark networks and five real-world networks.The experimental results demonstrate that SPDNE can reduce about 70%of weight parameters of the architecture for the deep autoencoder during the training process while preserving the performance of these dynamical NE models.The results also show that SPDNE achieves the highest accuracy on 72 out of 96 edge prediction and network reconstruction tasks compared with the state-of-the-art dynamical NE algorithms.展开更多
Cryptocurrency, as a typical application scene of blockchain, has attracted broad interests from both industrial and academic communities. With its rapid development, the cryptocurrency transaction network embedding(C...Cryptocurrency, as a typical application scene of blockchain, has attracted broad interests from both industrial and academic communities. With its rapid development, the cryptocurrency transaction network embedding(CTNE) has become a hot topic. It embeds transaction nodes into low-dimensional feature space while effectively maintaining a network structure,thereby discovering desired patterns demonstrating involved users' normal and abnormal behaviors. Based on a wide investigation into the state-of-the-art CTNE, this survey has made the following efforts: 1) categorizing recent progress of CTNE methods, 2) summarizing the publicly available cryptocurrency transaction network datasets, 3) evaluating several widely-adopted methods to show their performance in several typical evaluation protocols, and 4) discussing the future trends of CTNE. By doing so, it strives to provide a systematic and comprehensive overview of existing CTNE methods from static to dynamic perspectives,thereby promoting further research into this emerging and important field.展开更多
The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SD...The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.展开更多
The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex vi...The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.展开更多
Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been w...Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.展开更多
Purpose: The goal of this study is to explore whether deep learning based embed ded models can provide a better visualization solution for large citation networks. De sign/methodology/approach: Our team compared the v...Purpose: The goal of this study is to explore whether deep learning based embed ded models can provide a better visualization solution for large citation networks. De sign/methodology/approach: Our team compared the visualization approach borrowed from the deep learning community with the well-known bibliometric network visualization for large scale data. 47,294 highly cited papers were visualized by using three network embedding models plus the t-SNE dimensionality reduction technique. Besides, three base maps were created with the same dataset for evaluation purposes. All base maps used the classic Open Ord method with different edge cutting strategies and parameters. Findings: The network embedded maps with t-SNE preserve a very similar global structure to the full edges classic force-directed map, while the maps vary in local structure. Among them, the Node2Vec model has the best overall visualization performance, the local structure has been significantly improved and the maps' layout has very high stability.Research limitations: The computational and time costs of training are very high for network em bedded models to obtain high dimensional latent vector. Only one dimensionality reduction technique was tested. Practical implications: This paper demonstrates that the network embedding models are able to accurately reconstruct the large bibliometric network in the vector space. In the future, apart from network visualization, many classical vector-based machine learning algorithms can be applied to network representations for solving bibliomet ric analysis tasks. Originality/value: This paper provides the first systematic comparison of classical science mapping visualization with network embedding based visualization on a large scale dataset. We showed deep learning based network embedding model with t-SNE can provide a richer,more stable science map. We also designed a practical evaluation method to investigate and compare maps.展开更多
Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Intern...Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.展开更多
Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization.Compared with other studies which focus on designing heurist...Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization.Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network.We distinguish the different components and embed VN requests onto them respectively.And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component.On the other hand,load balancing is also considered in this paper.It could avoid blocked or bottlenecked area of substrate network.Simulation experiments show that compared with other algorithms in large-scale network,acceptance ratio,average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced.It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.展开更多
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
Purpose:Based on real-world academic data,this study aims to use network embedding technology to mining academic relationships,and investigate the effectiveness of the proposed embedding model on academic collaborator...Purpose:Based on real-world academic data,this study aims to use network embedding technology to mining academic relationships,and investigate the effectiveness of the proposed embedding model on academic collaborator recommendation tasks.Design/methodology/approach:We propose an academic collaborator recommendation model based on attributed network embedding(ACR-ANE),which can get enhanced scholar embedding and take full advantage of the topological structure of the network and multi-type scholar attributes.The non-local neighbors for scholars are defined to capture strong relationships among scholars.A deep auto-encoder is adopted to encode the academic collaboration network structure and scholar attributes into a low-dimensional representation space.Findings:1.The proposed non-local neighbors can better describe the relationships among scholars in the real world than the first-order neighbors.2.It is important to consider the structure of the academic collaboration network and scholar attributes when recommending collaborators for scholars simultaneously.Research limitations:The designed method works for static networks,without taking account of the network dynamics.Practical implications:The designed model is embedded in academic collaboration network structure and scholarly attributes,which can be used to help scholars recommend potential collaborators.Originality/value:Experiments on two real-world scholarly datasets,Aminer and APS,show that our proposed method performs better than other baselines.展开更多
In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual ne...In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.展开更多
Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One ...Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.展开更多
Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the stru...Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the structural and semantic information contained in heterogeneous information networks(HINs)into low-dimensional embeddings;this task is called heterogeneous network embedding(HNE).Efficient HNE techniques can benefit various HIN-based machine learning tasks such as node classification,recommender systems,and information retrieval.Here,we provide a comprehensive survey of key advancements in the area of HNE.First,we define an encoder-decoder-based HNE model taxonomy.Then,we systematically overview,compare,and summarize various state-of-the-art HNE models and analyze the advantages and disadvantages of various model categories to identify more potentially competitive HNE frameworks.We also summarize the application fields,benchmark datasets,open source tools,andperformance evaluation in theHNEarea.Finally,wediscuss open issues and suggest promising future directions.We anticipate that this survey will provide deep insights into research in the field of HNE.展开更多
Interactivity is the most significant feature of network data,especially in social networks.Existing network embedding methods have achieved remarkable results in learning network structure and node attributes,but do ...Interactivity is the most significant feature of network data,especially in social networks.Existing network embedding methods have achieved remarkable results in learning network structure and node attributes,but do not pay attention to the multi-interaction between nodes,which limits the extraction and mining of potential deep interactions between nodes.To tackle the problem,we propose a method called Multi-Interaction heterogeneous information Network Embedding(MINE).Firstly,we introduced the multi-interactions heterogeneous information network and extracted complex heterogeneous relation sequences by the multi-interaction extraction algorithm.Secondly,we use a well-designed multi-relationship network fusion model based on the attention mechanism to fuse multiple interactional relationships.Finally,applying a multitasking model makes the learned vector contain richer semantic relationships.A large number of practical experiments prove that our proposed method outperforms existing methods on multiple data sets.展开更多
Role-based network embedding aims to embed role-similar nodes into a similar embedding space,which is widely used in graph mining tasks such as role classification and detection.Roles are sets of nodes in graph networ...Role-based network embedding aims to embed role-similar nodes into a similar embedding space,which is widely used in graph mining tasks such as role classification and detection.Roles are sets of nodes in graph networks with similar structural patterns and functions.However,the rolesimilar nodes may be far away or even disconnected from each other.Meanwhile,the neighborhood node features and noise also affect the result of the role-based network embedding,which are also challenges of current network embedding work.In this paper,we propose a Role-based network Embedding via Quantum walk with weighted Features fusion(REQF),which simultaneously considers the influence of global and local role information,node features,and noise.Firstly,we capture the global role information of nodes via quantum walk based on its superposition property which emphasizes the local role information via biased quantum walk.Secondly,we utilize the quantum walkweighted characteristic function to extract and fuse features of nodes and their neighborhood by different distributions which contain role information implicitly.Finally,we leverage the Variational Auto-Encoder(VAE)to reduce the effect of noise.We conduct extensive experiments on seven real-world datasets,and the results show that REQF is more effective at capturing role information in the network,which outperforms the best baseline by up to 14.6% in role classification,and 23% in role detection on average.展开更多
For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most ...For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most existing studies on this subject mainly concentrate on monoplex networks considering a single type of relation among nodes.However,numerous real-world networks are naturally composed of multiple layers with different relation types;such a network is called a multiplex network.The majority of existing multiplex network embedding methods either overlook node attributes,resort to node labels for training,or underutilize underlying information shared across multiple layers.In this paper,we propose Multiplex Network Infomax(MNI),an unsupervised embedding framework to represent information of multiple layers into a unified embedding space.To be more specific,we aim to maximize the mutual information between the unified embedding and node embeddings of each layer.On the basis of this framework,we present an unsupervised network embedding method for attributed multiplex networks.Experimental results show that our method achieves competitive performance on not only node-related tasks,such as node classification,clustering,and similarity search,but also a typical edge-related task,i.e.,link prediction,at times even outperforming relevant supervised methods,despite that MNI is fully unsupervised.展开更多
Network embedding,as an approach to learning low-dimensional representations of nodes,has been proved extremely useful in many applications,e.g.,node classification and link prediction.Unfortunately,existing network e...Network embedding,as an approach to learning low-dimensional representations of nodes,has been proved extremely useful in many applications,e.g.,node classification and link prediction.Unfortunately,existing network embed-ding models are vulnerable to random or adversarial perturbations,which may degrade the performance of network em-bedding when being applied to downstream tasks.To achieve robust network embedding,researchers introduce adversari-al training to regularize the embedding learning process by training on a mixture of adversarial examples and original ex-amples.However,existing methods generate adversarial examples heuristically,failing to guarantee the imperceptibility of generated adversarial examples,and thus limit the power of adversarial training.In this paper,we propose a novel method Identity-Preserving Adversarial Training(IPAT)for network embedding,which generates imperceptible adversarial exam-ples with explicit identity-preserving regularization.We formalize such identity-preserving regularization as a multi-class classification problem where each node represents a class,and we encourage each adversarial example to be discriminated as the class of its original node.Extensive experimental results on real-world datasets demonstrate that our proposed IPAT method significantly improves the robustness of network embedding models and the generalization of the learned node representations on various downstream tasks.展开更多
In power systems,failures of vulnerable lines can trigger large-scale cascading failures,and vulnerability assessment is dedicated to locating these lines and reducing the risks of such failures.Based on a structure a...In power systems,failures of vulnerable lines can trigger large-scale cascading failures,and vulnerability assessment is dedicated to locating these lines and reducing the risks of such failures.Based on a structure and attribute network embedding(SANE)algorithm,a novel quantitative vulnerability analysis method is proposed to identify vulnerable lines in this research.First,a two-layered random walk network with topological and electrical properties of transmission lines is established.Subsequently,based on the weighted degree of nodes in the two-layered network,the inter-layer and intra-layer walking transition probabilities are developed to obtain walk sequences.Then,a Word2Vec algorithm is applied to obtain lowdimension vectors representing transmission lines,according to obtained walk sequences for calculating the vulnerability index of transmissions lines.Finally,the proposed method is compared with three widely used methods in two test systems.Results show the network embedding based method is superior to those comparison methods and can provide guidance for identifying vulnerable lines.展开更多
In this paper,we address the problem of unsuperised social network embedding,which aims to embed network nodes,including node attributes,into a latent low dimensional space.In recent methods,the fusion mechanism of no...In this paper,we address the problem of unsuperised social network embedding,which aims to embed network nodes,including node attributes,into a latent low dimensional space.In recent methods,the fusion mechanism of node attributes and network structure has been proposed for the problem and achieved impressive prediction performance.However,the non-linear property of node attributes and network structure is not efficiently fused in existing methods,which is potentially helpful in learning a better network embedding.To this end,in this paper,we propose a novel model called ASM(Adaptive Specific Mapping)based on encoder-decoder framework.In encoder,we use the kernel mapping to capture the non-linear property of both node attributes and network structure.In particular,we adopt two feature mapping functions,namely an untrainable function for node attributes and a trainable function for network structure.By the mapping functions,we obtain the low dimensional feature vectors for node attributes and network structure,respectively.Then,we design an attention layer to combine the learning of both feature vectors and adaptively learn the node embedding.In encoder,we adopt the component of reconstruction for the training process of learning node attributes and network structure.We conducted a set of experiments on seven real-world social network datasets.The experimental results verify the effectiveness and efficiency of our method in comparison with state-of-the-art baselines.展开更多
基金supported by the National Natural Science Foundation of China(32088101)National key Research and Development Program of China(2017YFC1700105,2021YFA1301603).
文摘Objective:To elucidate the biological basis of the heart qi deficiency(HQD)pattern,an in-depth understanding of which is essential for improving clinical herbal therapy.Methods: We predicted and characterized HQD pattern genes using the new strategy,TCM-HIN2Vec,which involves heterogeneous network embedding and transcriptomic experiments.First,a heterogeneous network of traditional Chinese medicine(TCM)patterns was constructed using public databases.Next,we predicted HQD pattern genes using a heterogeneous network-embedding algorithm.We then analyzed the functional characteristics of HQD pattern genes using gene enrichment analysis and examined gene expression levels using RNA-seq.Finally,we identified TCM herbs that demonstrated enriched interactions with HQD pattern genes via herbal enrichment analysis.Results: Our TCM-HIN2Vec strategy revealed that candidate genes associated with HQD pattern were significantly enriched in energy metabolism,signal transduction pathways,and immune processes.Moreover,we found that these candidate genes were significantly differentially expressed in the transcriptional profile of mice model with heart failure with a qi deficiency pattern.Furthermore,herbal enrichment analysis identified TCM herbs that demonstrated enriched interactions with the top 10 candidate genes and could potentially serve as drug candidates for treating HQD.Conclusion: Our results suggested that TCM-HIN2Vec is capable of not only accurately identifying HQD pattern genes,but also deciphering the basis of HQD pattern.Furthermore our finding indicated that TCM-HIN2Vec may be further expanded to develop other patterns,leading to a new approach aimed at elucidating general TCM patterns and developing precision medicine.
基金National Natural Science Foundation of China,Grant/Award Numbers:62173236,61876110,61806130,61976142,82304204.
文摘Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature space.However,the existing deep learningbased NE methods are time-consuming as they need to train a dense architecture for deep neural networks with extensive unknown weight parameters.A sparse deep autoencoder(called SPDNE)for dynamic NE is proposed,aiming to learn the network structures while preserving the node evolution with a low computational complexity.SPDNE tries to use an optimal sparse architecture to replace the fully connected architecture in the deep autoencoder while maintaining the performance of these models in the dynamic NE.Then,an adaptive simulated algorithm to find the optimal sparse architecture for the deep autoencoder is proposed.The performance of SPDNE over three dynamical NE models(i.e.sparse architecture-based deep autoencoder method,DynGEM,and ElvDNE)is evaluated on three well-known benchmark networks and five real-world networks.The experimental results demonstrate that SPDNE can reduce about 70%of weight parameters of the architecture for the deep autoencoder during the training process while preserving the performance of these dynamical NE models.The results also show that SPDNE achieves the highest accuracy on 72 out of 96 edge prediction and network reconstruction tasks compared with the state-of-the-art dynamical NE algorithms.
基金supported in part by the National Natural Science Foundation of China (62272078)the CAAI-Huawei MindSpore Open Fund (CAAIXSJLJJ-2021-035A)the Doctoral Student Talent Training Program of Chongqing University of Posts and Telecommunications (BYJS202009)。
文摘Cryptocurrency, as a typical application scene of blockchain, has attracted broad interests from both industrial and academic communities. With its rapid development, the cryptocurrency transaction network embedding(CTNE) has become a hot topic. It embeds transaction nodes into low-dimensional feature space while effectively maintaining a network structure,thereby discovering desired patterns demonstrating involved users' normal and abnormal behaviors. Based on a wide investigation into the state-of-the-art CTNE, this survey has made the following efforts: 1) categorizing recent progress of CTNE methods, 2) summarizing the publicly available cryptocurrency transaction network datasets, 3) evaluating several widely-adopted methods to show their performance in several typical evaluation protocols, and 4) discussing the future trends of CTNE. By doing so, it strives to provide a systematic and comprehensive overview of existing CTNE methods from static to dynamic perspectives,thereby promoting further research into this emerging and important field.
文摘The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.
基金supported in part by Open Foundation of State Key Laboratory of Information Photonics and Optical Communications (Grant No. IPOC2014B009)Fundamental Research Funds for the Central Universities (Grant Nos. N130817002, N150401002)+1 种基金Foundation of the Education Department of Liaoning Province (Grant No. L2014089)National Natural Science Foundation of China (Grant Nos. 61302070, 61401082, 61471109, 61502075, 91438110)
文摘The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.
基金The authors would like to thank the reviewers for their detailed reviews and constructive comments,which have helped improve the quality of this paper.This work was supported by National Science Foundation of China under Grants 6187144。
文摘Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.
基金funded by the strategic research project of the Development Planning Bureau of the Chinese Academy of Sciences under Grant No.GHJ-ZLZX-2019-42the Youth Fund Project of Institutes of Science and Development, Chinese Academy of Sciences under Grant name “Research on Key Methods in Comparison of Scientific Funding Layout”。
文摘Purpose: The goal of this study is to explore whether deep learning based embed ded models can provide a better visualization solution for large citation networks. De sign/methodology/approach: Our team compared the visualization approach borrowed from the deep learning community with the well-known bibliometric network visualization for large scale data. 47,294 highly cited papers were visualized by using three network embedding models plus the t-SNE dimensionality reduction technique. Besides, three base maps were created with the same dataset for evaluation purposes. All base maps used the classic Open Ord method with different edge cutting strategies and parameters. Findings: The network embedded maps with t-SNE preserve a very similar global structure to the full edges classic force-directed map, while the maps vary in local structure. Among them, the Node2Vec model has the best overall visualization performance, the local structure has been significantly improved and the maps' layout has very high stability.Research limitations: The computational and time costs of training are very high for network em bedded models to obtain high dimensional latent vector. Only one dimensionality reduction technique was tested. Practical implications: This paper demonstrates that the network embedding models are able to accurately reconstruct the large bibliometric network in the vector space. In the future, apart from network visualization, many classical vector-based machine learning algorithms can be applied to network representations for solving bibliomet ric analysis tasks. Originality/value: This paper provides the first systematic comparison of classical science mapping visualization with network embedding based visualization on a large scale dataset. We showed deep learning based network embedding model with t-SNE can provide a richer,more stable science map. We also designed a practical evaluation method to investigate and compare maps.
基金supported by the National Key Research and Development of China under Grant 2018YFC1314903the National Natural Science Foundation of China under Grant 61372124 and Grant 61427801
文摘Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.
基金supported in part by the National Natural Science Foundation of China under Grant No.61471055
文摘Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization.Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network.We distinguish the different components and embed VN requests onto them respectively.And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component.On the other hand,load balancing is also considered in this paper.It could avoid blocked or bottlenecked area of substrate network.Simulation experiments show that compared with other algorithms in large-scale network,acceptance ratio,average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced.It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
基金supported by National Natural Science Foundation of China(No.61603310)the Fundamental Research Funds for the Central Universities(No.XDJK2018B019).
文摘Purpose:Based on real-world academic data,this study aims to use network embedding technology to mining academic relationships,and investigate the effectiveness of the proposed embedding model on academic collaborator recommendation tasks.Design/methodology/approach:We propose an academic collaborator recommendation model based on attributed network embedding(ACR-ANE),which can get enhanced scholar embedding and take full advantage of the topological structure of the network and multi-type scholar attributes.The non-local neighbors for scholars are defined to capture strong relationships among scholars.A deep auto-encoder is adopted to encode the academic collaboration network structure and scholar attributes into a low-dimensional representation space.Findings:1.The proposed non-local neighbors can better describe the relationships among scholars in the real world than the first-order neighbors.2.It is important to consider the structure of the academic collaboration network and scholar attributes when recommending collaborators for scholars simultaneously.Research limitations:The designed method works for static networks,without taking account of the network dynamics.Practical implications:The designed model is embedded in academic collaboration network structure and scholarly attributes,which can be used to help scholars recommend potential collaborators.Originality/value:Experiments on two real-world scholarly datasets,Aminer and APS,show that our proposed method performs better than other baselines.
基金supported by "the Fundamental Research Funds for the Central Universities" of China University of Petroleum(East China)(Grant No.18CX02139A)the Shandong Provincial Natural Science Foundation,China(Grant No.ZR2014FQ018)+3 种基金the National Natural Science Foundation of China(Grant No.61471056)the National Basic Research Program(973)of China(Grant No.2012CB315801)the Research on coordinated management and control technology of network and satellite multi-domain network resources(Grant No.17-H863-01-ZT-001-001-02)the China research project on key technology strategy of infrastructure security for information network development
文摘In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.
基金supported by the National Basic Research Program of China (973 Program) under Grant 2013CB329104the National Natural Science Foundation of China under Grant 61372124 and 61427801the Key Projects of Natural Science Foundation of Jiangsu University under Grant 11KJA510001
文摘Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.
基金supported by the National Key Research and Development Plan of China(2017YFB0503700,2016YFB0501801)the National Natural Science Foundation of China(61170026,62173157)+1 种基金the Thirteen Five-Year Research Planning Project of National Language Committee(No.YB135-149)the Fundamental Research Funds for the Central Universities(Nos.CCNU20QN022,CCNU20QN021,CCNU20ZT012).
文摘Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the structural and semantic information contained in heterogeneous information networks(HINs)into low-dimensional embeddings;this task is called heterogeneous network embedding(HNE).Efficient HNE techniques can benefit various HIN-based machine learning tasks such as node classification,recommender systems,and information retrieval.Here,we provide a comprehensive survey of key advancements in the area of HNE.First,we define an encoder-decoder-based HNE model taxonomy.Then,we systematically overview,compare,and summarize various state-of-the-art HNE models and analyze the advantages and disadvantages of various model categories to identify more potentially competitive HNE frameworks.We also summarize the application fields,benchmark datasets,open source tools,andperformance evaluation in theHNEarea.Finally,wediscuss open issues and suggest promising future directions.We anticipate that this survey will provide deep insights into research in the field of HNE.
基金This work is supported by the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.201714)Weihai Science and Technology Development Program(2016DXGJMS15)Key Research and Development Program in Shandong Provincial(2017GGX90103).
文摘Interactivity is the most significant feature of network data,especially in social networks.Existing network embedding methods have achieved remarkable results in learning network structure and node attributes,but do not pay attention to the multi-interaction between nodes,which limits the extraction and mining of potential deep interactions between nodes.To tackle the problem,we propose a method called Multi-Interaction heterogeneous information Network Embedding(MINE).Firstly,we introduced the multi-interactions heterogeneous information network and extracted complex heterogeneous relation sequences by the multi-interaction extraction algorithm.Secondly,we use a well-designed multi-relationship network fusion model based on the attention mechanism to fuse multiple interactional relationships.Finally,applying a multitasking model makes the learned vector contain richer semantic relationships.A large number of practical experiments prove that our proposed method outperforms existing methods on multiple data sets.
基金supported in part by the National Nature Science Foundation of China(Grant 62172065)the Natural Science Foundation of Chongqing(Grant cstc2020jcyjmsxmX0137).
文摘Role-based network embedding aims to embed role-similar nodes into a similar embedding space,which is widely used in graph mining tasks such as role classification and detection.Roles are sets of nodes in graph networks with similar structural patterns and functions.However,the rolesimilar nodes may be far away or even disconnected from each other.Meanwhile,the neighborhood node features and noise also affect the result of the role-based network embedding,which are also challenges of current network embedding work.In this paper,we propose a Role-based network Embedding via Quantum walk with weighted Features fusion(REQF),which simultaneously considers the influence of global and local role information,node features,and noise.Firstly,we capture the global role information of nodes via quantum walk based on its superposition property which emphasizes the local role information via biased quantum walk.Secondly,we utilize the quantum walkweighted characteristic function to extract and fuse features of nodes and their neighborhood by different distributions which contain role information implicitly.Finally,we leverage the Variational Auto-Encoder(VAE)to reduce the effect of noise.We conduct extensive experiments on seven real-world datasets,and the results show that REQF is more effective at capturing role information in the network,which outperforms the best baseline by up to 14.6% in role classification,and 23% in role detection on average.
基金This work was supported by the National Natural Science Foundation of China(NSFC)under Grant U19B2004in part by National Key R&D Program of China under Grant 2022YFB2901202+1 种基金in part by the Open Funding Projects of the State Key Laboratory of Communication Content Cognition(No.20K05 and No.A02107)in part by the Special Fund for Science and Technology of Guangdong Province under Grant 2019SDR002.
文摘For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most existing studies on this subject mainly concentrate on monoplex networks considering a single type of relation among nodes.However,numerous real-world networks are naturally composed of multiple layers with different relation types;such a network is called a multiplex network.The majority of existing multiplex network embedding methods either overlook node attributes,resort to node labels for training,or underutilize underlying information shared across multiple layers.In this paper,we propose Multiplex Network Infomax(MNI),an unsupervised embedding framework to represent information of multiple layers into a unified embedding space.To be more specific,we aim to maximize the mutual information between the unified embedding and node embeddings of each layer.On the basis of this framework,we present an unsupervised network embedding method for attributed multiplex networks.Experimental results show that our method achieves competitive performance on not only node-related tasks,such as node classification,clustering,and similarity search,but also a typical edge-related task,i.e.,link prediction,at times even outperforming relevant supervised methods,despite that MNI is fully unsupervised.
基金This work was supported by the National Natural Science Foundation of China under Grant Nos.U21B2046 and 62102402the National Key Research and Development Program of China under Grant No.2020AAA0105200.
文摘Network embedding,as an approach to learning low-dimensional representations of nodes,has been proved extremely useful in many applications,e.g.,node classification and link prediction.Unfortunately,existing network embed-ding models are vulnerable to random or adversarial perturbations,which may degrade the performance of network em-bedding when being applied to downstream tasks.To achieve robust network embedding,researchers introduce adversari-al training to regularize the embedding learning process by training on a mixture of adversarial examples and original ex-amples.However,existing methods generate adversarial examples heuristically,failing to guarantee the imperceptibility of generated adversarial examples,and thus limit the power of adversarial training.In this paper,we propose a novel method Identity-Preserving Adversarial Training(IPAT)for network embedding,which generates imperceptible adversarial exam-ples with explicit identity-preserving regularization.We formalize such identity-preserving regularization as a multi-class classification problem where each node represents a class,and we encourage each adversarial example to be discriminated as the class of its original node.Extensive experimental results on real-world datasets demonstrate that our proposed IPAT method significantly improves the robustness of network embedding models and the generalization of the learned node representations on various downstream tasks.
基金supported in part by the National Natural Science Foundation of China(51977082)Guangdong Basic and Applied Basic Research Foundation(2021A1515110675)the Project funded by China Postdoctoral Science Foundation(2021M701239)。
文摘In power systems,failures of vulnerable lines can trigger large-scale cascading failures,and vulnerability assessment is dedicated to locating these lines and reducing the risks of such failures.Based on a structure and attribute network embedding(SANE)algorithm,a novel quantitative vulnerability analysis method is proposed to identify vulnerable lines in this research.First,a two-layered random walk network with topological and electrical properties of transmission lines is established.Subsequently,based on the weighted degree of nodes in the two-layered network,the inter-layer and intra-layer walking transition probabilities are developed to obtain walk sequences.Then,a Word2Vec algorithm is applied to obtain lowdimension vectors representing transmission lines,according to obtained walk sequences for calculating the vulnerability index of transmissions lines.Finally,the proposed method is compared with three widely used methods in two test systems.Results show the network embedding based method is superior to those comparison methods and can provide guidance for identifying vulnerable lines.
基金supported by the National Natural Science Foundation of China(Grant Nos.61572537,U1501252).
文摘In this paper,we address the problem of unsuperised social network embedding,which aims to embed network nodes,including node attributes,into a latent low dimensional space.In recent methods,the fusion mechanism of node attributes and network structure has been proposed for the problem and achieved impressive prediction performance.However,the non-linear property of node attributes and network structure is not efficiently fused in existing methods,which is potentially helpful in learning a better network embedding.To this end,in this paper,we propose a novel model called ASM(Adaptive Specific Mapping)based on encoder-decoder framework.In encoder,we use the kernel mapping to capture the non-linear property of both node attributes and network structure.In particular,we adopt two feature mapping functions,namely an untrainable function for node attributes and a trainable function for network structure.By the mapping functions,we obtain the low dimensional feature vectors for node attributes and network structure,respectively.Then,we design an attention layer to combine the learning of both feature vectors and adaptively learn the node embedding.In encoder,we adopt the component of reconstruction for the training process of learning node attributes and network structure.We conducted a set of experiments on seven real-world social network datasets.The experimental results verify the effectiveness and efficiency of our method in comparison with state-of-the-art baselines.
