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.
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.
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.