Yunlei Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yunlei Zhang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Nianwen Ning
Henan University
2 shared publications Bin Wu
Beijing Key Laboratory of Intelligence Telecommunications Software and Multimedia, School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication- Bin Wu
Beijing University of Posts and Telecommunications, Beijing, Beijing, CHINA
1 shared publication Chenguang Song
Beijing Key Laboratory of Intelligence Telecommunications Software and Multimedia, School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication- Chenguang Song
China Institute of Geo-Environment Monitoring (Guide Center of Prevention Technology for Geo-hazards, MNR), Beijing, China
1 shared publication - Jinna Lv
Beijing Key Laboratory of Intelligence Telecommunications Software and Multimedia, School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication
Latest Publications
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1515-1519
An Adaptive Cross-Layer Sampling-Based Node Embedding for Multiplex Networks
Network embedding aims to learn a latent representation of each node which preserves the structure information. Many real-world networks have multiple dimensions of nodes and multiple types of relations. Therefore, it is more appropriate to represent such kind of networks as multiplex networks. A multiplex network is formed by a set of nodes connected in different layers by links indicating interactions of different types. However, existing random walk based multiplex networks embedding algorithms have problems with sampling bias and imbalanced relation types, thus leading the poor performance in the downstream tasks. In this paper, we propose a node embedding method based on adaptive cross-layer forest fire sampling (FFS) for multiplex networks (FFME). We first focus on the sampling strategies of FFS to address the bias issue of random walk. We utilize a fixed-length queue to record previously visited layers, which can balance the edge distribution over different layers in sampled node sequences. In addition, to adaptively sample node's context, we also propose a metric for node called Neighbors Partition Coefficient (N P C ). The generation process of node sequence is supervised by NPC for adaptive cross-layer sampling. Experiments on real-world networks in diverse fields show that our method outperforms the state-of-the-art methods in application tasks such as cross-domain link prediction and shared community structure detection.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1515-1519
An Adaptive Cross-Layer Sampling-Based Node Embedding for Multiplex Networks
Network embedding aims to learn a latent representation of each node which preserves the structure information. Many real-world networks have multiple dimensions of nodes and multiple types of relations. Therefore, it is more appropriate to represent such kind of networks as multiplex networks. A multiplex network is formed by a set of nodes connected in different layers by links indicating interactions of different types. However, existing random walk based multiplex networks embedding algorithms have problems with sampling bias and imbalanced relation types, thus leading the poor performance in the downstream tasks. In this paper, we propose a node embedding method based on adaptive cross-layer forest fire sampling (FFS) for multiplex networks (FFME). We first focus on the sampling strategies of FFS to address the bias issue of random walk. We utilize a fixed-length queue to record previously visited layers, which can balance the edge distribution over different layers in sampled node sequences. In addition, to adaptively sample node's context, we also propose a metric for node called Neighbors Partition Coefficient (N P C ). The generation process of node sequence is supervised by NPC for adaptive cross-layer sampling. Experiments on real-world networks in diverse fields show that our method outperforms the state-of-the-art methods in application tasks such as cross-domain link prediction and shared community structure detection.
- Open Access
- 10 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 74528-74541
Dynamic Topical Community Detection in Social Network: A Generative Model Approach
Social networks which are dynamic contain rich network structure and content information. In dynamic networks, it is necessary to discover communities and their topical meanings. However, existing methods either only discover communities with ignoring their topical meaning in dynamic networks, or they discover communities and their topics in static networks. In this paper, we identify the problem of dynamic topical community detection and propose a dynamic topical community detection(DTCD) method to detect communities and their topical meanings in dynamic networks. DTCD is a generative model integrating network structure, text and time. DTCD considers a community as a mixture of topics and generates the neighbors and documents of the node and their time stamps at the same time via the community. The latent variables are learned by collapsed Gibbs sampling. DTCD not only can find communities and their topics, but also capture the temporal variations of communities and topics. Experimental results on two real-world datasets demonstrate the effectiveness of DTCD.
- 10 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 74528-74541
Open AccessDynamic Topical Community Detection in Social Network: A Generative Model Approach
Social networks which are dynamic contain rich network structure and content information. In dynamic networks, it is necessary to discover communities and their topical meanings. However, existing methods either only discover communities with ignoring their topical meaning in dynamic networks, or they discover communities and their topics in static networks. In this paper, we identify the problem of dynamic topical community detection and propose a dynamic topical community detection(DTCD) method to detect communities and their topical meanings in dynamic networks. DTCD is a generative model integrating network structure, text and time. DTCD considers a community as a mixture of topics and generates the neighbors and documents of the node and their time stamps at the same time via the community. The latent variables are learned by collapsed Gibbs sampling. DTCD not only can find communities and their topics, but also capture the temporal variations of communities and topics. Experimental results on two real-world datasets demonstrate the effectiveness of DTCD.