Yu Yang

Orcid: 0000-0002-0604-048X

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 80 papers between 2012 and 2025.

Collaborative distances:

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

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

How to Provably Improve Return Conditioned Supervised Learning?

[BibT_eX]

[DOI]

CoRR, June, 2025

Adaptive Predefined Time Control for Stochastic Switched Nonlinear Systems With Full-State Error Constraints and Input Quantization.

[BibT_eX]

[DOI]

IEEE Trans. Cybern., May, 2025

An efficient continuous control perspective for reinforcement-learning-based sequential recommendation.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2025

Exact counting of subtrees with diameter no more than d in trees: A generating function approach.

[BibT_eX]

[DOI]

Inf. Comput., 2025

Graph convolutional network for traffic incidents duration classification.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2025

Command-filter-based neural networks predefined time control for switched nonlinear systems with event-triggering mechanism.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2025

Unanticipated Replenishment: Online Policy for Dynamic Service Composition in Manufacturing Cloud.

[BibT_eX]

[DOI]

Proceedings of the 2025 SIAM International Conference on Data Mining, 2025

GLINT-RU: Gated Lightweight Intelligent Recurrent Units for Sequential Recommender Systems.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.1, 2025

Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

Adversarial Attack and Defense on Discrete Time Dynamic Graphs.

[BibT_eX]

[DOI]

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

A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., July, 2024

Dynamic Assortment Selection Under Inventory and Limited Switches Constraints.

[BibT_eX]

[DOI]

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

Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., February, 2024

Dynamic cloud manufacturing service composition with re-entrant services: an online policy perspective.

[BibT_eX]

[DOI]

Yang Hu

Yu Yang

Feng Wu

Int. J. Prod. Res., 2024

Return Augmented Decision Transformer for Off-Dynamics Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2024

Pre-trained Language Models Improve the Few-shot Prompt Ability of Decision Transformer.

[BibT_eX]

[DOI]

Yu Yang

Pan Xu

CoRR, 2024

Boosting Gradient Ascent for Continuous DR-submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2024

Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations.

[BibT_eX]

[DOI]

Comput. J., 2024

More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling.

[BibT_eX]

[DOI]

RLJ, 2024

Optimal Batched Best Arm Identification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Efficient LTE Backscatter with Uncontrolled Ambient Traffic.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2024, 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

Enumerating Subtrees of Flower and Sunflower Networks.

[BibT_eX]

[DOI]

Symmetry, February, 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

On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees.

[BibT_eX]

[DOI]

Inf. Comput., 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

Algorithms Based on Path Contraction Carrying Weights for Enumerating Subtrees of Tricyclic Graphs.

[BibT_eX]

[DOI]

Comput. J., 2022

Enumeration of subtrees of planar two-tree networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2022

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

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Novel Fast Networking Approaches Mining Underlying Structures From Investment Big Data.

[BibT_eX]

[DOI]

Liping Yang

Yu Yang

Gervas Batister Mgaya

Bo Zhang

Long Chen

Hongbo Liu

IEEE Trans. Syst. Man Cybern. Syst., 2021

Influence Analysis in Evolving Networks: A Survey.

[BibT_eX]

[DOI]

Yu Yang

Jian Pei

IEEE Trans. Knowl. Data Eng., 2021

Self-Adaptive Skeleton Approaches to Detect Self-Organized Coalitions From Brain Functional Networks Through Probabilistic Mixture Models.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2021

Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

The expected subtree number index in random polyphenylene and spiro chains.

[BibT_eX]

[DOI]

Discret. Appl. Math., 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

A novel fuzzy rule extraction approach using Gaussian kernel-based granular computing.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2019

A Clustering Approach for Motif Discovery in ChIP-Seq Dataset.

[BibT_eX]

[DOI]

Entropy, 2019

Learning Action-Transferable Policy with Action Embedding.

[BibT_eX]

[DOI]

CoRR, 2019

Multi-distance granularity structural α-subtree index of generalized Bethe trees.

[BibT_eX]

[DOI]

Appl. Math. Comput., 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

Substructural Regularization With Data-Sensitive Granularity for Sequence Transfer Learning.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 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

On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains.

[BibT_eX]

[DOI]

Comput. J., 2017

2016

Maximum atom-bond connectivity index with given graph parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 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

Corrigendum to "Subtrees of spiro and polyphenyl hexagonal chains" [Applied Mathematics and Computation 268(2015) 547-560].

[BibT_eX]

[DOI]

Appl. Math. Comput., 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

Enumeration of BC-subtrees of trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Subtrees, BC-subtrees of generalized Bethe trees and related questions.

[BibT_eX]

Yu Yang

Hongbo Liu

Hua Wang

Ars Comb., 2015

Subtrees of spiro and polyphenyl hexagonal chains.

[BibT_eX]

[DOI]

Appl. Math. Comput., 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

On BC-trees and BC-subtrees

[BibT_eX]

[DOI]

CoRR, 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...