TY - JOUR
T1 - Learning Hierarchical Preferences for Recommendation with Mixture Intention Neural Stochastic Processes
AU - Liu, Huafeng
AU - Jing, Liping
AU - Yu, Jian
AU - Ng, Michael K.
N1 - This work was supported in part by the Beijing Natural Science Foundation Youth Science Foundation under Grant 4244096, in part by the Natural Science Foundation of Chongqing under Grant CSTB2023NSCQ-MSX1020, in part by the National Key Research and Development Program under Grant 2020AAA0106800, in part by the Beijing Natural Science Foundation under Grant Z180006 and Grant L211016, in part by the National Natural Science Foundation of China under Grant 62176020, in part by the CAAI-Huawei MindSpore Open Fund, and in part by the Chinese Academy of Sciences under Grant OEIP-O-202004.
PY - 2024/7
Y1 - 2024/7
N2 - User preferences behind users’ decision-making processes are highly
diverse and may range from lower-level concepts with more specific
intentions and higher-level concepts with more general intentions. In
this case, user preferences tend to be expressed hierarchically.
However, learning such intentions with different levels from user
behaviors is challenging, and remains largely neglected by the existing
literature. Meanwhile, user behavior data tends to be sparse because of
the limited user response and the vast combinations of users and items,
which results in cold-start problems with unclear user intentions. In
this paper, we propose a mixture intention neural stochastic process
(MINSP), a new view of the stochastic processes family using a general
meta-learning mechanism and mixture strategy for robust recommendation
with hierarchical preferences modeling. By considering the
recommendation process for each user as a stochastic process, MINSP
defines distributions over functions and is capable of rapid adaptation
to different users. To capture the user's intention on different levels,
an iterative additive algorithm is proposed that minimizes the
approximation error by backfitting the residuals of previous
approximations. In this case, the induced tree intention hierarchies
serve as an aggregated structured representation of the whole
preference, summarizing the gist for convenient navigation and better
generalization. Furthermore, we theoretically analyze the generalization
error bound of the proposed MINSP to guarantee the model performance.
Empirical results show that our approach can achieve substantial
improvement over the state-of-the-art baselines in terms of
recommendation performance, and obtain an interpretable hierarchical
intention structure.
AB - User preferences behind users’ decision-making processes are highly
diverse and may range from lower-level concepts with more specific
intentions and higher-level concepts with more general intentions. In
this case, user preferences tend to be expressed hierarchically.
However, learning such intentions with different levels from user
behaviors is challenging, and remains largely neglected by the existing
literature. Meanwhile, user behavior data tends to be sparse because of
the limited user response and the vast combinations of users and items,
which results in cold-start problems with unclear user intentions. In
this paper, we propose a mixture intention neural stochastic process
(MINSP), a new view of the stochastic processes family using a general
meta-learning mechanism and mixture strategy for robust recommendation
with hierarchical preferences modeling. By considering the
recommendation process for each user as a stochastic process, MINSP
defines distributions over functions and is capable of rapid adaptation
to different users. To capture the user's intention on different levels,
an iterative additive algorithm is proposed that minimizes the
approximation error by backfitting the residuals of previous
approximations. In this case, the induced tree intention hierarchies
serve as an aggregated structured representation of the whole
preference, summarizing the gist for convenient navigation and better
generalization. Furthermore, we theoretically analyze the generalization
error bound of the proposed MINSP to guarantee the model performance.
Empirical results show that our approach can achieve substantial
improvement over the state-of-the-art baselines in terms of
recommendation performance, and obtain an interpretable hierarchical
intention structure.
KW - Hierarchical preferences
KW - Recommendation system
KW - Stochastic process
KW - User preference modeling
UR - http://www.scopus.com/inward/record.url?scp=85181561555&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2023.3348493
DO - 10.1109/TKDE.2023.3348493
M3 - Journal article
AN - SCOPUS:85181561555
SN - 1041-4347
VL - 36
SP - 3237
EP - 3251
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 7
ER -