Yu Yang

Orcid: 0000-0002-8209-2898

Affiliations:

City University of Hong Kong, School of Data Science, Hong Kong
Simon Fraser University, Burnaby, Canada (PhD)
University of Science and Technology of China, Hefei, China (former)

According to our database¹, Yu Yang authored at least 41 papers between 2012 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Dynamic Assortment Selection Under Inventory and Limited Switches Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2024

Boosting Gradient Ascent for Continuous DR-submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2024

2023

An Empirical Study of User Engagement in Influencer Marketing on Weibo and WeChat.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Soc. Syst., December, 2023

Optimal Batched Best Arm Identification.

[BibT_eX]

[DOI]

CoRR, 2023

Ambient Backscatter with a Single Commodity AP.

[BibT_eX]

[DOI]

Yifan Yang

Wei Gong

Yu Yang

Proceedings of the 31st IEEE/ACM International Symposium on Quality of Service, 2023

Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback.

[BibT_eX]

[DOI]

CoRR, 2022

MNL-Bandits under Inventory and Limited Switches Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Continuous Submodular Maximization: Boosting via Non-oblivious Function.

[BibT_eX]

[DOI]

CoRR, 2022

Just-in-time single-batch-processing machine scheduling.

[BibT_eX]

[DOI]

Hongbin Zhang

Yu Yang

Feng Wu

Comput. Oper. Res., 2022

Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Influence Analysis in Evolving Networks: A Survey.

[BibT_eX]

[DOI]

Yu Yang

Jian Pei

IEEE Trans. Knowl. Data Eng., 2021

Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Comprehensible Counterfactual Explanation on Kolmogorov-Smirnov Test.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Representation Learning for Predicting Customer Orders.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020

Continuous Influence Maximization.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2020

IAS-CNN: Image adaptive steganalysis via convolutional neural network combined with selection channel.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2020

Comprehensible Counterfactual Interpretation on Kolmogorov-Smirnov Test.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Online Density Bursting Subgraph Detection from Temporal Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Finding Theme Communities from Database Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Learning Action-Transferable Policy with Action Embedding.

[BibT_eX]

[DOI]

CoRR, 2019

Tracking Top-k Influential Users with Relative Errors.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Influence efficiency maximization: How can we spread information efficiently?

[BibT_eX]

[DOI]

J. Comput. Sci., 2018

Tracking Top-K Influential Vertices in Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2018

Mining Density Contrast Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

Tracking Influential Individuals in Dynamic Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

Activity Maximization by Effective Information Diffusion in Social Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

An Influence Propagation View of PageRank.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2017

Measuring in-network node similarity based on neighborhoods: a unified parametric approach.

[BibT_eX]

[DOI]

Yu Yang

Jian Pei

Abdullah Al-Barakati

Knowl. Inf. Syst., 2017

Finding Theme Communities from Database Networks: from Mining to Indexing and Query Answering.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Tracking Influential Nodes in Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2016

Activity Maximization by Effective Information Diffusion in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2016

Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users?

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Management of Data, 2016

2015

In-Network Neighborhood-Based Node Similarity Measure: A Unified Parametric Model.

[BibT_eX]

[DOI]

Yu Yang

Jian Pei

CoRR, 2015

Information Coverage Maximization in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2015

Maximizing the Coverage of Information Propagation in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2013

PageRank with Priors: An Influence Propagation Perspective.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

2012

A Social Influence Model Based On Circuit Theory

[BibT_eX]

[DOI]

CoRR, 2012

On Approximation of Real-World Influence Spread.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Yu Yang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...