IP Library Granted Patent US 12,561,575
Granted Patent B2
US 12,561,575 · App. 15/858,936 · Granted Feb 24, 2026

System and method for generating training sets for neural networks

Inventors: Nir Regev (Beit Guvrin, IL); Guy Levy Yurista (Rockville, MD); Adi Azaria (Tel Aviv, IL); Amir Orad (Scarsdale, NY)
Assignee: Sisense Ltd.
G06N3/044G06F16/24549G06F16/2455G06F16/2462G06F16/248G06F16/903G06F16/90335G06N3/0442G06N3/08G05B2219/33025
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,561,575
App. No.
15/858,936
Granted
Feb 24, 2026
Kind
B2
Abstract

A system and method for generating training sets for training neural networks. The method includes receiving a plurality of query pairs, wherein each of the plurality of query pairs includes a query and a real result previously determined for the query; determining at least one variable element of each query in the plurality of received query pairs; determining a variance for the at least determined variable element of each query in the plurality of received query pairs; and generating a training set based on the determined variable element, the determined variance, and the previously determined real result.

Claims (66)

1 . A method for developing a trained computer neural network capable of providing responses to queries to a table-based database, comprising:

receiving a plurality of query pairs, wherein each of the plurality of query pairs includes a query for the table-based database and a real result previously determined for the query that is a response to the query;

determining, for each query in the received plurality of query pairs, a variable and a first subset of potential values for the variable;

determining at least one second subset of potential values for the variable of each query in the plurality of received query pairs, wherein each of the at least one second subset of potential values for the variable is different from the first subset of potential values for the variable; and

generating a training set based on the determined variable for each query, the at least one first subset of potential values for each variable, the at least one second subset of potential values for each variable, and the previously determined real result for each query, wherein generating the training set includes generating at least one training query, wherein each training query is generated for the variable of one of the queries in the received plurality of query pairs based on the at least one second subset of potential values determined for the variable; and

causing a recurrent neural network to become a trained recurrent neural network through training of the recurrent neural network using the generated training set.

2 . The method of claim 1 , further comprising:

determining at least one predicate for each of the plurality of query pairs, wherein a predicate is an expression used to determine if the query will return any one of: a true result and a false result.

3 . The method of claim 1 , wherein the previously determined real result is determined by querying at least one data set using the respective query.

4 . The method of claim 3 , further comprising:

determining if the generated training set is representative of the at least one data set.

5 . The method of claim 4 , wherein determining if the generated training set is representative of the data set further comprises at least one of: determining if the query pairs are directed to all portions of the data set and determining if the query pairs are directed to a number of portions of the data set above a predetermined threshold.

6 . The method of claim 1 , wherein a variance of the query is configured to accommodate for potential bias within a determined real result.

7 . The method of claim 1 , wherein the causing further comprises:

providing the generated training set to the neural network which is one of a plurality of neural networks.

8 . The method of claim 7 , wherein the provided training set is vectorized to a matrix representation configured to be fed to input neurons of the neural network.

9 . The method of claim 1 , further comprising:

continuously generating a plurality of test queries; and

ceasing to generate test queries when the plurality of generated test queries is equal to a representative sample size of the data set.

10 . The method of claim 1 , wherein a first subset of query pairs corresponds to a first column of the data set.

11 . The method of claim 10 , wherein a second subset of query pairs corresponds to the first column and a second column of the data set, and a first plurality of test queries is generated based on the first subset of query pairs, and a second plurality of test queries is generated based on the second subset.

12 . The method of claim 11 , wherein the second plurality of test queries is generated first, and the first plurality of test queries is generated in response to the size of the second plurality of test queries being less than the sample size for a variance of the first column.

13 . A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to perform a process, the process being to develop a trained computer neural network capable of providing responses to queries to a table-based database and comprising:

receiving a plurality of query pairs, wherein each of the plurality of query pairs includes a query for the table-based database and a real result previously determined for the query that is a response to the query;

determining, for each query in the received plurality of query pairs, a variable and a first subset of potential values for the variable;

determining at least one second subset of potential values for the variable of each query in the plurality of received query pairs, wherein each of the at least one second subset of potential values for the variable is different from the first subset of potential values for the variable; and

generating a training set based on the determined variable for each query, the at least one first subset of potential values for each variable, the at least one second subset of potential values for each variable, and the previously determined real result for each query, wherein generating the training set includes generating at least one training query, wherein each training query is generated for the variable of one of the queries in the received plurality of query pairs based on the at least one second subset of potential values determined for the variable; and

causing a recurrent neural network to become a trained recurrent neural network through training of the recurrent neural network using the generated training set.

14 . A system for developing a trained computer neural network capable of providing responses to queries to a table-based database, comprising:

a processing circuitry; and

a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:

receive a plurality of query pairs, wherein each of the plurality of query pairs includes a query for the table-based database and a real result previously determined for the query that is a response to the query;

determine, for each query in the received plurality of query pairs, a variable and a first subset of potential values for the variable;

determine at least one second subset of potential values for the variable of each query in the plurality of received query pairs, wherein each of the at least one second subset of potential values for the variable is different from the first subset of potential values for the variable; and

generate a training set based on the determined variable for each query, the at least one first subset of potential values for each variable, the at least one second subset of potential values for each variable, and the previously determined real result for each query, wherein generating the training set includes generating at least one training query, wherein each training query is generated for the variable of one of the queries in the received plurality of query pairs based on the at least one second subset of potential values determined for the variable; and

cause a recurrent neural network to become a trained recurrent neural network through training of the recurrent neural network using the generated training set.

15 . The system of claim 14 , wherein the system is further configured to:

determine at least one predicate for each of the plurality of query pairs, wherein a predicate is an expression used to determine if the query will return any one of: a true result and a false result.

16 . The system of claim 14 , wherein the previously determined real result is determined by querying at least one data set using the respective query.

17 . The system of claim 16 , wherein the system is further configured to:

determine if the generated training set is representative of the at least one data set.

18 . The system of claim 17 , wherein determining if the generated training set is representative of the data set further comprises at least one of: determining if the query pairs are directed to all portions of the data set and determining if the query pairs are directed to a number of portions of the data set above a predetermined threshold.

19 . The system of claim 14 , wherein a variance of the query is configured to accommodate for potential bias within a determined real result.

20 . The system of claim 14 , wherein the system is further configured when performing the causing to:

provide the generated training set to the neural network which is one of a plurality of neural networks.

21 . The system of claim 20 , wherein the provided training set is vectorized to a matrix representation configured to be fed to input neurons of the neural network.

22 . The system of claim 14 , wherein the system is further configured to:

continuously generate a plurality of test queries; and

cease to generate test queries when the plurality of generated test queries is equal to a representative sample size of the data set.

23 . The system of claim 14 , wherein a first subset of query pairs corresponds to a first column of the data set.

24 . The system of claim 23 , wherein a second subset of query pairs corresponds to the first column and a second column of the data set, and a first plurality of test queries is generated based on the first subset of query pairs, and a second plurality of test queries is generated based on the second subset.

25 . The system of claim 24 , wherein the second plurality of test queries is generated first, and the first plurality of test queries is generated in response to the size of the second plurality of test queries being less than the sample size for a variance of the first column.

26 . The method of claim 1 , further comprising:

receiving, by the trained neural network, a query for execution on a data set; and

generating, by the trained neural network, a predicted result for the received query.

27 . The method of claim 1 , further comprising:

determining a confidence level of the predicted result based on a loss function of the trained neural network;

executing the query on the data set in response to determining that the confidence level is below a first predetermined threshold; and

executing the query on another neural network in response to determining that the confidence level is below a second predetermined threshold and above the first predetermined threshold.

28 . The system of claim 14 , wherein the memory contains further instructions which when executed by the processing circuitry further configures the system to:

receive a query for execution on a data set; and

generate a predicted result for the received query by providing the received query to the trained neural network.

29 . The system of claim 28 , wherein the memory contains further instructions which when executed by the processing circuitry further configures the system to:

determine a confidence level of the predicted result based on a loss function of the trained neural network;

execute the query on the data set in response to determining that the confidence level is below a first predetermined threshold; and

execute the query on another neural network in response to determining that the confidence level is below a second predetermined threshold and above the first predetermined threshold.

Assignments (9)
RELEASE OF SECURITY INTEREST Recorded Jun 16, 2023
From: TRIPLEPOINT VENTURE GROWTH BDC CORP
To: SISENSE SF, INC.; SISENSE LTD.
Reel/Frame 063980/0047 →
SECURITY INTEREST Recorded Jun 14, 2023
From: SISENSE LTD; SISENSE SF INC.
To: HERCULES CAPITAL, INC.
Reel/Frame 063948/0662 →
RELEASE OF SECURITY INTEREST Recorded Jun 9, 2023
From: COMERICA BANK
To: SISENSE LTD.
Reel/Frame 063915/0257 →
RELEASE OF SECURITY INTEREST Recorded Sep 24, 2021
From: SILICON VALLEY BANK
To: SISENSE LTD
Reel/Frame 057594/0867 →
SECURITY INTEREST Recorded Sep 24, 2021
From: SISENSE LTD.
To: COMERICA BANK
Reel/Frame 057588/0698 →
RELEASE OF SECURITY INTEREST Recorded Sep 24, 2021
From: SILICON VALLEY BANK, AS AGENT
To: SISENSE LTD
Reel/Frame 057594/0926 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Mar 30, 2020
From: SISENSE LTD
To: SILICON VALLEY BANK, AS AGENT
Reel/Frame 052267/0325 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Mar 30, 2020
From: SISENSE LTD
To: SILICON VALLEY BANK
Reel/Frame 052267/0313 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 11, 2018
From: REGEV, NIR; LEVY YURISTA, GUY; AZARIA, ADI; ORAD, AMIR
To: SISENSE LTD.
Reel/Frame 044600/0375 →
Continuity (5)
Provisional Application 62545046 · Aug 14, 2017
Provisional Application 62545050 · Aug 14, 2017
Provisional Application 62545058 · Aug 14, 2017
Provisional Application 62545053 · Aug 14, 2017
Related Publication 20190050724A1 · Feb 14, 2019
References Cited (120)
US 5111531A · Grayson et al. · 1992 [cited by applicant]
US 5515477A · Sutherland · 1996 [cited by applicant]
US 6108648A · Lakshmi et al. · 2000 [cited by applicant]
US 7181438B1 · Szabo · 2007 [cited by applicant]
US 7831531B1 · Baluja et al. · 2010 [cited by applicant]
US 9336483B1 · Abeysooriya et al. · 2016 [cited by applicant]
US 9514389B1 · Erhan et al. · 2016 [cited by applicant]
US 10281885B1 · Chiu · 2019 [cited by examiner]
US 10311372B1 · Hotchkies et al. · 2019 [cited by applicant]
US 10394803B2 · Bordawekar · 2019 [cited by examiner]
US 10489393B1 · Mittal · 2019 [cited by examiner]
US 10635680B2 · Jiang · 2020 [cited by examiner]
US 10706354B2 · Corvinelli · 2020 [cited by examiner]
US 10713594B2 · Szeto et al. · 2020 [cited by applicant]
US 10878334B2 · Lindner · 2020 [cited by examiner]
US 10929751B2 · Ehrman · 2021 [cited by examiner]
US 10977581B2 · Maor · 2021 [cited by examiner]
US 11115463B2 · Cudworth et al. · 2021 [cited by applicant]
US 20040093315A1 · Carney · 2004 [cited by applicant]
US 20060230006A1 · Buscema · 2006 [cited by applicant]
US 20070168329A1 · Haft et al. · 2007 [cited by applicant]
US 20130117257A1 · Meijer et al. · 2013 [cited by applicant]
US 20140156633A1 · Duan et al. · 2014 [cited by applicant]
US 20140344203A1 · Ahn · 2014 [cited by applicant]
US 20150100955A1 · Chen et al. · 2015 [cited by applicant]
US 20150278709A1 · Zeng et al. · 2015 [cited by applicant]
US 20160162781A1 · Lillicrap et al. · 2016 [cited by applicant]
US 20170109355A1 · Li · 2017 [cited by examiner]
US 20170132511A1 · Gong et al. · 2017 [cited by applicant]
US 20170220925A1 · Alsharif et al. · 2017 [cited by applicant]
US 20170323200A1 · Corvinelli et al. · 2017 [cited by applicant]
US 20170330054A1 · Fu · 2017 [cited by examiner]
US 20170357896A1 · Tsatsin · 2017 [cited by examiner]
US 20180032902A1 · Krishnan · 2018 [cited by examiner]
US 20180082183A1 · Hertz · 2018 [cited by examiner]
US 20180114108A1 · Lao · 2018 [cited by examiner]
US 20180137433A1 · Devarakonda · 2018 [cited by examiner]
US 20180157758A1 · Arrizabalaga et al. · 2018 [cited by applicant]
US 20180260450A1 · Wang et al. · 2018 [cited by applicant]
US 20180260695A1 · Majumdar et al. · 2018 [cited by applicant]
US 20180268015A1 · Sugaberry · 2018 [cited by applicant]
US 20180307894A1 · Lim et al. · 2018 [cited by applicant]
US 20180329951A1 · Yu · 2018 [cited by examiner]
US 20180329999A1 · Kale · 2018 [cited by examiner]
US 20180341862A1 · Ehrman · 2018 [cited by examiner]
US 20180349477A1 · Jaech · 2018 [cited by examiner]
US 20180357240A1 · Miller · 2018 [cited by examiner]
US 20180357565A1 · Syed · 2018 [cited by examiner]
US 20180365220A1 · Chakraborty · 2018 [cited by examiner]
US 20180373782A1 · Liu · 2018 [cited by examiner]
US 20190050724A1 · Regev · 2019 [cited by examiner]
US 20190050725A1 · Yurista et al. · 2019 [cited by applicant]
US 20190050726A1 · Azaria et al. · 2019 [cited by applicant]
US 20190180195A1 · Terry · 2019 [cited by examiner]
US 20190340236A1 · Le · 2019 [cited by examiner]
US 20190371299A1 · Jiang · 2019 [cited by examiner]
US 20200034722A1 · Oh · 2020 [cited by examiner]
US 20200125950A1 · Regev · 2020 [cited by examiner]
US 20200142888A1 · Alakuijala · 2020 [cited by examiner]
US 20210279237A1 · Idreos · 2021 [cited by examiner]
CN 106547828A · 2017 [cited by applicant]
WO 2017176356A2 · 2017 [cited by applicant]
WO WO2018200979A1 · 2018 [cited by examiner]
Anagnostopoulos et Triantafillou, “Efficient Scalable Accurate Regression Queries in In-DBMS Analytics” Apr. 19-22, 2017, IEEE pp. 559-570. (Year: 2017). [cited by examiner]
Melucci, Massimo, “Impact of Query Sample Selection Bias on Information Retrieval System Ranking” Oct. 17-19, 2016, IEEE pp. 341-350. (Year: 2016). [cited by examiner]
Yang et al., “A Variance Maximization Criterion for Active Learning” Jun. 23, 2017. (Year: 2017). [cited by examiner]
Yuan et al., “Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy” Jun. 2015, pp. 1-47. (Year: 2015). [cited by examiner]
Wang et al., “IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models” May 30, 2017. (Year: 2017). [cited by examiner]
Brownlee, Jason, “A Gentle Introduction to Statistical Data Distributions” Jun. 8, 2018, pp. 1-20. (Year: 2018). [cited by examiner]
Zuccon et al., “Query Variations and their Effect on Comparing Information Retrieval Systems” Oct. 2016, pp. 691-700. (Year: 2016). [cited by examiner]
Yang et al., “Semi-Supervised QA with Generative Domain-Adaptive Nets” Apr. 22, 2017. (Year: 2017). [cited by examiner]
Alakuijala et al., “Generating Query Variants Using a Trained Generative Model” Apr. 29, 2017, U.S. Appl. No. 62/492,154. (Year: 2017). [cited by examiner]
Cohen et al., “A Minimal Variance Estimator for the Cardinality of Big Data Set Intersection” Jun. 3, 2016, arXiv:1606.00996v1. (Year: 2016). [cited by examiner]
Cohen et al., “A Minimal Variance Estimator for the Cardinality of Big Data Set Intersection” Aug. 2017, pp. 95-103. (Year: 2017). [cited by examiner]
Wang et al., “Synthesizing Highly Expressive SQL Queries from Input-Output Examples” Jun. 2017, pp. 452-466. (Year: 2017). [cited by examiner]
Xu et Song, “SQLNet: Generating Structured Queries from Natural Language without Reinforcement Learning” Nov. 13, 2017, arXiv:1711.0443v1, pp. 1-13. (Year: 2017). [cited by examiner]
Chang et al., “Active Bias: Training More Accurate Neural Networks by Emphasizing High Variance Samples” May 22, 2017, arXiv:1704.07433v2, pp. 1-15. (Year: 2017). [cited by examiner]
Ivanov et Bartunov, “Adaptive Cardinality Estimation” Nov. 22, 2017, arXiv: 1711.08330v1, pp. 1-12. (Year: 2017). [cited by examiner]
Xiong et al., “End-to-End Neural Ad-Hoc Ranking with Kernel Pooling” Jun. 20, 2017, arXiv:1706.06613v1. (Year: 2017). [cited by examiner]
Loschilov et Hutter, “Online Batch Selection for Faster Training of Neural Networks” Apr. 25, 2016, arXiv:1511.06343v4, pp. 1-20. (Year: 2016). [cited by examiner]
Katharopoulos et Fleuret, “Biased Importance Sampling for Deep Neural Network Training” Sep. 13, 2017, arXiv:1706.00043v1, pp. 1-12. (Year: 2017). [cited by examiner]
Hendrycks et Gimpel, “Adjusting for Dropout Variance in Batch Normalization and Weight Initialization” Mar. 23, 2017, arXiv:1607.02488v2, pp. 1-10. (Year: 2017). [cited by examiner]
Zhang et al., “An Overreaction to the Broken Machine Learning Abstraction: The ease.ml Vision” May 14, 2017, pp. 1-6. (Year: 2017). [cited by examiner]
Li et al., “MLog: Towards Declarative In-Database Machine Learning” Aug. 1, 2017, pp. 1933-1936. (Year: 2017). [cited by examiner]
Wasay et al., “Data Canopy: Accelerating Exploratory Statistical Analysis” May 2017, pp. 557-572. (Year: 2017). [cited by examiner]
Park et al., “Database Learning: Towards a Database that Becomes Smarter Every Time” May 2017, pp. 587-602. (Year: 2017). [cited by examiner]
Galaktos et al., “Revisiting Reuse for Approximate Query Processing” Jun. 1, 2017, pp. 1142-1153. (Year: 2017). [cited by examiner]
Goodfellow et al., “Deep Learning” 2016, pp. i-763. (Year: 2016). [cited by examiner]
Wikipedia online article “Improvement” downloaded Apr. 11, 2022 from https://en.wikipedia.org/wiki/Improvement (Year: 2022). [cited by examiner]
Yin et al., “Neural Enquirer: Learning to Query Tables with Natural Language” Jan. 21, 2016, arXiv: 1512.00965v2, pp. 1-19. (Year: 2016). [cited by examiner]
Yin et al., “Neural Generative Question Answering” Apr. 22, 2016, arXiv: 1512.01337v4, pp. 1-12. (Year: 2016). [cited by examiner]
Cohen et al., “TensorLog: Deep Learning Meets Probabilistic Databases” Jul. 17, 2017, arXiv: 1707.05390v1, pp. 1-28. (Year: 2017). [cited by examiner]
Kang et al., “NoScope: Optimizing Neural Network Queries over Video at Scale” Aug. 8, 2017, arXiv: 1703.02529v3, pp. 1-12. (Year: 2017). [cited by examiner]
Das et al., “Question Answering on Knowledge Bases and Text using Universal Schema and Memory Networks” Apr. 27, 2017, arXiv : 1704.08384v1. (Year: 2017). [cited by examiner]
Andreas et al., “Learning to Compose Neural Networks for Question Answering” Jun. 7, 2016, arXiv: 1601.01705v4 pp. 1-10. (Year: 2016). [cited by examiner]
Zhang et al., “EntiTables: Smart Assistance for Entity-Focused Tables” Aug. 7, 2017, pp. 255-264. (Year: 2017). [cited by examiner]
Vakulenko et al., “TableQA: Question Answering on Tabular Data” May 18, 2017, arXiv: 1705.06504v1. (Year: 2017). [cited by examiner]
Oh et al., “Multi-Column Convolutional Neural Networks with Causality-Attention for Why-Question Answering” Feb. 2017, pp. 415-424. (Year: 2017). [cited by examiner]
Zhou et al., “Recurrent Convolutional neural network for answer selection in community question answering” Apr. 11, 2017, pp. 8-18. (Year: 2017). [cited by examiner]
Dos Santos et al., “Attentive Pooling Networks” Feb. 11, 2016, arXiv: 1602.03609v1, pp. 1-10. (Year: 2016). [cited by examiner]
Zhang et al., “Attentive Interactive Neural Networks for Answer Selection in Community Question Answering” Feb. 12, 2017, pp. 3525-3531. (Year: 2017). [cited by examiner]
Dong et al., “Question Answering over Freebase with Multi-Column Convolutional Neural Networks” Jul. 2015, pp. 260-269. (Year: 2015). [cited by examiner]
Chen et al., “Enhancing Recurrent Neural Networks with Positional Attention for Question Answering” Aug. 7, 2017, pp. 993-996. (Year: 2017). [cited by examiner]
Xu et Li, “Full-Time Supervision based Bidirectional RNN for Factoid Question Answering” Jun. 21, 2016, arXiv: 1606.05854v2, pp. 1-9. (Year: 2016). [cited by examiner]
Tay et al., “Learning to Rank Question Answer Pairs with Holographic Dual LSTM Architecture” Jul. 20, 2017, arXiv: 1707.06372v1, pp. 1-10. (Year: 2017). [cited by examiner]
Gehring et al., “Convolutional Sequence to Sequence Learning” Jul. 25, 2017, arXiv: 1705.03122v3, pp. 1-15. (Year: 2017). [cited by examiner]
Liu et al., “Bidirectional-Convolutional LSTM based Spectral-Spatial Feature Learning for Hyperspectral Image Classification” Mar. 23, 2017, arXiv: 1703.07910v1, pp. 1-18. (Year: 2017). [cited by examiner]
Wang et Hu, “Gated Recurrent Convolution Neural Network for OCR” 2017, pp. 1-10. (Year: 2017). [cited by examiner]
Meng et al., “M2S-Net: Multi-Modal Similarity Metric Learning based Deep Convolutional Network for Answer Selection” Apr. 24, 2016, arXiv: 1604.05519v2, pp. 1-6. (Year: 2016). [cited by examiner]
Seo et al., “Query-Reduction Networks for Question-Answering” Feb. 24, 2017, arXiv: 1606.04582v6, pp. 1-13. (Year: 2017). [cited by examiner]
Tan et al., “LSTM-based Deep Learning Models for Non-Factoid Answer Selection” Mar. 28, 2016, arXiv: 1511.04108v4, pp. 1-11. (Year: 2016). [cited by examiner]
The European Search Report for European Patent Application No. 17921683.3, Aug. 17, 2020, EPO, Munich, Germany. [cited by applicant]
The International Search Report and The Written Opinion for PCT/US2017/069067, ISA/RU, Moscow, Russia, Date of Mailing: May 17, 2018. [cited by applicant]
The International Search Report and The Written Opinion of the International Searching Authority for PCT/US2017/069071, Date of Mailing: Apr. 26, 2018, ISA/RU, Moscow, Russia. [cited by applicant]
The International Search Report and the Written Opinion for PCT/US2017/069069, ISA/RU, Moscow, Russia, Dated Jun. 7, 2018. [cited by applicant]
Doulamis, et al., “On-Line Retrainable Neural Networks: Improving the Performance of Neural Networks in Image AnalysisProblems”, IEEE Transactions on Neural Networks, vol. 11, No. 1, Jan. 2000 (Year: 2000). [cited by applicant]
First Foreign Office Action for European Application No. 17921683.3, dated: Jun. 17, 2021, European Patent Office. [cited by applicant]
Wang et al., “Relevance Feedback Technique for Content-Based Image Retrieval Using Neural Network Learning” Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalian, Aug. 13-16, 2006. [cited by applicant]
Yegulalp, Serdar, “Machine learning comes to your browser via JavaScript”, InfoWorld, Aug. 2, 2017. [cited by applicant]
Hinton, G. et al. Distilling the Knowledge in a Neural Network. arXiv. Mar. 9, 2015. (Year: 2015). [cited by applicant]