Zhenzhen Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhenzhen Xu has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Feng Xia
School of Computing Technologies, RMIT University
3 shared publications - Xiangjie Kong
College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, China
3 shared publications Huizhen Jiang
Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province, School of Software, Dalian University of Technology, Dalian, China
2 shared publicationsXiaowei Zhao
Dalian University of Technology
2 shared publicationsXiujuan Xu
Dalian University of Technology
2 shared publicationsAhmedin Mohammed Ahmed
School of Software Dalian University of Technology Dalian 116620 China
1 shared publication
Latest Publications
- 4 August 2017
- Published by Springer Nature in Scientometrics
- Vol. 113 (1) , 369-385
Exploring dynamic research interest and academic influence for scientific collaborator recommendation
- 4 August 2017
- Published by Springer Nature in Scientometrics
- Vol. 113 (1) , 369-385
Exploring dynamic research interest and academic influence for scientific collaborator recommendation
- 13 November 2016
- Published by Springer Nature
- p. 507-519
Effective Traffic Flow Forecasting Using Taxi and Weather Data
- 13 November 2016
- Published by Springer Nature
- p. 507-519
Effective Traffic Flow Forecasting Using Taxi and Weather Data
- Open Access
- 5 February 2016
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 11 (2) , e0148492
Exploiting Publication Contents and Collaboration Networks for Collaborator Recommendation
Thanks to the proliferation of online social networks, it has become conventional for researchers to communicate and collaborate with each other. Meanwhile, one critical challenge arises, that is, how to find the most relevant and potential collaborators for each researcher? In this work, we propose a novel collaborator recommendation model called CCRec, which combines the information on researchers’ publications and collaboration network to generate better recommendation. In order to effectively identify the most potential collaborators for researchers, we adopt a topic clustering model to identify the academic domains, as well as a random walk model to compute researchers’ feature vectors. Using DBLP datasets, we conduct benchmarking experiments to examine the performance of CCRec. The experimental results show that CCRec outperforms other state-of-the-art methods in terms of precision, recall and F1 score.
- 5 February 2016
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 11 (2) , e0148492
Open AccessExploiting Publication Contents and Collaboration Networks for Collaborator Recommendation
Thanks to the proliferation of online social networks, it has become conventional for researchers to communicate and collaborate with each other. Meanwhile, one critical challenge arises, that is, how to find the most relevant and potential collaborators for each researcher? In this work, we propose a novel collaborator recommendation model called CCRec, which combines the information on researchers’ publications and collaboration network to generate better recommendation. In order to effectively identify the most potential collaborators for researchers, we adopt a topic clustering model to identify the academic domains, as well as a random walk model to compute researchers’ feature vectors. Using DBLP datasets, we conduct benchmarking experiments to examine the performance of CCRec. The experimental results show that CCRec outperforms other state-of-the-art methods in terms of precision, recall and F1 score.
- Open Access
- 1 January 2016
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 13 (2) , 359-373
Cross-domain item recommendation based on user similarity
Cross-domain recommender systems adopt multiple methods to build relations from source domain to target domain in order to alleviate problems of cold start and sparsity, and improve the performance of recommendations. The majority of traditional methods tend to associate users and items, which neglected the strong influence of friend relation on the recommendation. In this paper, we propose a cross-domain item recommendation model called CRUS based on user similarity, which firstly introduces the trust relation among friends into cross-domain recommendation. Despite friends usually tend to have similar interests in some domains, they share differences either. Considering this, we define all the similar users with the target user as Similar Friends. By modifying the transfer matrix in the random walk, friends sharing similar interests are highlighted. Extensive experiments on Yelp data set show CRUS outperforms the baseline methods on MAE and RMSE.
- 1 January 2016
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 13 (2) , 359-373
Open AccessCross-domain item recommendation based on user similarity
Cross-domain recommender systems adopt multiple methods to build relations from source domain to target domain in order to alleviate problems of cold start and sparsity, and improve the performance of recommendations. The majority of traditional methods tend to associate users and items, which neglected the strong influence of friend relation on the recommendation. In this paper, we propose a cross-domain item recommendation model called CRUS based on user similarity, which firstly introduces the trust relation among friends into cross-domain recommendation. Despite friends usually tend to have similar interests in some domains, they share differences either. Considering this, we define all the similar users with the target user as Similar Friends. By modifying the transfer matrix in the random walk, friends sharing similar interests are highlighted. Extensive experiments on Yelp data set show CRUS outperforms the baseline methods on MAE and RMSE.
- Open Access
- 18 December 2015
- Published by Springer Nature in SpringerPlus
- Vol. 4 (1) , 1-13
Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date
To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ( $$P|{{d}_{j}}=d|{{Y}_{w}}$$ ). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of scheduling. Since this problem is known to be NP-hard, three meta-heuristic algorithms, namely ant colony system, genetic algorithm, and simulated annealing are designed and implemented, respectively. We also propose a novel algorithm named LDF (largest density first) which is improved from LPT (longest processing time first). The computational experiments compared these meta-heuristic algorithms with LDF, LPT and LS (list scheduling), and the experimental results show that SA performs the best in most cases. However, LDF is better than SA in some conditions, moreover, the running time of LDF is much shorter than SA.- 18 December 2015
- Published by Springer Nature in SpringerPlus
- Vol. 4 (1) , 1-13
Open AccessMeta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date
To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ( $$P|{{d}_{j}}=d|{{Y}_{w}}$$ ). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of scheduling. Since this problem is known to be NP-hard, three meta-heuristic algorithms, namely ant colony system, genetic algorithm, and simulated annealing are designed and implemented, respectively. We also propose a novel algorithm named LDF (largest density first) which is improved from LPT (longest processing time first). The computational experiments compared these meta-heuristic algorithms with LDF, LPT and LS (list scheduling), and the experimental results show that SA performs the best in most cases. However, LDF is better than SA in some conditions, moreover, the running time of LDF is much shorter than SA. - 5 October 2014
- Published by Wiley in International Journal of Communication Systems
- Vol. 30 (1) , e2857
Bio‐inspired packet dropping for ad‐hoc social networks
Summary: Ad‐hoc social networks (ASNETs) explore social properties of nodes in communications. The usage of various social applications in a resource‐scarce environment and the dynamic nature of the network create unnecessary congestion that might degrade the quality of service dramatically. Traditional approaches use drop‐tail or random‐early discard techniques to drop data packets from the intermediate node queue. Nonetheless, because of the unavailability of the social properties, these techniques are not suitable for ASNETs. In this paper, we propose a Bio‐inspired packet dropping (BPD) algorithm for ASNETS. BPD imitates the matching procedure of receptors and epitopes in immune systems to detect congestions. The drop probability settings depend on the selection of data packets, which is based on node popularity level. BPD selects the most prioritized node through social properties, which is inspired by the B‐cell stimulation in immune systems. To fairly prioritize data packets, two social properties are used: (1) similarity and (2) closeness centrality between nodes. Extensive simulations are carried out to evaluate and compare BPD to other existing schemes in terms of mean goodput, mean loss rate, throughput, delay, attained bandwidth, and overhead ratio. The results show that the proposed scheme outperforms these existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.
- 5 October 2014
- Published by Wiley in International Journal of Communication Systems
- Vol. 30 (1) , e2857
Bio‐inspired packet dropping for ad‐hoc social networks
Summary: Ad‐hoc social networks (ASNETs) explore social properties of nodes in communications. The usage of various social applications in a resource‐scarce environment and the dynamic nature of the network create unnecessary congestion that might degrade the quality of service dramatically. Traditional approaches use drop‐tail or random‐early discard techniques to drop data packets from the intermediate node queue. Nonetheless, because of the unavailability of the social properties, these techniques are not suitable for ASNETs. In this paper, we propose a Bio‐inspired packet dropping (BPD) algorithm for ASNETS. BPD imitates the matching procedure of receptors and epitopes in immune systems to detect congestions. The drop probability settings depend on the selection of data packets, which is based on node popularity level. BPD selects the most prioritized node through social properties, which is inspired by the B‐cell stimulation in immune systems. To fairly prioritize data packets, two social properties are used: (1) similarity and (2) closeness centrality between nodes. Extensive simulations are carried out to evaluate and compare BPD to other existing schemes in terms of mean goodput, mean loss rate, throughput, delay, attained bandwidth, and overhead ratio. The results show that the proposed scheme outperforms these existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.
- 1 February 2013
- Published by Elsevier in Information Processing Letters
- Vol. 113 (4) , 127-131
Semi-online hierarchical scheduling problems with buffer or rearrangements
- 1 February 2013
- Published by Elsevier in Information Processing Letters
- Vol. 113 (4) , 127-131
Semi-online hierarchical scheduling problems with buffer or rearrangements