CPC G06F 16/24578 (2019.01) [G06F 40/20 (2020.01); G06N 3/045 (2023.01); G06N 3/08 (2013.01); G06N 7/01 (2023.01); G06N 20/10 (2019.01)] | 17 Claims |
1. A method for enabling efficient association of a consumable item to one of a plurality of consumable item records in a crowd-sourced database, said method comprising:
receiving at a server apparatus a text input from a user device, said text input provided as an initial search query comprising user-generated descriptive data regarding said consumable item;
using a first machine learning technique to derive one or more additional search queries based on said text input, wherein the first machine learning technique includes (i) deriving at least one hidden query based on the text input, (ii) assigning a weight to each term of the at least one hidden query and iteratively updating the weight assigned to each term, (iii) obtaining search results based on the at least one hidden query, and (iv) iteratively updating the weights based on the obtained search results, wherein iteratively updating the weights includes iteratively deriving a plurality of old and new weight vectors until a distance between the new and old weight vectors is less than a predetermined threshold amount;
querying said crowd-sourced database for a list of possible consumable item records which are determined to comprise descriptive data which matches to said text input using said one or more additional search queries;
receiving said list of possible consumable item records, said list of possible consumable item records having an initial ranking;
applying a second machine learning technique to re-rank said list of possible consumable item records to generate a re-ranked list, wherein said first machine learning technique and said second machine learning technique are characterized by different training sets and different heuristically chosen features; and
outputting a highest ranked one of said re-ranked list to said user device.
|