Inductive-transductive learning for very sparse fashion graphs

The assortments of global retailers are composed of hundreds of thousands of products linked by several types of relationships such as style compatibility, "bought together", "watched together", etc. Graphs are a natural representation for assortments, where products are nodes and relations are edges. Style com-patibility relations are produced manually and do not cover the whole graph uniformly. We propose to use inductive learning to enhance a graph encoding style compatibility of a fashion assortment, leverag-ing rich node information comprising textual descriptions and visual data. Then, we show how the pro-posed graph enhancement substantially improves the performance on transductive tasks with a minor impact on graph sparsity. Although demonstrated in a challenging and novel industrial application case, the approach we propose is general enough to be applied to any node-level or edge-level prediction task in very sparse, large-scale networks.(c) 2022 Published by Elsevier B.V.