OCPHN: Outfit Compatibility Prediction with Hypergraph Networks

Zhuo Li, Jian Li, Tongtong Wang, Xiaolin Gong (), Yinwei Wei and Peng Luo
Additional contact information
Zhuo Li: The School of Microelectronics, Tianjin University, Tianjin 300072, China
Jian Li: The School of Microelectronics, Tianjin University, Tianjin 300072, China
Tongtong Wang: The School of Microelectronics, Tianjin University, Tianjin 300072, China
Xiaolin Gong: The School of Microelectronics, Tianjin University, Tianjin 300072, China
Yinwei Wei: The School of Computing, National University of Singapore, Singapore 37580, Singapore
Peng Luo: The State Grid Hebei Electric Power Research Institute, Shijiazhuang 050021, China

Mathematics, 2022, vol. 10, issue 20, 1-17

Abstract: With the rapid development of the online shopping, the pursuit of outfit compatibility has become a basic requirement for an increasing number of customers. The existing work on outfit compatibility prediction largely focuses on modeling pairwise item compatibility without considering modeling the whole outfit directly. To address the problem, in this paper, we propose a novel hypergraph-based compatibility modeling scheme named OCPHN, which is able to better model complex relationships among outfits. In OCPHN, we represent the outfit as a hypergraph, where each hypernode represents a category and each hyperedge represents the interactions between multiple categories (i.e., they appear in the same outfit). To better predict outfit compatibility, the hypergraph is transformed into a simple graph, and the message propagation mechanism in the graph convolution network is used to aggregate the neighbours’ information on the node and update the node representations. Furthermore, with learned node representations, an attention mechanism is introduced to compute the outfit compatibility score. Using a benchmark dataset, the experimental results show that the proposed method is an improvement over the strangest baselines in terms of accuracy by about 3% and 1% in the fill-in-the-blank and compatibility prediction tasks, respectively.

Keywords: outfit compatibility; hypergraph network; graph convolution network; attention mechanism (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/20/3913/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/20/3913/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:20:p:3913-:d:949669

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().