Yinghui Wang

Dr. Yinghui Wang


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 May 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
TLTianpeng Li
Tianpeng Li
WWWenjun Wang
Wenjun Wang
PJPengfei Jiao
Pengfei Jiao
YWYinghui Wang
Yinghui Wang
RDRuomeng Ding
Ruomeng Ding
Jin DiJin Di
Jin Di
Temporal community detection is helpful to discover and analyze significant groups or clusters hidden in dynamic networks in the real world. A variety of methods, such as modularity optimization, spectral method, and statistical network model, has been developed from diversified perspectives. Recently, network embedding-based technologies have made significant progress, and one can exploit deep learning superiority to network tasks. Although some methods for static networks have shown promising results in boosting community detection by integrating community embedding, they are not suitable for temporal networks and unable to capture their dynamics. Furthermore, the dynamic embedding methods only model network varying without considering community structures. Hence, in this article, we propose a novel unsupervised dynamic community detection model, which is based on network embedding and can effectively discover temporal communities and model dynamic networks. More specifically, we propose the community prior by introducing the Gaussian mixture model (GMM) in the variational autoencoder, which can obtain community information and better model the evolutionary characteristics of community structure and node embedding by utilizing the variant of gated recurrent unit (GRU). Extensive experiments conducted in real-world and artificial networks demonstrate that our proposed model has a better effect on improving the accuracy of dynamic community detection.

3 June 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
MGMengzhou Gao
Mengzhou Gao
PJPengfei Jiao
Pengfei Jiao
RLRuili Lu
Ruili Lu
Huaming WuHuaming Wu
Huaming Wu
YWYinghui Wang
Yinghui Wang
Zhidong ZhaoZhidong Zhao
Zhidong Zhao
Network embedding is an important class of link prediction methods, which can use the distance between learned low-dimensional node representations to characterize the similarity between nodes. Traditional network embedding methods focus on single-layer networks, while in reality, a large part of complex networks are not isolated, but interdependent and interrelated, forming multiplex complex networks. Also, how to effectively exploit layer correlations in multiplex networks to learn more robust and valuable representations, to improve link prediction performance, has been a hot research topic in the field of complex network analysis. However, previous studies mainly focus on inferring intralinks in each layer of complex networks or anchor links among layers. Another issue that has not been discussed is how to predict potential links or reconstruct the network in unobserved relations based on existing multiplex networks. To this issue, we define a novel inductive link prediction problem in multiplex networks, in which most existing multichannel network embedding methods fail to solve. This is either because they only emphasize the specific structure information of an individual layer or only capture the common information for all layers. To effectively address this problem, we propose a novel embedding method termed interactive learning across relations (ILAR), to capture and fully exploit the multiple relations and complex layer correlations in multiplex networks. We leverage two convolutional modules and ILAR to capture the sufficient complementary and correlations in multiplex networks. Moreover, during interactive learning, a disparity constraint is introduced, which enforces the features encoded from two convolutional modules to be different and prevents information redundancy. Finally, the extensive experiments in several real-world datasets show that our model can significantly outperform the existing state-of-the-art network embedding methods on the novel link prediction problem in multiplex networks.

22 November 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PJPengfei Jiao
Pengfei Jiao
TLTianpeng Li
Tianpeng Li
YXYingjie Xie
Yingjie Xie
YWYinghui Wang
Yinghui Wang
WWWenjun Wang
Wenjun Wang
Huaming WuHuaming Wu
Huaming Wu
Anomaly detection in dynamic networks aims to find network elements with significantly different behaviors from the vast majority. Most existing methods focus on one specific task, that is, only detect anomalies of one type of element isolated, so they lose the ability to model the correlation and driving mechanism between different abnormal behavior. Considering that the anomaly detection of one type of element is helpful to other types of elements. In this paper, we propose a unified Generation model to analyze the dynamic network for Exploring the Abnormal Behaviors of different Scales (GEABS). It can model the relation and catch different levels of anomaly with a joint statistical network model and detect the community structure and its evolution. Specifically, we denote the parameters of node popularity, community membership to generate the dynamic network, we also describe the varying of node and community by dynamic process. It can detect the change point on network, temporal evolution on community and abnormal behavior on node level synchronously, besides, it also detects the community structure effectively. We also propose an effective optimization algorithm with variational inference. Experimental results show that the GEABS achieves better performance on abnormal behavior and community structure compared with baselines.

28 May 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YWYinghui Wang
Yinghui Wang
QPQiyao Peng
Qiyao Peng
WWWenjun Wang
Wenjun Wang
XGXuan Guo
Xuan Guo
MSMinglai Shao
Minglai Shao
LPLin Pan
Lin Pan

26 November 2024 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
QPQiyao Peng
Qiyao Peng
HXHongyan Xu
Hongyan Xu
YWYinghui Wang
Yinghui Wang
HLHongtao Liu
Hongtao Liu
CHCuiying Huo
Cuiying Huo
WWWenjun Wang
Wenjun Wang
Finding experts is essential in Community Question Answering (CQA) platforms as it enables the effective routing of questions to potential users who can provide relevant answers. The key is to personalized learning expert representations based on their historical answered questions, and accurately matching them with target questions. Recently, the applications of Pre-Trained Language Models (PLMs) have gained significant attraction due to their impressive capability to comprehend textual data, and are widespread used across various domains. There have been some preliminary works exploring the usability of PLMs in expert finding, such as pre-training expert or question representations. However, these models usually learn pure text representations of experts from histories, disregarding personalized and fine-grained expert modeling. For alleviating this, we present a personalized pre-training and fine-tuning paradigm, which could effectively learn expert interest and expertise simultaneously. Specifically, in our pre-training framework, we integrate historical answered questions of one expert with one target question, and regard it as a candidate-aware expert-level input unit. Then, we fuse expert IDs into the pre-training for guiding the model to model personalized expert representations, which can help capture the unique characteristics and expertise of each individual expert. Additionally, in our pre-training task, we design (1) a question-level masked language model task to learn the relatedness between histories, enabling the modeling of question-level expert interest; (2) a vote-oriented task to capture question-level expert expertise by predicting the vote score the expert would receive. Through our pre-training framework and tasks, our approach could holistically learn expert representations including interests and expertise. Our method has been extensively evaluated on six real-world CQA datasets, and the experimental results consistently demonstrate the superiority of our approach over competitive baseline methods.

24 May 2024 in Information Processing & Management
Verified
Journal Article
Closed access
YWYinghui Wang
Yinghui Wang
QPQiyao Peng
Qiyao Peng
HLHongtao Liu
Hongtao Liu
HXHongyan Xu
Hongyan Xu
MSMinglai Shao
Minglai Shao
WWWenjun Wang
Wenjun Wang