Hong Liu

Hong Liu

Auto-generated profile, based on publicly available information

Hong Liu

Alibaba Group Hangzhou China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
YDYizhou Dang
Yizhou Dang
EYEnneng Yang
Enneng Yang
GGGuibing Guo
Guibing Guo
LJLinying Jiang
Linying Jiang
XWXingwei Wang
Xingwei Wang
HLHong Liu
Hong Liu
Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we observe that the time interval in a sequence may vary significantly different, and thus result in the ineffectiveness of user modeling due to the issue of preference drift. In fact, we conducted an empirical study to validate this observation, and found that a sequence with uniformly distributed time interval (denoted as uniform sequence) is more beneficial for performance improvement than that with greatly varying time interval. Therefore, we propose to augment sequence data from the perspective of time interval, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-Reorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of variance of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths. Finally, we implement these improvements on a state-of-the-art model CoSeRec and validate our approach on four real datasets. The experimental results show that our approach reaches significantly better performance than the other 9 competing methods. Our implementation is available: https://github.com/KingGugu/TiCoSeRec.

13 October 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YDYizhou Dang
Yizhou Dang
EYEnneng Yang
Enneng Yang
GGGuibing Guo
Guibing Guo
LJLinying Jiang
Linying Jiang
XWXingwei Wang
Xingwei Wang
HLHong Liu
Hong Liu
Sequential recommendation has now been more widely studied, characterized by its well-consistency with real-world recommendation situations. Most existing works model user preference as the transition pattern from the previous item to the next, ignoring the time interval between these two items. However, we find that the time intervals in different sequences may vary significantly and thus result in the ineffectiveness of user modeling due to the issue of preference drift . Thus we propose an assumption that a sequence with uniformly distributed time intervals (denoted as uniform sequence) is more beneficial for preference learning than that with greatly varying time intervals. We then conduct an empirical study on four real datasets and the results support this assumption. Therefore, we advocate to augment sequence data from the perspective of time intervals, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-CateReorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths and a looseness range to ensure the generalization (or diversity) of generated data. Finally, we implement these improvements on a state-of-the-art model CoSeRec and propose Ti me I nterval Aware CoSeRec (TiCoSeRec). Experimental results on four datasets demonstrate that TiCoSeRec achieves significantly better performance than other 11 counterparts recommendation techniques.

31 August 2014 in International Journal of Control and Automation
Verified
Journal Article
Closed access
ZZZhijun Zhang
Zhijun Zhang
HLHong Liu
Hong Liu

31 August 2024
Verified
Book Chapter
Closed access
PDF file
NLNian Liu
Nian Liu
SFShen Fan
Shen Fan
TBTing Bai
Ting Bai
PWPeng Wang
Peng Wang
MSMingwei Sun
Mingwei Sun
CSChuan Shi
Chuan Shi

17 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
YDYizhou Dang
Yizhou Dang
EYEnneng Yang
Enneng Yang
GGGuibing Guo
Guibing Guo
LJLinying Jiang
Linying Jiang
XWXingwei Wang
Xingwei Wang
HLHong Liu
Hong Liu
Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we observe that the time interval in a sequence may vary significantly different, and thus result in the ineffectiveness of user modeling due to the issue of \emph{preference drift}. In fact, we conducted an empirical study to validate this observation, and found that a sequence with uniformly distributed time interval (denoted as uniform sequence) is more beneficial for performance improvement than that with greatly varying time interval. Therefore, we propose to augment sequence data from the perspective of time interval, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-Reorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of variance of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths. Finally, we implement these improvements on a state-of-the-art model CoSeRec and validate our approach on four real datasets. The experimental results show that our approach reaches significantly better performance than the other 11 competing methods. Our implementation is available: https://github.com/KingGugu/TiCoSeRec.

19 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
QZQifang Zhao
Qifang Zhao
TLTianyu Li
Tianyu Li
MDMeng Du
Meng Du
YJYu Jiang
Yu Jiang
QSQinghui Sun
Qinghui Sun
HXHuan Xu
Huan Xu
When doing private domain marketing with cloud services, the merchants usually have to purchase different machine learning models for the multiple marketing purposes, leading to a very high cost. We present a unified user-item matching framework to simultaneously conduct item recommendation and user targeting with just one model. We empirically demonstrate that the above concurrent modeling is viable via modeling the user-item interaction matrix with the multinomial distribution, and propose a bidirectional bias-corrected NCE loss for the implementation. The proposed loss function guides the model to learn the user-item joint probability $p(u,i)$ instead of the conditional probability $p(i|u)$ or $p(u|i)$ through correcting both the users and items' biases caused by the in-batch negative sampling. In addition, our framework is model-agnostic enabling a flexible adaptation of different model architectures. Extensive experiments demonstrate that our framework results in significant performance gains in comparison with the state-of-the-art methods, with greatly reduced cost on computing resources and daily maintenance.