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.

Zhiyun Zhao

dblp:124/4348 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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
Kernel, tree and ensemble methods · 77% Learning paradigms · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › gradient boosting
gradient boosting decision tree
0.512021
Task-wise Split Gradient Boosting Trees for Multi-center Diabetes Prediction · KDD 2021
Distributed systems
consensus
0.312017
Robust semi-global leader-following practical consensus of a group of linear systems with imperfect actuators · Sci. China Inf. Sci. 2017
Distributed systems › distributed coordination › multi-agent systems › multi-agent consensus
leader-following consensus
0.312017
Robust semi-global leader-following practical consensus of a group of linear systems with imperfect actuators · Sci. China Inf. Sci. 2017
Machine learning › Learning paradigms
multi-task learning
0.112021
Task-wise Split Gradient Boosting Trees for Multi-center Diabetes Prediction · KDD 2021

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

multi-task learning · 1.0gradient boosting decision tree · 1.0robust control · 0.3
YearPublicationVenuePosition
2023 Research on the Evolution Path of Network Hotspot Events Based on the Event Evolutionary Graph
Peiguo Fu, Zhiyun Zhao
ICA3PP (6)4
2022 ALSA: Adversarial Learning of Supervised Attentions for Visual Question Answering
abstract
Visual question answering (VQA) has gained increasing attention in both natural language processing and computer vision. The attention mechanism plays a crucial role in relating the question to meaningful image regions for answer inference. However, most existing VQA methods: 1) learn the attention distribution either from free-form regions or detection boxes in the image, which is intractable in answering questions about the foreground object and background form, respectively and 2) neglect the prior knowledge of human attention and learn the attention distribution with an unguided strategy. To fully exploit the advantages of attention, the learned attention distribution should focus more on the question-related image regions, such as human attention for both the questions, about the foreground object and background form. To achieve this, this article proposes a novel VQA model, called adversarial learning of supervised attentions (ALSAs). Specifically, two supervised attention modules: 1) free form-based and 2) detection-based, are designed to exploit the prior knowledge for attention distribution learning. To effectively learn the correlations between the question and image from different views, that is, free-form regions and detection boxes, an adversarial learning mechanism is implemented as an interplay between two supervised attention modules. The adversarial learning reinforces the two attention modules mutually to make the learned multiview features more effective for answer inference. The experiments performed on three commonly used VQA datasets confirm the favorable performance of ALSA.
Yun Liu 0017, Xiaoming Zhang 0001, Zhiyun Zhao, Bo Zhang 0096, Zhoujun Li 0001
IEEE Trans. Cybern.3
2021 Task-wise Split Gradient Boosting Trees for Multi-center Diabetes Prediction
abstract
Diabetes prediction is an important data science application in the social healthcare domain. There exist two main challenges in the diabetes prediction task: data heterogeneity since demographic and metabolic data are of different types, data insufficiency since the number of diabetes cases in a single medical center is usually limited. To tackle the above challenges, we employ gradient boosting decision trees (GBDT) to handle data heterogeneity and introduce multi-task learning (MTL) to solve data insufficiency. To this end, Task-wise Split Gradient Boosting Trees (TSGB) is proposed for the multi-center diabetes prediction task. Specifically, we firstly introduce task gain to evaluate each task separately during tree construction, with a theoretical analysis of GBDT's learning objective. Secondly, we reveal a problem when directly applying GBDT in MTL, i.e., the negative task gain problem. Finally, we propose a novel split method for GBDT in MTL based on the task gain statistics, named task-wise split, as an alternative to standard feature-wise split to overcome the mentioned negative task gain problem. Extensive experiments on a large-scale real-world diabetes dataset and a commonly used benchmark dataset demonstrate TSGB achieves superior performance against several state-of-the-art methods. Detailed case studies further support our analysis of negative task gain problems and provide insightful findings. The proposed TSGB method has been deployed as an online diabetes risk assessment software for early diagnosis.
Mingcheng Chen, Zhenghui Wang, Zhiyun Zhao, Weinan Zhang 0001, Xiawei Guo, Jian Shen 0003, Yanru Qu, Jieli Lu, Wei-Wei Tu, Yong Yu 0001, Yufang Bi, Guang Ning
KDD3
2019 Semi-global containment control of discrete-time linear systems with actuator position and rate saturation
Zhiyun Zhao, Wen Yang 0002, Hongbo Shi 0002
Neurocomputing1
2017 Robust semi-global leader-following practical consensus of a group of linear systems with imperfect actuators
Liangren Shi, Zhiyun Zhao, Zongli Lin
Sci. China Inf. Sci.2
2016 FriendRank: A personalized approach for tweets ranking in social networks
abstract
The thousands of streaming data overwhelmingly provide for Internet users on Twitter every day, especially for those Twitter users with many friends. However, the useful tweets that users are really interested in personally could be covered by massive other uninformative and uninteresting information. Therefore, how to bring immediately the interesting tweets for users is always a challenging issue. In this paper, we consider the user friendships in detail and build an effective and practical model to calculate the friendships among users. Certainly, we also take user interests to tweets into account. We then propose a personalized approach for tweets ranking, which focus on the user friendships and the personal interests to tweets. The experimental results demonstrate that our proposed method greatly outperforms several baselines and the user friendships have really important effect on tweets ranking.
Linfeng Luo, Yibo Xue, Zhiyun Zhao
ASONAM5