Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuexue Wang

dblp:269/4557 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 50% Generative modeling · 25% Trustworthy machine learning · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › network embedding
adversarial network embedding
0.412020
JANE: Jointly Adversarial Network Embedding · IJCAI 2020
Machine learning › Trustworthy machine learning › adversarial machine learning › adversarial defense
adversarial regularization
0.412020
JANE: Jointly Adversarial Network Embedding · IJCAI 2020
Machine learning › Generative modeling
generative adversarial network
0.412020
JANE: Jointly Adversarial Network Embedding · IJCAI 2020
Machine learning › Graph learning
network embedding
0.412020
JANE: Jointly Adversarial Network Embedding · IJCAI 2020

Methods — techniques the papers use, named apart from their topics

stochastic gradient descent · 0.4generative adversarial network · 0.4
YearPublicationVenuePosition
2020 JANE: Jointly Adversarial Network Embedding
abstract
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).
Liang Yang 0002, Yuexue Wang, Junhua Gu, Chuan Wang 0002, Xiaochun Cao, Yuanfang Guo
IJCAI2