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

Yang Yang 0095

dblp:48/450-95 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · conflict

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 3Security and privacy · 1 · 1 first-author

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
3 papers
Optimization for machine learning · 34% Time series and sequential data · 23% Representation and self-supervised learning · 23%
Databases, data mining, and information retrieval
2 papers
Data mining · 50% Information retrieval · 38% Machine learning and data management · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Time series and sequential data › anomaly detection
deep anomaly detection
0.412020
Deep Learning for Anomaly Detection · KDD 2020
Machine learning › Representation and self-supervised learning
deep one-class classification
0.412020
Deep Learning for Anomaly Detection · KDD 2020
Data mining
anomaly detection
0.412020
Deep Learning for Anomaly Detection · WSDM 2020
Data mining › anomaly detection
deep anomaly detection
0.412020
Deep Learning for Anomaly Detection · WSDM 2020
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.312018
Online Parameter Selection for Web-based Ranking Problems · KDD 2018
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
gaussian process optimization
0.312018
Online Parameter Selection for Web-based Ranking Problems · KDD 2018
Information retrieval › ranking
multi-objective ranking
0.312018
Online Parameter Selection for Web-based Ranking Problems · KDD 2018
Information retrieval
ranking
0.312018
Online Parameter Selection for Web-based Ranking Problems · KDD 2018
Machine learning › Deep learning architectures and training
autoencoder
0.112020
Deep Learning for Anomaly Detection · KDD 2020
Machine learning › Generative modeling
variational autoencoder
0.112020
Deep Learning for Anomaly Detection · KDD 2020
Machine learning and data management
online learning
0.112018
Online Parameter Selection for Web-based Ranking Problems · KDD 2018
Database system architecture and tuning › database tuning
online tuning
0.112018
Online Parameter Selection for Web-based Ranking Problems · KDD 2018

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

deep learning · 0.9gaussian process · 0.7bayesian optimization · 0.7a/b testing · 0.7transfer learning · 0.4reinforcement learning · 0.4
YearPublicationVenuePosition
2020 Deep Learning for Anomaly Detection
abstract
Anomaly detection has been widely studied and used in diverse applications. Building an effective anomaly detection system requires researchers and developers to learn complex structure from noisy data, identify dynamic anomaly patterns, and detect anomalies with limited labels. Recent advancements in deep learning techniques have greatly improved anomaly detection performance, in comparison with classical approaches, and have extended anomaly detection to a wide variety of applications. This tutorial will help the audience gain a comprehensive understanding of deep learning based anomaly detection techniques in various application domains. First, we give an overview of the anomaly detection problem, introducing the approaches taken before the deep model era and listing out the challenges they faced. Then we survey the state-of-the-art deep learning models that range from building block neural network structures such as MLP, CNN, and LSTM, to more complex structures such as autoencoder, generative models (VAE, GAN, Flow-based models), to deep one-class detection models, etc. In addition, we illustrate how techniques such as transfer learning and reinforcement learning can help amend the label sparsity issue in anomaly detection problems and how to collect and make the best use of user labels in practice. Second to last, we discuss real world use cases coming from and outside LinkedIn. The tutorial concludes with a discussion of future trends.
Ruoying Wang, Kexin Nie, Yen-Jung Chang, Xinwei Gong, Yang Yang 0095, Bo Long
KDD6
2020 Deep Learning for Anomaly Detection
abstract
Anomaly detection has been widely studied and used in diverse applications. Building an effective anomaly detection system requires the researchers/developers to learn the complex structure from noisy data, identify the dynamic anomaly patterns and detect anomalies while lacking sufficient labels. Recent advancement in deep learning techniques has made it possible to largely improve anomaly detection performance compared to the classical approaches. This tutorial will help the audience gain a comprehensive understanding of deep learning-based anomaly detection techniques in various application domains. First, it introduces what is the anomaly detection problem, the approaches taken before the deep model era and the challenges it faced. Then it surveys the state-of-the-art deep learning models extensively and discusses the techniques used to overcome the limitations from traditional algorithms. Second to last, it studies deep model anomaly detection techniques in real world examples from LinkedIn production systems. The tutorial concludes with a discussion of future trends.
Ruoying Wang, Kexin Nie, Yang Yang 0095, Bo Long
WSDM4
2018 Online Parameter Selection for Web-based Ranking Problems
abstract
Web-based ranking problems involve ordering different kinds of items in a list or grid to be displayed in mediums like a website or a mobile app. In most cases, there are multiple objectives or metrics like clicks, viral actions, job applications, advertising revenue and others that we want to balance. Constructing a serving algorithm that achieves the desired tradeoff among multiple objectives is challenging, especially for more than two objectives. In addition, it is often not possible to estimate such a serving scheme using offline data alone for non-stationary systems with frequent online interventions. We consider a large-scale online application where metrics for multiple objectives are continuously available and can be controlled in a desired fashion by changing certain control parameters in the ranking model. We assume that the desired balance of metrics is known from business considerations. Our approach models the balance criteria as a composite utility function via a Gaussian process over the space of control parameters. We show that obtaining a solution can be equated to finding the maximum of the Gaussian process, practically obtainable via Bayesian optimization. However, implementing such a scheme for large-scale applications is challenging. We provide a novel framework to do so and illustrate its efficacy in the context of LinkedIn Feed. In particular, we show the effectiveness of our method by using both offline simulations as well as promising online A/B testing results. At the time of writing this paper, the method described was fully deployed on the LinkedIn Feed.
Deepak Agarwal, Kinjal Basu 0001, Ying Xuan, Yang Yang 0095, Liang Zhang 0021
KDD5
2016 Scout: A Point of Presence Recommendation System Using Real User Monitoring Data
Yang Yang 0095, Liang Zhang 0021, Ritesh Maheshwari, Zaid Ali Kahn, Deepak Agarwal, Sanjay Dubey
PAM1