embedding methods
Recently Published Documents





2022 ◽  
Vol 16 (3) ◽  
pp. 1-21
Heli Sun ◽  
Yang Li ◽  
Bing Lv ◽  
Wujie Yan ◽  
Liang He ◽  

Graph representation learning aims at learning low-dimension representations for nodes in graphs, and has been proven very useful in several downstream tasks. In this article, we propose a new model, Graph Community Infomax (GCI), that can adversarial learn representations for nodes in attributed networks. Different from other adversarial network embedding models, which would assume that the data follow some prior distributions and generate fake examples, GCI utilizes the community information of networks, using nodes as positive(or real) examples and negative(or fake) examples at the same time. An autoencoder is applied to learn the embedding vectors for nodes and reconstruct the adjacency matrix, and a discriminator is used to maximize the mutual information between nodes and communities. Experiments on several real-world and synthetic networks have shown that GCI outperforms various network embedding methods on community detection tasks.

2022 ◽  
Vol 16 (3) ◽  
pp. 1-32
Junchen Jin ◽  
Mark Heimann ◽  
Di Jin ◽  
Danai Koutra

While most network embedding techniques model the proximity between nodes in a network, recently there has been significant interest in structural embeddings that are based on node equivalences , a notion rooted in sociology: equivalences or positions are collections of nodes that have similar roles—i.e., similar functions, ties or interactions with nodes in other positions—irrespective of their distance or reachability in the network. Unlike the proximity-based methods that are rigorously evaluated in the literature, the evaluation of structural embeddings is less mature. It relies on small synthetic or real networks with labels that are not perfectly defined, and its connection to sociological equivalences has hitherto been vague and tenuous. With new node embedding methods being developed at a breakneck pace, proper evaluation, and systematic characterization of existing approaches will be essential to progress. To fill in this gap, we set out to understand what types of equivalences structural embeddings capture. We are the first to contribute rigorous intrinsic and extrinsic evaluation methodology for structural embeddings, along with carefully-designed, diverse datasets of varying sizes. We observe a number of different evaluation variables that can lead to different results (e.g., choice of similarity measure, classifier, and label definitions). We find that degree distributions within nodes’ local neighborhoods can lead to simple yet effective baselines in their own right and guide the future development of structural embedding. We hope that our findings can influence the design of further node embedding methods and also pave the way for more comprehensive and fair evaluation of structural embedding methods.

2022 ◽  
Vol 40 (3) ◽  
pp. 1-29
Meng Chen ◽  
Lei Zhu ◽  
Ronghui Xu ◽  
Yang Liu ◽  
Xiaohui Yu ◽  

Venue categories used in location-based social networks often exhibit a hierarchical structure, together with the category sequences derived from users’ check-ins. The two data modalities provide a wealth of information for us to capture the semantic relationships between those categories. To understand the venue semantics, existing methods usually embed venue categories into low-dimensional spaces by modeling the linear context (i.e., the positional neighbors of the given category) in check-in sequences. However, the hierarchical structure of venue categories, which inherently encodes the relationships between categories, is largely untapped. In this article, we propose a venue C ategory E mbedding M odel named Hier-CEM , which generates a latent representation for each venue category by embedding the Hier archical structure of categories and utilizing multiple types of context. Specifically, we investigate two kinds of hierarchical context based on any given venue category hierarchy and show how to model them together with the linear context collaboratively. We apply Hier-CEM to three tasks on two real check-in datasets collected from Foursquare. Experimental results show that Hier-CEM is better at capturing both semantic and sequential information inherent in venues than state-of-the-art embedding methods.

2022 ◽  
Vol 2022 ◽  
pp. 1-10
Chaozhi Fan ◽  
Law Siong Hook ◽  
Saifuzzaman Ibrahim ◽  
Mohd Naseem Ahmad

Networking is the use of physical links to connect individual isolated workstations or hosts together to form data links for the purpose of resource sharing and communication. In the field of web service application and consumer environment optimization, it has been shown that the introduction of network embedding methods can effectively alleviate the problems such as data sparsity in the recommendation process. However, existing network embedding methods mostly target a specific structure of network and do not collaborate with multiple relational networks from the root. Therefore, this paper proposes a service recommendation model based on the hybrid embedding of multiple networks and designs a multinetwork hybrid embedding recommendation algorithm. First, the user social relationship network and the user service heterogeneous information network are constructed; then, the embedding vectors of users and services in the same vector space are obtained through multinetwork hybrid embedding learning; finally, the representation vectors of users and services are applied to recommend services to target users. To verify the effectiveness of this paper’s method, a comparative analysis is conducted with a variety of representative service recommendation methods on three publicly available datasets, and the experimental results demonstrate that this paper’s multinetwork hybrid embedding method can effectively collaborate with multirelationship networks to improve service recommendation quality, in terms of recommendation efficiency and accuracy.

2021 ◽  
Vol 6 (2 (114)) ◽  
pp. 103-116
Vitalii Martovytskyi ◽  
Igor Ruban ◽  
Nataliia Bolohova ◽  
Оleksandr Sievierinov ◽  
Oleg Zhurylo ◽  

Active attacks and natural impacts can lead to two types of image-container distortions: noise-like and geometric. There are also image processing operations, e.g. scaling, rotation, truncation, pixel permutation which are much more detrimental to digital watermarks (DWM). While ensuring resistance to removal and geometric attacks is a more or less resolved problem, the provision of resistance to local image changes and partial image deletion is still poorly understood. The methods discussed in this paper are aimed at ensuring resistance to attacks resulting in partial image loss or local changes in the image. This study's objective is to develop methods for generating a distortion-resistant digital watermark using the chaos theory. This will improve the resistance of methods of embedding the digital watermark to a particular class of attacks which in turn will allow developers of DWM embedding methods to focus on ensuring the method resistance to other types of attacks. An experimental study of proposed methods was conducted. Histograms of DWMs have shown that the proposed methods provide for the generation of DWM of a random obscure form. However, the method based on a combination of Arnold’s cat maps and Henon maps has noticeable peaks unlike the method based on shuffling the pixels and their bits only with Arnold’s cat maps. This suggests that the method based only on Arnold’s cat maps is more chaotic. This is also evidenced by the value of the coefficient of correlation between adjacent pixels close to zero (0.0109) for color DWMs and 0.030 for black and white images.

2021 ◽  
Vol 12 ◽  
Jianzong Du ◽  
Dongdong Lin ◽  
Ruan Yuan ◽  
Xiaopei Chen ◽  
Xiaoli Liu ◽  

Diabetes mellitus is a group of complex metabolic disorders which has affected hundreds of millions of patients world-widely. The underlying pathogenesis of various types of diabetes is still unclear, which hinders the way of developing more efficient therapies. Although many genes have been found associated with diabetes mellitus, more novel genes are still needed to be discovered towards a complete picture of the underlying mechanism. With the development of complex molecular networks, network-based disease-gene prediction methods have been widely proposed. However, most existing methods are based on the hypothesis of guilt-by-association and often handcraft node features based on local topological structures. Advances in graph embedding techniques have enabled automatically global feature extraction from molecular networks. Inspired by the successful applications of cutting-edge graph embedding methods on complex diseases, we proposed a computational framework to investigate novel genes associated with diabetes mellitus. There are three main steps in the framework: network feature extraction based on graph embedding methods; feature denoising and regeneration using stacked autoencoder; and disease-gene prediction based on machine learning classifiers. We compared the performance by using different graph embedding methods and machine learning classifiers and designed the best workflow for predicting genes associated with diabetes mellitus. Functional enrichment analysis based on Human Phenotype Ontology (HPO), KEGG, and GO biological process and publication search further evaluated the predicted novel genes.

Sign in / Sign up

Export Citation Format

Share Document