Zhenzhen Xu

Zhenzhen Xu

Auto-generated profile, based on publicly available information

Zhenzhen Xu

Dalian University of Technology

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
5 February 2016 in PLOS ONE
Verified
Journal Article
Open access
PDF file
XKXiangjie Kong
Xiangjie Kong
HJHuizhen Jiang
Huizhen Jiang
ZYZhuo Yang
Zhuo Yang
ZXZhenzhen Xu
Zhenzhen Xu
FXFeng Xia
Feng Xia
Amr TolbaAmr Tolba
Amr Tolba
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.

4 August 2017 in Scientometrics
Verified
Journal Article
Closed access
PDF file
XKXiangjie Kong
Xiangjie Kong
HJHuizhen Jiang
Huizhen Jiang
WWWei Wang
Wei Wang
TBTeshome Megersa Bekele
Teshome Megersa Bekele
ZXZhenzhen Xu
Zhenzhen Xu
MWMeng Wang
Meng Wang

1 January 2016 in Computer Science and Information Systems
Verified
Journal Article
Open access
PDF file
XZXu Zhenzhen
Xu Zhenzhen
HJHuizhen Jiang
Huizhen Jiang
XKXiangjie Kong
Xiangjie Kong
JKJialiang Kang
Jialiang Kang
WWWei Wang
Wei Wang
FXFeng Xia
Feng Xia
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 February 2013 in Information Processing Letters
Verified
Journal Article
Closed access
XCXin Chen
Xin Chen
ZXZhenzhen Xu
Zhenzhen Xu
Gyorgy DosaGyorgy Dosa
Gyorgy Dosa
XHXin Han
Xin Han
HJHe Jiang
He Jiang

13 November 2016
Verified
Book Chapter
Closed access
PDF file
XXXiujuan Xu
Xiujuan Xu
BSBenzhe Su
Benzhe Su
XZXiaowei Zhao
Xiaowei Zhao
ZXZhenzhen Xu
Zhenzhen Xu
QSQuan Z. Sheng
Quan Z. Sheng

18 December 2015 in SpringerPlus
Verified
Journal Article
Open access
PDF file
ZXZhenzhen Xu
Zhenzhen Xu
YZYongxing Zou
Yongxing Zou
XKXiangjie Kong
Xiangjie Kong
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.