Zhaochun Ren

Zhaochun Ren

Auto-generated profile, based on publicly available information

Zhaochun Ren

Computer Science and Technology, Shandong University, 12589 Qingdao, Shandong China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 March 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YLYujie Lin
Yujie Lin
Pengjie RenPengjie Ren
Pengjie Ren
ZCZhumin Chen
Zhumin Chen
ZRZhaochun Ren
Zhaochun Ren
JMJun Ma
Jun Ma
MRMaarten de Rijke
Maarten de Rijke
Most previous work on outfit recommendation focuses on designing visual features to enhance recommendations. Existing work neglects user comments of fashion items, which have been proved to be effective in generating explanations along with better recommendation results. We propose a novel neural network framework, neural outfit recommendation (NOR), that simultaneously provides outfit recommendations and generates abstractive comments. NOR consists of two parts: outfit matching and comment generation. For outfit matching, we propose a convolutional neural network with a mutual attention mechanism to extract visual features. The visual features are then decoded into a rating score for the matching prediction. For abstractive comment generation, we propose a gated recurrent neural network with a cross-modality attention mechanism to transform visual features into a concise sentence. The two parts are jointly trained based on a multi-task learning framework in an end-to-end back-propagation paradigm. Extensive experiments conducted on an existing dataset and a collected real-world dataset show NOR achieves significant improvements over state-of-the-art baselines for outfit recommendation. Meanwhile, our generated comments achieve impressive ROUGE and BLEU scores in comparison to human-written comments. The generated comments can be regarded as explanations for the recommendation results. We release the dataset and code to facilitate future research.

2 May 2018 in Information Retrieval Journal
Verified
Journal Article
Closed access
PDF file
GPGaurav Pandey
Gaurav Pandey
ZRZhaochun Ren
Zhaochun Ren
SWShuaiqiang Wang
Shuaiqiang Wang
JVJari Veijalainen
Jari Veijalainen
MRMaarten de Rijke
Maarten de Rijke

19 October 2017 in arXiv
Verified
Preprint
Open access
PDF file
YMYao Ma
Yao Ma
SWSuhang Wang
Suhang Wang
ZRZhaoChun Ren
ZhaoChun Ren
DYDawei Yin
Dawei Yin
JTJiliang Tang
Jiliang Tang
Networks such as social networks, airplane networks, and citation networks are ubiquitous. The adjacency matrix is often adopted to represent a network, which is usually high dimensional and sparse. However, to apply advanced machine learning algorithms to network data, low-dimensional and continuous representations are desired. To achieve this goal, many network embedding methods have been proposed recently. The majority of existing methods facilitate the local information i.e. local connections between nodes, to learn the representations, while completely neglecting global information (or node status), which has been proven to boost numerous network mining tasks such as link prediction and social recommendation. Hence, it also has potential to advance network embedding. In this paper, we study the problem of preserving local and global information for network embedding. In particular, we introduce an approach to capture global information and propose a network embedding framework LOG, which can coherently model {\bf LO}cal and {\bf G}lobal information. Experimental results demonstrate the ability to preserve global information of the proposed framework. Further experiments are conducted to demonstrate the effectiveness of learned representations of the proposed framework.