Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 192-210 |
| Number of pages | 19 |
| Journal | Journal of Computer Science and Technology |
| Volume | 39 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 2024 |
Keywords
- E-commerce
- graph clustering
- heterogeneous information network (HIN)
- scene mining
Fingerprint
Dive into the research topics of 'SMEC: Scene Mining for E-Commerce'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver