TY - JOUR
T1 - SMEC
T2 - Scene Mining for E-Commerce
AU - Wang, Gang
AU - Li, Xiang
AU - Guo, Zi Yi
AU - Yin, Da Wei
AU - Ma, Shuai
N1 - Publisher Copyright:
© Institute of Computing Technology, Chinese Academy of Sciences 2024.
PY - 2024/2
Y1 - 2024/2
N2 - Scene-based recommendation has proven its usefulness in E-commerce, by recommending commodities based on a given scene. However, scenes are typically unknown in advance, which necessitates scene discovery for E-commerce. In this article, we study scene discovery for E-commerce systems. We first formalize a scene as a set of commodity categories that occur simultaneously and frequently in real-world situations, and model an E-commerce platform as a heterogeneous information network (HIN), whose nodes and links represent different types of objects and different types of relationships between objects, respectively. We then formulate the scene mining problem for E-commerce as an unsupervised learning problem that finds the overlapping clusters of commodity categories in the HIN. To solve the problem, we propose a non-negative matrix factorization based method SMEC (Scene Mining for E-Commerce), and theoretically prove its convergence. Using six real-world E-commerce datasets, we finally conduct an extensive experimental study to evaluate SMEC against 13 other methods, and show that SMEC consistently outperforms its competitors with regard to various evaluation measures.
AB - Scene-based recommendation has proven its usefulness in E-commerce, by recommending commodities based on a given scene. However, scenes are typically unknown in advance, which necessitates scene discovery for E-commerce. In this article, we study scene discovery for E-commerce systems. We first formalize a scene as a set of commodity categories that occur simultaneously and frequently in real-world situations, and model an E-commerce platform as a heterogeneous information network (HIN), whose nodes and links represent different types of objects and different types of relationships between objects, respectively. We then formulate the scene mining problem for E-commerce as an unsupervised learning problem that finds the overlapping clusters of commodity categories in the HIN. To solve the problem, we propose a non-negative matrix factorization based method SMEC (Scene Mining for E-Commerce), and theoretically prove its convergence. Using six real-world E-commerce datasets, we finally conduct an extensive experimental study to evaluate SMEC against 13 other methods, and show that SMEC consistently outperforms its competitors with regard to various evaluation measures.
KW - E-commerce
KW - graph clustering
KW - heterogeneous information network (HIN)
KW - scene mining
UR - https://www.scopus.com/pages/publications/85190122685
U2 - 10.1007/s11390-021-1277-0
DO - 10.1007/s11390-021-1277-0
M3 - 文章
AN - SCOPUS:85190122685
SN - 1000-9000
VL - 39
SP - 192
EP - 210
JO - Journal of Computer Science and Technology
JF - Journal of Computer Science and Technology
IS - 1
ER -