scholarly journals JANE: Jointly Adversarial Network Embedding

2020 ◽  
Author(s):  
Liang Yang ◽  
Yuexue Wang ◽  
Junhua Gu ◽  
Chuan Wang ◽  
Xiaochun Cao ◽  
...  
Keyword(s):  
Link Prediction ◽  
Real Data ◽  
Semantic Space ◽  
Network Embedding ◽  
Generative Adversarial Network ◽  
Adversarial Learning ◽  
Adversarial Network ◽  
Node Clustering ◽  
Topology Information ◽  
Embedding Methods

Motivated by the capability of Generative Adversarial Network on exploring the latent semantic space and capturing semantic variations in the data distribution, adversarial learning has been adopted in network embedding to improve the robustness. However, this important ability is lost in existing adversarially regularized network embedding methods, because their embedding results are directly compared to the samples drawn from perturbation (Gaussian) distribution without any rectification from real data. To overcome this vital issue, a novel Joint Adversarial Network Embedding (JANE) framework is proposed to jointly distinguish the real and fake combinations of the embeddings, topology information and node features. JANE contains three pluggable components, Embedding module, Generator module and Discriminator module. The overall objective function of JANE is defined in a min-max form, which can be optimized via alternating stochastic gradient. Extensive experiments demonstrate the remarkable superiority of the proposed JANE on link prediction (3% gains in both AUC and AP) and node clustering (5% gain in F1 score).

scholarly journals CryoGAN: A New Reconstruction Paradigm for Single-Particle Cryo-EM via Deep Adversarial Learning

2020 ◽  
Author(s):  
Harshit Gupta ◽  
Michael T. McCann ◽  
Laurène Donati ◽  
Michael Unser
Keyword(s):  
Single Particle ◽  
3D Structure ◽  
User Interaction ◽  
Real Data ◽  
New Paradigm ◽  
Contrast Transfer Function ◽  
Generative Adversarial Network ◽  
Volume Estimate ◽  
Adversarial Learning ◽  
Adversarial Network

We present CryoGAN, a new paradigm for single-particle cryo-EM reconstruction based on unsupervised deep adversarial learning. The major challenge in single-particle cryo-EM is that the imaged particles have unknown poses. Current reconstruction techniques are based on a marginalized maximum-likelihood formulation that requires calculations over the set of all possible poses for each projection image, a computationally demanding procedure. CryoGAN sidesteps this problem by using a generative adversarial network (GAN) to learn the 3D structure that has simulated projections that most closely match the real data in a distributional sense. The architecture of CryoGAN resembles that of standard GAN, with the twist that the generator network is replaced by a model of the cryo-EM image acquisition process. CryoGAN is an unsupervised algorithm that only demands projection images and an estimate of the contrast transfer function parameters. No initial volume estimate or prior training is needed. Moreover, CryoGAN requires minimal user interaction and can provide reconstructions in a matter of hours on a high-end GPU. In addition, we provide sound mathematical guarantees on the recovery of the correct structure. CryoGAN currently achieves a 8.6 Å resolution on a realistic synthetic dataset. Preliminary results on real β-galactosidase data demonstrate CryoGAN’s ability to exploit data statistics under standard experimental imaging conditions. We believe that this paradigm opens the door to a family of novel likelihood-free algorithms for cryo-EM reconstruction.

scholarly journals ALPINE: Active Link Prediction Using Network Embedding

2021 ◽  
Vol 11 (11) ◽  
pp. 5043
Author(s):  
Xi Chen ◽  
Bo Kang ◽  
Jefrey Lijffijt ◽  
Tijl De Bie
Keyword(s):  
Active Learning ◽  
Protein Interactions ◽  
Link Prediction ◽  
Prediction Accuracy ◽  
Real Data ◽  
Network Embedding ◽  
Protein Protein Interactions ◽  
Additional Information ◽  
The Cost ◽  
Active Link

Many real-world problems can be formalized as predicting links in a partially observed network. Examples include Facebook friendship suggestions, the prediction of protein–protein interactions, and the identification of hidden relationships in a crime network. Several link prediction algorithms, notably those recently introduced using network embedding, are capable of doing this by just relying on the observed part of the network. Often, whether two nodes are linked can be queried, albeit at a substantial cost (e.g., by questionnaires, wet lab experiments, or undercover work). Such additional information can improve the link prediction accuracy, but owing to the cost, the queries must be made with due consideration. Thus, we argue that an active learning approach is of great potential interest and developed ALPINE (Active Link Prediction usIng Network Embedding), a framework that identifies the most useful link status by estimating the improvement in link prediction accuracy to be gained by querying it. We proposed several query strategies for use in combination with ALPINE, inspired by the optimal experimental design and active learning literature. Experimental results on real data not only showed that ALPINE was scalable and boosted link prediction accuracy with far fewer queries, but also shed light on the relative merits of the strategies, providing actionable guidance for practitioners.

scholarly journals MultiVERSE: a multiplex and multiplex-heterogeneous network embedding approach

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Léo Pio-Lopez ◽  
Alberto Valdeolivas ◽  
Laurent Tichit ◽  
Élisabeth Remy ◽  
Anaïs Baudot
Keyword(s):  
Heterogeneous Networks ◽  
Heterogeneous Network ◽  
Link Prediction ◽  
Network Embedding ◽  
Multiplex Networks ◽  
Multiplex Network ◽  
Gene Associations ◽  
Different Types ◽  
Embedding Methods ◽  
Node Embeddings

AbstractNetwork embedding approaches are gaining momentum to analyse a large variety of networks. Indeed, these approaches have demonstrated their effectiveness in tasks such as community detection, node classification, and link prediction. However, very few network embedding methods have been specifically designed to handle multiplex networks, i.e. networks composed of different layers sharing the same set of nodes but having different types of edges. Moreover, to our knowledge, existing approaches cannot embed multiple nodes from multiplex-heterogeneous networks, i.e. networks composed of several multiplex networks containing both different types of nodes and edges. In this study, we propose MultiVERSE, an extension of the VERSE framework using Random Walks with Restart on Multiplex (RWR-M) and Multiplex-Heterogeneous (RWR-MH) networks. MultiVERSE is a fast and scalable method to learn node embeddings from multiplex and multiplex-heterogeneous networks. We evaluate MultiVERSE on several biological and social networks and demonstrate its performance. MultiVERSE indeed outperforms most of the other methods in the tasks of link prediction and network reconstruction for multiplex network embedding, and is also efficient in link prediction for multiplex-heterogeneous network embedding. Finally, we apply MultiVERSE to study rare disease-gene associations using link prediction and clustering. MultiVERSE is freely available on github at https://github.com/Lpiol/MultiVERSE.

scholarly journals 1D conditional generative adversarial network for spectrum-to-spectrum translation of simulated chemical reflectance signatures

2021 ◽  
Author(s):  
Cara Murphy ◽  
John Kerekes
Keyword(s):  
Classification Accuracy ◽  
Domain Adaptation ◽  
Real Data ◽  
Training Set ◽  
Generative Adversarial Network ◽  
Average Classification Accuracy ◽  
Adversarial Network ◽  
Chemical Residues ◽  
Reflectance Data

The classification of trace chemical residues through active spectroscopic sensing is challenging due to the lack of physics-based models that can accurately predict spectra. To overcome this challenge, we leveraged the field of domain adaptation to translate data from the simulated to the measured domain for training a classifier. We developed the first 1D conditional generative adversarial network (GAN) to perform spectrum-to-spectrum translation of reflectance signatures. We applied the 1D conditional GAN to a library of simulated spectra and quantified the improvement in classification accuracy on real data using the translated spectra for training the classifier. Using the GAN-translated library, the average classification accuracy increased from 0.622 to 0.723 on real chemical reflectance data, including data from chemicals not included in the GAN training set.

scholarly journals Semisupervised Community Preserving Network Embedding with Pairwise Constraints

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Dong Liu ◽  
Yan Ru ◽  
Qinpeng Li ◽  
Shibin Wang ◽  
Jianwei Niu
Keyword(s):  
Community Structure ◽  
Link Prediction ◽  
Learning Algorithms ◽  
Nonnegative Matrix ◽  
Machine Learning Algorithms ◽  
Network Visualization ◽  
Network Embedding ◽  
Pairwise Constraints ◽  
Node Clustering ◽  
Low Dimensional

Network embedding aims to learn the low-dimensional representations of nodes in networks. It preserves the structure and internal attributes of the networks while representing nodes as low-dimensional dense real-valued vectors. These vectors are used as inputs of machine learning algorithms for network analysis tasks such as node clustering, classification, link prediction, and network visualization. The network embedding algorithms, which considered the community structure, impose a higher level of constraint on the similarity of nodes, and they make the learned node embedding results more discriminative. However, the existing network representation learning algorithms are mostly unsupervised models; the pairwise constraint information, which represents community membership, is not effectively utilized to obtain node embedding results that are more consistent with prior knowledge. This paper proposes a semisupervised modularized nonnegative matrix factorization model, SMNMF, while preserving the community structure for network embedding; the pairwise constraints (must-link and cannot-link) information are effectively fused with the adjacency matrix and node similarity matrix of the network so that the node representations learned by the model are more interpretable. Experimental results on eight real network datasets show that, comparing with the representative network embedding methods, the node representations learned after incorporating the pairwise constraints can obtain higher accuracy in node clustering task and the results of link prediction, and network visualization tasks indicate that the semisupervised model SMNMF is more discriminative than unsupervised ones.

Antinoise Learning and Coalitional Game GAN

2021 ◽  
Author(s):  
Hongyou Chen ◽  
Hongjie He ◽  
Fan Chen ◽  
Yiming Zhu
Keyword(s):  
Image Quality ◽  
Real Data ◽  
Training Dataset ◽  
Generative Adversarial Networks ◽  
Coalitional Game ◽  
Generative Adversarial Network ◽  
Adversarial Learning ◽  
Network Convergence ◽  
The Stability ◽  
Zero Sum

Adversarial learning stability has an important influence on the generated image quality and convergence process in generative adversarial networks (GANs). Training dataset (real data) noise and the balance of game players have an impact on adversarial learning stability. In the gradient backpropagation of the discriminator, the noise samples increase the gradient variance. It can increase the uncertainty in the network convergence progress and affect stability. In the two-player zero-sum game, the game ability of the generator and discriminator is unbalanced. Generally, the game ability of the generator is weaker than that of the discriminator, which affects the stability. To improve the stability, an antinoise learning and coalitional game generative adversarial network (ANL-CG GAN) is proposed, which achieves this goal through the following two strategies. (i) In the real data loss function of the discriminator, an effective antinoise learning method is designed, which can improve the gradient variance and network convergence uncertainty. (ii) In the zero-sum game, a generator coalitional game module is designed to enhance its game ability, which can improve the balance between the generator and discriminator via a coalitional game strategy. To verify the performance of this model, the generated results of the designed GAN and other GAN models in CELEBA and CIFAR10 are compared and analyzed. Experimental results show that the novel GAN can improve adversarial learning stability, generate image quality, and reduce the number of training epochs.

Sound Field Reconstruction in Rooms with Deep Generative Models

2021 ◽  
Vol 263 (5) ◽  
pp. 1527-1538
Author(s):  
Xenofon Karakonstantis ◽  
Efren Fernandez Grande
Keyword(s):  
Plane Waves ◽  
Sound Field ◽  
Real Data ◽  
Generative Models ◽  
Random Wave ◽  
Generative Adversarial Network ◽  
Underlying Distribution ◽  
Adversarial Network ◽  
Reconstruction Methods ◽  
Free Region

The characterization of Room Impulse Responses (RIR) over an extended region in a room by means of measurements requires dense spatial with many microphones. This can often become intractable and time consuming in practice. Well established reconstruction methods such as plane wave regression show that the sound field in a room can be reconstructed from sparsely distributed measurements. However, these reconstructions usually rely on assuming physical sparsity (i.e. few waves compose the sound field) or trait in the measured sound field, making the models less generalizable and problem specific. In this paper we introduce a method to reconstruct a sound field in an enclosure with the use of a Generative Adversarial Network (GAN), which s new variants of the data distributions that it is trained upon. The goal of the proposed GAN model is to estimate the underlying distribution of plane waves in any source free region, and map these distributions from a stochastic, latent representation. A GAN is trained on a large number of synthesized sound fields represented by a random wave field and then tested on both simulated and real data sets, of lightly damped and reverberant rooms.

scholarly journals Text to Realistic Image Generation with Attentional Concatenation Generative Adversarial Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Linyan Li ◽  
Yu Sun ◽  
Fuyuan Hu ◽  
Tao Zhou ◽  
Xuefeng Xi ◽  
...  
Keyword(s):  
High Resolution ◽  
Image Synthesis ◽  
Semantic Space ◽  
Generative Adversarial Networks ◽  
Generative Adversarial Network ◽  
Fine Grained ◽  
Adversarial Network ◽  
Adversarial Networks ◽  
Cascade Structure ◽  
High Resolution Images

In this paper, we propose an Attentional Concatenation Generative Adversarial Network (ACGAN) aiming at generating 1024 × 1024 high-resolution images. First, we propose a multilevel cascade structure, for text-to-image synthesis. During training progress, we gradually add new layers and, at the same time, use the results and word vectors from the previous layer as inputs to the next layer to generate high-resolution images with photo-realistic details. Second, the deep attentional multimodal similarity model is introduced into the network, and we match word vectors with images in a common semantic space to compute a fine-grained matching loss for training the generator. In this way, we can pay attention to the fine-grained information of the word level in the semantics. Finally, the measure of diversity is added to the discriminator, which enables the generator to obtain more diverse gradient directions and improve the diversity of generated samples. The experimental results show that the inception scores of the proposed model on the CUB and Oxford-102 datasets have reached 4.48 and 4.16, improved by 2.75% and 6.42% compared to Attentional Generative Adversarial Networks (AttenGAN). The ACGAN model has a better effect on text-generated images, and the resulting image is closer to the real image.

scholarly journals Separating Chinese Character from Noisy Background Using GAN

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Bin Huang ◽  
Jiaqi Lin ◽  
Jinming Liu ◽  
Jie Chen ◽  
Jiemin Zhang ◽  
...  
Keyword(s):  
Character Recognition ◽  
Optical Character Recognition ◽  
Complex Structure ◽  
Real Data ◽  
Semantic Segmentation ◽  
Chinese Characters ◽  
Generative Adversarial Network ◽  
Adversarial Network ◽  
Basic Network ◽  
Noisy Background

Separating printed or handwritten characters from a noisy background is valuable for many applications including test paper autoscoring. The complex structure of Chinese characters makes it difficult to obtain the goal because of easy loss of fine details and overall structure in reconstructed characters. This paper proposes a method for separating Chinese characters based on generative adversarial network (GAN). We used ESRGAN as the basic network structure and applied dilated convolution and a novel loss function that improve the quality of reconstructed characters. Four popular Chinese fonts (Hei, Song, Kai, and Imitation Song) on real data collection were tested, and the proposed design was compared with other semantic segmentation approaches. The experimental results showed that the proposed method effectively separates Chinese characters from noisy background. In particular, our methods achieve better results in terms of Intersection over Union (IoU) and optical character recognition (OCR) accuracy.

Sign in / Sign up

Export Citation Format

Share Document