IP Library Granted Patent US 12,488,362
Granted Patent B2
US 12,488,362 · App. 17/675,817 · Granted Dec 2, 2025

Hierarchical neural network based implementation for predicting out of stock products

Inventors: Akash Singh (Gurgaon, IN); Rajdeep Dua (Hyderabad, IN)
G06Q30/0202G06N3/044G06N3/045G06Q10/087
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,488,362
App. No.
17/675,817
Granted
Dec 2, 2025
Kind
B2
Abstract

A hierarchical neural network for predicting out of stock products comprises an input layer that receives data from data sources that store disparate datasets having different levels of attribute detail pertaining to products for sale in stores of a retailer. A first level of neural networks processes the data from the data sources into respective learned intermediate vector representations. A second level comprises a concatenate layer that concatenates the learned intermediate vector representations from the second level into a combined vector representation. A third level comprises a feed forward network that receives the combined vector representation and outputs to the retailer an out of stock probability indicating which store and product combinations are likely to have out of stock products over a predetermined timeframe.

Claims (38)

1 . A system for predicting out of stock (OOS) products, the system, comprising:

one or more processors executing a hierarchical neural network (HNN), the HNN comprising:

one or more data sources that store disparate datasets having different levels of attribute detail pertaining to products for sale in one or more stores of a retailer, the disparate datasets comprising:

low-level store data including daily store visits and past occurrences of out of stock products, categorical data including store identifiers and associated city identifiers, store-level product data, and time-series product sales data including monthly or weekly sales per product;

a first level that processes the low-level store data, the categorical data, the store-level product data, and the time-series product sales data from the one or more data sources into respective learned intermediate vector representations, the first level comprising:

a convolutional neural network (CNN) layer that processes the low-level store data;

an embedding layer that processes the categorical data;

a long short-term memory (LSTM) layer that processes the time-series product sales data;

a second level comprising a concatenate layer that concatenates the learned intermediate vector representations from the second level into a combined vector representation; and

a third level comprising a feed forward network that receives the combined vector representation and outputs to the retailer an OOS probability indicating which store and product combinations are likely to have OOS products over a predetermined timeframe.

2 . The HNN of claim 1 , wherein the first level first translates the low-level store data, the categorical data, the store-level product data, and the time-series product sales data into initial vector representations.

3 . The HNN of claim 2 , wherein a set of initial vector representations representing the store-level product data are not processed by the first level but passed on to the second level.

4 . The HNN of claim 3 , wherein the concatenate layer concatenates the set of initial vector representations of the store-level product data with the respective learned intermediate vector representations.

5 . The HNN of claim 1 , wherein the CNN layer is based on a shared-weight architecture of convolution kernels that slide along the visit data and the visit data is convolved with one of the convolutions kernels to provide feature maps, where ones of the feature maps learn different features.

6 . The HNN of claim 5 , wherein the CNN layer includes a first attention layer such that the CNN layer processes low-level granular and sequential features and the first attention layer examines data from a predefined time period relevant to generating the OOS probability.

7 . The HNN of claim 1 , wherein the embedding layer processes the store identifiers and the city identifiers to capture information including interaction of the stores and cities with other variables.

8 . The HNN of claim 1 , wherein the LSTM layer includes stacked LSTM layers to learn historical patterns that are represented by LSTM state vectors, wherein the LSTM state vectors are fed into a second attention layer to enable the LSTM layer to examine data from a predefined time period relevant to generating the OOS probability.

9 . The HNN of claim 1 , wherein the one or more data sources are stored in: i) a data center of a service provider, ii) by a cloud service provider, iii) local to server comprising the one or more processors, or iv) by a computer system of the retailer or a consumer goods company.

10 . A method for implementing a hierarchical neural network (HNN) for predicting out of stock (OOS) products, the HNN executed by a computer server, the method comprising:

receiving one or more data sources that store disparate datasets having different levels of attribute detail pertaining to products for sale in one or more stores of a retailer, the disparate datasets comprising: low-level store data including daily store visits and past occurrences of out of stock products, categorical data including store identifiers and associated cities, store-level product data, and time-series product sales data including monthly or weekly sales per product;

processing, by a first level, the low-level store data, the categorical data, the store-level product data, and the time-series product sales data from the one or more data sources into respective learned intermediate vector representations, the first level comprising:

a convolutional neural network (CNN) to process the low-level store data, an embedding layer to process the categorical data; and a long short-term memory (LSTM) layer to process the time-series product sales data;

concatenating, by a second level comprising a concatenate layer, the respective learned intermediate vector representations into a combined vector representation; and

receiving, by a third level comprising a feed forward network, the combined feature vector representation and outputting to the retailer an OOS probability indicating which store and product combinations are likely to have OOS products over a predetermined timeframe.

11 . The method of claim 10 , further comprising translating the low-level store data, the categorical data, the store-level product data, and the time-series product sales data into initial vector representations.

12 . The method of claim 10 , further comprising generating a set of initial vector representations representing the store-level product data, and passing the set of initial vector representations on to the second level instead of the first level.

13 . The method of claim 12 , further comprising concatenating, by the concatenate layer, the set of initial vector representations of the store-level product data with the respective learned intermediate vector representations.

14 . The method of claim 10 , further comprising basing a CNN layer on a shared-weight architecture of convolution kernels that slide along the visit data and the visit data is convolved with one of the convolutions kernels to provide feature maps, where ones of the feature maps learn different features.

15 . The method of claim 14 , further comprising providing the CNN layer with a first attention layer such that the CNN layer processes low-level granular and sequential features and the first attention layer examines data from a predefined time period relevant to generating the OOS probability.

16 . The method of claim 10 , further comprising processing, by the embedding layer, the store identifiers and the city identifiers to capture information including interaction of the stores and cities with other variables.

17 . The method of claim 10 , further comprising providing the LSTM layer with stacked LSTM layers to learn historical patterns that are represented by LSTM state vectors, and feeding the LSTM state vectors into a second attention layer to enable the LSTM layer to examine data from a predefined time period relevant to generating the OOS probability.

18 . The method of claim 10 , further comprising storing the one or more data sources in: i) a data center of a service provider, ii) by a cloud service provider, iii) local to server comprising the one or more processors, or iv) by a computer system of the retailer or a consumer goods company.

19 . A non-transitory machine-readable storage medium that provides instructions that, if executed by a processor are configurable to cause said processor to perform operations comprising:

receiving data from one or more data sources that store disparate datasets having different levels of attribute detail pertaining to products for sale in one or more stores of a retailer, the disparate datasets comprising: low-level store data including daily store visits and past occurrences of out of stock (QOS) products, categorical data including store identifiers and associated cities, store-level product data, and time-series product sales data including monthly or weekly sales per product;

processing, by a first level, the low-level store data, the categorical data, the store-level product data, and the time-series product sale data from the one or more data sources into respective learned intermediate vector representations, the first level comprising: a

convolutional neural network to process the low-level store data, an embedding layer to process the categorical data; and a long short-term memory (LSTM) layer to process the time-series product sales data;

concatenating, by a second level comprising a concatenate layer, the respective learned intermediate vector representations into a combined vector representation; and

receiving, by a third level comprising a feed forward network, the combined feature vector representation and outputting to the retailer an OOS probability indicating which store and product combinations are likely to have OOS products over a predetermined timeframe.

Assignments (2)
CHANGE OF NAME Recorded Nov 22, 2023
From: SALESFORCE.COM, INC.
To: SALESFORCE, INC.
Reel/Frame 065661/0205 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 18, 2022
From: SINGH, AKASH; DUA, RAJDEEP
To: SALESFORCE.COM, INC.
Reel/Frame 059051/0814 →
Continuity (1)
Related Publication 20230267481A1 · Aug 24, 2023
References Cited (189)
US 5577188A · Zhu · 1996 [cited by applicant]
US 5608872A · Schwartz et al. · 1997 [cited by applicant]
US 5649104A · Carleton et al. · 1997 [cited by applicant]
US 5715450A · Ambrose et al. · 1998 [cited by applicant]
US 5761419A · Schwartz et al. · 1998 [cited by applicant]
US 5819038A · Carleton et al. · 1998 [cited by applicant]
US 5821937A · Tonelli et al. · 1998 [cited by applicant]
US 5831610A · Tonelli et al. · 1998 [cited by applicant]
US 5873096A · Lim et al. · 1999 [cited by applicant]
US 5918159A · Fomukong et al. · 1999 [cited by applicant]
US 5963953A · Cram et al. · 1999 [cited by applicant]
US 5983227A · Nazem et al. · 1999 [cited by applicant]
US 6092083A · Brodersen et al. · 2000 [cited by applicant]
US 6161149A · Achacoso et al. · 2000 [cited by applicant]
US 6169534B1 · Raffel et al. · 2001 [cited by applicant]
US 6178425B1 · Brodersen et al. · 2001 [cited by applicant]
US 6189011B1 · Lim et al. · 2001 [cited by applicant]
US 6216133B1 · Masthoff · 2001 [cited by applicant]
US 6216135B1 · Brodersen et al. · 2001 [cited by applicant]
US 6233617B1 · Rothwein et al. · 2001 [cited by applicant]
US 6236978B1 · Tuzhilin · 2001 [cited by applicant]
US 6266669B1 · Brodersen et al. · 2001 [cited by applicant]
US 6288717B1 · Dunkle · 2001 [cited by applicant]
US 6295530B1 · Ritchie et al. · 2001 [cited by applicant]
US 6324568B1 · Diec et al. · 2001 [cited by applicant]
US 6324693B1 · Brodersen et al. · 2001 [cited by applicant]
US 6336137B1 · Lee et al. · 2002 [cited by applicant]
US D454139S · Feldcamp et al. · 2002 [cited by applicant]
US 6367077B1 · Brodersen et al. · 2002 [cited by applicant]
US 6393605B1 · Loomans · 2002 [cited by applicant]
US 6405220B1 · Brodersen et al. · 2002 [cited by applicant]
US 6411949B1 · Schaffer · 2002 [cited by applicant]
US 6434550B1 · Warner et al. · 2002 [cited by applicant]
US 6446089B1 · Brodersen et al. · 2002 [cited by applicant]
US 6535909B1 · Rust · 2003 [cited by applicant]
US 6549908B1 · Loomans · 2003 [cited by applicant]
US 6553563B2 · Ambrose et al. · 2003 [cited by applicant]
US 6560461B1 · Fomukong et al. · 2003 [cited by applicant]
US 6574635B2 · Stauber et al. · 2003 [cited by applicant]
US 6577726B1 · Huang et al. · 2003 [cited by applicant]
US 6601087B1 · Zhu et al. · 2003 [cited by applicant]
US 6604117B2 · Lim et al. · 2003 [cited by applicant]
US 6604128B2 · Diec et al. · 2003 [cited by applicant]
US 6609150B2 · Lee et al. · 2003 [cited by applicant]
US 6621834B1 · Scherpbier et al. · 2003 [cited by applicant]
US 6654032B1 · Zhu et al. · 2003 [cited by applicant]
US 6665648B2 · Brodersen et al. · 2003 [cited by applicant]
US 6665655B1 · Warner et al. · 2003 [cited by applicant]
US 6684438B2 · Brodersen et al. · 2004 [cited by applicant]
US 6711565B1 · Subramaniam et al. · 2004 [cited by applicant]
US 6724399B1 · Katchour et al. · 2004 [cited by applicant]
US 6728702B1 · Subramaniam et al. · 2004 [cited by applicant]
US 6728960B1 · Loomans et al. · 2004 [cited by applicant]
US 6732095B1 · Warshavsky et al. · 2004 [cited by applicant]
US 6732100B1 · Brodersen et al. · 2004 [cited by applicant]
US 6732111B2 · Brodersen et al. · 2004 [cited by applicant]
US 6754681B2 · Brodersen et al. · 2004 [cited by applicant]
US 6763351B1 · Subramaniam et al. · 2004 [cited by applicant]
US 6763501B1 · Zhu et al. · 2004 [cited by applicant]
US 6768904B2 · Kim · 2004 [cited by applicant]
US 6772229B1 · Achacoso et al. · 2004 [cited by applicant]
US 6782383B2 · Subramaniam et al. · 2004 [cited by applicant]
US 6804330B1 · Jones et al. · 2004 [cited by applicant]
US 6826565B2 · Ritchie et al. · 2004 [cited by applicant]
US 6826582B1 · Chatterjee et al. · 2004 [cited by applicant]
US 6826745B2 · Coker · 2004 [cited by applicant]
US 6829655B1 · Huang et al. · 2004 [cited by applicant]
US 6842748B1 · Warner et al. · 2005 [cited by applicant]
US 6850895B2 · Brodersen et al. · 2005 [cited by applicant]
US 6850949B2 · Warner et al. · 2005 [cited by applicant]
US 6907566B1 · McElfresh et al. · 2005 [cited by applicant]
US 7062502B1 · Kesler · 2006 [cited by applicant]
US 7069231B1 · Cinarkaya · 2006 [cited by applicant]
US 7069497B1 · Desai · 2006 [cited by applicant]
US 7100111B2 · McElfresh et al. · 2006 [cited by applicant]
US 7181758B1 · Chan · 2007 [cited by applicant]
US 7269590B2 · Hull et al. · 2007 [cited by applicant]
US 7289976B2 · Kihneman et al. · 2007 [cited by applicant]
US 7340411B2 · Cook · 2008 [cited by applicant]
US 7356482B2 · Frankland et al. · 2008 [cited by applicant]
US 7373599B2 · McElfresh et al. · 2008 [cited by applicant]
US 7401094B1 · Kesler · 2008 [cited by applicant]
US 7406501B2 · Szeto et al. · 2008 [cited by applicant]
US 7412455B2 · Dillon · 2008 [cited by applicant]
US 7454509B2 · Boulter et al. · 2008 [cited by applicant]
US 7508789B2 · Chan · 2009 [cited by applicant]
US 7599935B2 · La Rotonda et al. · 2009 [cited by applicant]
US 7603331B2 · Tuzhilin et al. · 2009 [cited by applicant]
US 7603483B2 · Psounis et al. · 2009 [cited by applicant]
US 7620655B2 · Larsson et al. · 2009 [cited by applicant]
US 7644122B2 · Weyer et al. · 2010 [cited by applicant]
US 7668861B2 · Steven · 2010 [cited by applicant]
US 7698160B2 · Beaven et al. · 2010 [cited by applicant]
US 7730478B2 · Weissman · 2010 [cited by applicant]
US 7747648B1 · Kraft et al. · 2010 [cited by applicant]
US 7779039B2 · Weissman et al. · 2010 [cited by applicant]
US 7779475B2 · Jakobson et al. · 2010 [cited by applicant]
US 7827208B2 · Bosworth et al. · 2010 [cited by applicant]
US 7853881B1 · Aly Assal et al. · 2010 [cited by applicant]
US 7945653B2 · Zukerberg et al. · 2011 [cited by applicant]
US 8005896B2 · Cheah · 2011 [cited by applicant]
US 8014943B2 · Jakobson · 2011 [cited by applicant]
US 8015495B2 · Achacoso et al. · 2011 [cited by applicant]
US 8032297B2 · Jakobson · 2011 [cited by applicant]
US 8073850B1 · Hubbard et al. · 2011 [cited by applicant]
US 8082301B2 · Ahlgren et al. · 2011 [cited by applicant]
US 8095413B1 · Beaven · 2012 [cited by applicant]
US 8095531B2 · Weissman et al. · 2012 [cited by applicant]
US 8095594B2 · Beaven et al. · 2012 [cited by applicant]
US 8103611B2 · Tuzhilin et al. · 2012 [cited by applicant]
US 8150913B2 · Cheah · 2012 [cited by applicant]
US 8209308B2 · Rueben et al. · 2012 [cited by applicant]
US 8209333B2 · Hubbard et al. · 2012 [cited by applicant]
US 8275836B2 · Beaven et al. · 2012 [cited by applicant]
US 8457545B2 · Chan · 2013 [cited by applicant]
US 8484111B2 · Frankland et al. · 2013 [cited by applicant]
US 8490025B2 · Jakobson et al. · 2013 [cited by applicant]
US 8504945B2 · Jakobson et al. · 2013 [cited by applicant]
US 8510045B2 · Rueben et al. · 2013 [cited by applicant]
US 8510664B2 · Rueben et al. · 2013 [cited by applicant]
US 8566301B2 · Rueben et al. · 2013 [cited by applicant]
US 8646103B2 · Jakobson et al. · 2014 [cited by applicant]
US 11037099B2 · Mustafi et al. · 2021 [cited by applicant]
US 20010044791A1 · Richter et al. · 2001 [cited by applicant]
US 20020072951A1 · Lee et al. · 2002 [cited by applicant]
US 20020082892A1 · Raffel et al. · 2002 [cited by applicant]
US 20020129352A1 · Brodersen et al. · 2002 [cited by applicant]
US 20020140731A1 · Subramaniam et al. · 2002 [cited by applicant]
US 20020143997A1 · Huang et al. · 2002 [cited by applicant]
US 20020162090A1 · Parnell et al. · 2002 [cited by applicant]
US 20020165742A1 · Robbins · 2002 [cited by applicant]
US 20030004971A1 · Gong · 2003 [cited by applicant]
US 20030018705A1 · Chen et al. · 2003 [cited by applicant]
US 20030018830A1 · Chen et al. · 2003 [cited by applicant]
US 20030066031A1 · Laane et al. · 2003 [cited by applicant]
US 20030066032A1 · Ramachandran et al. · 2003 [cited by applicant]
US 20030069936A1 · Warner et al. · 2003 [cited by applicant]
US 20030070000A1 · Coker et al. · 2003 [cited by applicant]
US 20030070004A1 · Mukundan et al. · 2003 [cited by applicant]
US 20030070005A1 · Mukundan et al. · 2003 [cited by applicant]
US 20030074418A1 · Coker et al. · 2003 [cited by applicant]
US 20030120675A1 · Stauber et al. · 2003 [cited by applicant]
US 20030151633A1 · George et al. · 2003 [cited by applicant]
US 20030159136A1 · Huang et al. · 2003 [cited by applicant]
US 20030187921A1 · Diec et al. · 2003 [cited by applicant]
US 20030189600A1 · Gune et al. · 2003 [cited by applicant]
US 20030204427A1 · Gune et al. · 2003 [cited by applicant]
US 20030206192A1 · Chen et al. · 2003 [cited by applicant]
US 20030225730A1 · Warner et al. · 2003 [cited by applicant]
US 20040001092A1 · Rothwein et al. · 2004 [cited by applicant]
US 20040010489A1 · Rio et al. · 2004 [cited by applicant]
US 20040015981A1 · Coker et al. · 2004 [cited by applicant]
US 20040027388A1 · Berg et al. · 2004 [cited by applicant]
US 20040128001A1 · Levin et al. · 2004 [cited by applicant]
US 20040186860A1 · Lee et al. · 2004 [cited by applicant]
US 20040193510A1 · Catahan et al. · 2004 [cited by applicant]
US 20040199489A1 · Barnes-Leon et al. · 2004 [cited by applicant]
US 20040199536A1 · Barnes-Leon et al. · 2004 [cited by applicant]
US 20040199543A1 · Braud et al. · 2004 [cited by applicant]
US 20040249854A1 · Barnes-Leon et al. · 2004 [cited by applicant]
US 20040260534A1 · Pak et al. · 2004 [cited by applicant]
US 20040260659A1 · Chan et al. · 2004 [cited by applicant]
US 20040268299A1 · Lei et al. · 2004 [cited by applicant]
US 20050050555A1 · Exley et al. · 2005 [cited by applicant]
US 20050091098A1 · Brodersen et al. · 2005 [cited by applicant]
US 20080249972A1 · Dillon · 2008 [cited by applicant]
US 20090063415A1 · Chatfield et al. · 2009 [cited by applicant]
US 20090100342A1 · Jakobson · 2009 [cited by applicant]
US 20090177744A1 · Marlow et al. · 2009 [cited by applicant]
US 20110218958A1 · Warshavsky · 2011 [cited by applicant]
US 20110247051A1 · Bulumulla · 2011 [cited by applicant]
US 20120042218A1 · Cinarkaya · 2012 [cited by applicant]
US 20120233137A1 · Jakobson et al. · 2012 [cited by applicant]
US 20120290407A1 · Hubbard et al. · 2012 [cited by applicant]
US 20130212497A1 · Zelenko et al. · 2013 [cited by applicant]
US 20130218948A1 · Jakobson · 2013 [cited by applicant]
US 20130218949A1 · Jakobson · 2013 [cited by applicant]
US 20130218966A1 · Jakobson · 2013 [cited by applicant]
US 20130247216A1 · Cinarkaya · 2013 [cited by applicant]
US 20140359537A1 · Jackobson et al. · 2014 [cited by applicant]
US 20200250715A1 · Mustafi et al. · 2020 [cited by applicant]
US 20210150273A1 · Mustafi et al. · 2021 [cited by applicant]
US 20210150548A1 · Dua et al. · 2021 [cited by applicant]
US 20210192540A1 · Madduri et al. · 2021 [cited by applicant]
US 20210240967A1 · Dua et al. · 2021 [cited by applicant]
US 20210287401A1 · Mustafi et al. · 2021 [cited by applicant]
US 20220180274A1 · Makhija · 2022 [cited by examiner]
US 20220374827A1 · Lee · 2022 [cited by examiner]
Xue, Ning, et al. “Evolving deep CNN-LSTMs for inventory time series prediction.” 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2019. (Year: 2019). [cited by examiner]