sentence
stringlengths 1
469
| entities
listlengths 0
36
|
|---|---|
Popular approaches of opinion-based recommender system utilize various techniques including text mining , information retrieval , sentiment analysis ( see also Multimodal sentiment analysis ) and deep learning X.Y. Feng , H. Zhang , Y.J. Ren , P.H. Shang , Y. Zhu , Y.C. Liang , R.C. Guan , D. Xu , ( 2019 ) , , 21 ( 5 ) : e12957 . | [
{
"name": "opinion-based recommender system",
"pos": [
22,
54
],
"type": "product"
},
{
"name": "text mining",
"pos": [
92,
103
],
"type": "field"
},
{
"name": "information retrieval",
"pos": [
106,
127
],
"type": "task"
},
{
"name": "sentiment analysis",
"pos": [
130,
148
],
"type": "task"
},
{
"name": "Multimodal sentiment analysis",
"pos": [
160,
189
],
"type": "task"
},
{
"name": "deep learning",
"pos": [
196,
209
],
"type": "field"
},
{
"name": "X.Y. Feng",
"pos": [
210,
219
],
"type": "researcher"
},
{
"name": "H. Zhang",
"pos": [
222,
230
],
"type": "researcher"
},
{
"name": "Y.J. Ren",
"pos": [
233,
241
],
"type": "researcher"
},
{
"name": "P.H. Shang",
"pos": [
244,
254
],
"type": "researcher"
},
{
"name": "Y. Zhu",
"pos": [
257,
263
],
"type": "researcher"
},
{
"name": "Y.C. Liang",
"pos": [
266,
276
],
"type": "researcher"
},
{
"name": "R.C. Guan",
"pos": [
279,
288
],
"type": "researcher"
},
{
"name": "D. Xu",
"pos": [
291,
296
],
"type": "researcher"
}
] |
Advocates of procedural representations were mainly centered at MIT , under the leadership of Marvin Minsky and Seymour Papert . | [
{
"name": "MIT",
"pos": [
64,
67
],
"type": "university"
},
{
"name": "Marvin Minsky",
"pos": [
94,
107
],
"type": "researcher"
},
{
"name": "Seymour Papert",
"pos": [
112,
126
],
"type": "researcher"
}
] |
The standard interface and calculator interface are written in Java . | [
{
"name": "Java",
"pos": [
63,
67
],
"type": "program language"
}
] |
Octave helps in solving linear and nonlinear problems numerically , and for performing other numerical experiments using a that is mostly compatible with MATLAB . | [
{
"name": "Octave",
"pos": [
0,
6
],
"type": "product"
},
{
"name": "MATLAB",
"pos": [
154,
160
],
"type": "product"
}
] |
Variants of the back-propagation algorithm as well as unsupervised methods by Geoff Hinton and colleagues at the University of Toronto can be used to train deep , highly nonlinear neural architectures , { { cite journal | [
{
"name": "back-propagation algorithm",
"pos": [
16,
42
],
"type": "algorithm"
},
{
"name": "unsupervised methods",
"pos": [
54,
74
],
"type": "else"
},
{
"name": "Geoff Hinton",
"pos": [
78,
90
],
"type": "researcher"
},
{
"name": "University of Toronto",
"pos": [
113,
134
],
"type": "university"
}
] |
or equivalently using DCG notation : | [
{
"name": "DCG",
"pos": [
22,
25
],
"type": "metrics"
}
] |
Self-organizing maps differ from other artificial neural networks as they apply competitive learning as opposed to error-correction learning such as backpropagation with gradient descent ) , and in the sense that they use a neighborhood function to preserve the topological properties of the input space . | [
{
"name": "artificial neural networks",
"pos": [
39,
65
],
"type": "algorithm"
},
{
"name": "competitive learning",
"pos": [
80,
100
],
"type": "algorithm"
},
{
"name": "error-correction learning",
"pos": [
115,
140
],
"type": "algorithm"
},
{
"name": "backpropagation",
"pos": [
149,
164
],
"type": "algorithm"
},
{
"name": "gradient descent",
"pos": [
170,
186
],
"type": "algorithm"
},
{
"name": "topological properties",
"pos": [
262,
284
],
"type": "else"
}
] |
Since the early 1990s , it has been recommended by several authorities , including the Audio Engineering Society that measurements of dynamic range be made with an audio signal present , which is then filtered out in the noise floor measurement used in determining dynamic range . This avoids questionable measurements based on the use of blank media , or muting circuits . | [
{
"name": "Audio Engineering Society",
"pos": [
87,
112
],
"type": "organization"
},
{
"name": "audio signal",
"pos": [
164,
176
],
"type": "else"
},
{
"name": "noise floor measurement",
"pos": [
221,
244
],
"type": "metrics"
}
] |
The technique used in creating eigenfaces and using them for recognition is also used outside of face recognition : handwriting recognition , lip reading , voice recognition , sign language / hand gestures interpretation and medical imaging analysis . | [
{
"name": "eigenfaces",
"pos": [
31,
41
],
"type": "else"
},
{
"name": "face recognition",
"pos": [
97,
113
],
"type": "task"
},
{
"name": "handwriting recognition",
"pos": [
116,
139
],
"type": "task"
},
{
"name": "lip reading",
"pos": [
142,
153
],
"type": "task"
},
{
"name": "voice recognition",
"pos": [
156,
173
],
"type": "task"
},
{
"name": "sign language",
"pos": [
176,
189
],
"type": "task"
},
{
"name": "hand gestures interpretation",
"pos": [
192,
220
],
"type": "task"
},
{
"name": "medical imaging analysis",
"pos": [
225,
249
],
"type": "field"
}
] |
The National Science Foundation was an umbrella for the National Aeronautics and Space Administration ( NASA ) , the US Department of Energy , the US Department of Commerce NIST , the US Department of Defense , Defense Advanced Research Projects Agency ( DARPA ) , and the Office of Naval Research coordinated studies to inform strategic planners in their deliberations . | [
{
"name": "National Science Foundation",
"pos": [
4,
31
],
"type": "organization"
},
{
"name": "National Aeronautics and Space Administration",
"pos": [
56,
101
],
"type": "organization"
},
{
"name": "NASA",
"pos": [
104,
108
],
"type": "organization"
},
{
"name": "US Department of Energy",
"pos": [
117,
140
],
"type": "organization"
},
{
"name": "US Department of Commerce NIST",
"pos": [
147,
177
],
"type": "organization"
},
{
"name": "US Department of Defense",
"pos": [
184,
208
],
"type": "organization"
},
{
"name": "Defense Advanced Research Projects Agency",
"pos": [
211,
252
],
"type": "organization"
},
{
"name": "DARPA",
"pos": [
255,
260
],
"type": "organization"
},
{
"name": "Office of Naval Research",
"pos": [
273,
297
],
"type": "organization"
}
] |
A fast method for computing maximum likelihood estimates for the probit model was proposed by Ronald Fisher as an appendix to Bliss ' work in 1935 . | [
{
"name": "maximum likelihood",
"pos": [
28,
46
],
"type": "metrics"
},
{
"name": "probit model",
"pos": [
65,
77
],
"type": "algorithm"
},
{
"name": "Ronald Fisher",
"pos": [
94,
107
],
"type": "researcher"
},
{
"name": "Bliss",
"pos": [
126,
131
],
"type": "researcher"
}
] |
Several of these programs are available online , such as Google Translate and the SYSTRAN system that powers AltaVista 's BabelFish ( now Yahoo 's Babelfish as of 9 May 2008 ) . | [
{
"name": "Google Translate",
"pos": [
57,
73
],
"type": "product"
},
{
"name": "SYSTRAN system",
"pos": [
82,
96
],
"type": "product"
},
{
"name": "AltaVista",
"pos": [
109,
118
],
"type": "organization"
},
{
"name": "BabelFish",
"pos": [
122,
131
],
"type": "product"
},
{
"name": "Yahoo",
"pos": [
138,
143
],
"type": "organization"
},
{
"name": "Babelfish",
"pos": [
147,
156
],
"type": "product"
}
] |
In 2002 Hutter , with Jürgen Schmidhuber and Shane Legg , developed and published a mathematical theory of artificial general intelligence based on idealised intelligent agents and reward-motivated reinforcement learning . | [
{
"name": "Hutter",
"pos": [
8,
14
],
"type": "researcher"
},
{
"name": "Jürgen Schmidhuber",
"pos": [
22,
40
],
"type": "researcher"
},
{
"name": "Shane Legg",
"pos": [
45,
55
],
"type": "researcher"
},
{
"name": "artificial general intelligence",
"pos": [
107,
138
],
"type": "field"
},
{
"name": "intelligent agents",
"pos": [
158,
176
],
"type": "else"
},
{
"name": "reinforcement learning",
"pos": [
198,
220
],
"type": "field"
}
] |
The most common way is using the so-called ROUGE ( Recall-Oriented Understudy for Gisting Evaluation ) measure . | [
{
"name": "ROUGE",
"pos": [
43,
48
],
"type": "metrics"
},
{
"name": "Recall-Oriented Understudy for Gisting Evaluation",
"pos": [
51,
100
],
"type": "metrics"
}
] |
RapidMiner provides learning schemes , models and algorithms and can be extended using R and Python scripts . David Norris , Bloor Research , November 13 , 2013 . | [
{
"name": "RapidMiner",
"pos": [
0,
10
],
"type": "product"
},
{
"name": "R",
"pos": [
87,
88
],
"type": "program language"
},
{
"name": "Python",
"pos": [
93,
99
],
"type": "program language"
},
{
"name": "David Norris",
"pos": [
110,
122
],
"type": "researcher"
},
{
"name": "Bloor Research",
"pos": [
125,
139
],
"type": "organization"
}
] |
tity contains a collection of visualization tools and algorithms for data analysis and predictive modeling , together with graphical user interfaces for easy access to these functions. but the more recent fully Java -based version ( Weka 3 ) , for which development started in 1997 , is now used in many different application areas , in particular for educational purposes and research . | [
{
"name": "tity",
"pos": [
0,
4
],
"type": "product"
},
{
"name": "data analysis",
"pos": [
69,
82
],
"type": "field"
},
{
"name": "predictive modeling",
"pos": [
87,
106
],
"type": "task"
},
{
"name": "graphical user interfaces",
"pos": [
123,
148
],
"type": "else"
},
{
"name": "Java",
"pos": [
211,
215
],
"type": "program language"
},
{
"name": "Weka 3",
"pos": [
233,
239
],
"type": "product"
}
] |
Eurisko made many interesting discoveries and enjoyed significant acclaim , with his paper Heuretics : Theoretical and Study of Heuristic Rules winning the Best Paper award at the 1982 Association for the Advancement of Artificial Intelligence . | [
{
"name": "Eurisko",
"pos": [
0,
7
],
"type": "product"
},
{
"name": "Heuretics : Theoretical and Study of Heuristic Rules",
"pos": [
91,
143
],
"type": "else"
},
{
"name": "Best Paper award",
"pos": [
156,
172
],
"type": "else"
},
{
"name": "1982 Association for the Advancement of Artificial Intelligence",
"pos": [
180,
243
],
"type": "conference"
}
] |
To allow for multiple entities , a separate Hinge loss is computed for each capsule . | [
{
"name": "Hinge loss",
"pos": [
44,
54
],
"type": "metrics"
}
] |
With the emergence of conversational assistants such as Apple 's Siri , Amazon Alexa , Google Assistant , Microsoft Cortana , and Samsung 's Bixby , Voice Portals can now be accessed through mobile devices and Far Field voice smart speakers such as the Amazon Echo and Google Home . | [
{
"name": "Apple 's Siri",
"pos": [
56,
69
],
"type": "product"
},
{
"name": "Amazon Alexa",
"pos": [
72,
84
],
"type": "product"
},
{
"name": "Google Assistant",
"pos": [
87,
103
],
"type": "product"
},
{
"name": "Microsoft Cortana",
"pos": [
106,
123
],
"type": "product"
},
{
"name": "Samsung 's Bixby",
"pos": [
130,
146
],
"type": "product"
},
{
"name": "Voice Portals",
"pos": [
149,
162
],
"type": "product"
},
{
"name": "Far Field voice smart speakers",
"pos": [
210,
240
],
"type": "product"
},
{
"name": "Amazon Echo",
"pos": [
253,
264
],
"type": "product"
},
{
"name": "Google Home",
"pos": [
269,
280
],
"type": "product"
}
] |
Examples of supervised learning are Naive Bayes classifier , Support vector machine , mixtures of Gaussians , and network . | [
{
"name": "supervised learning",
"pos": [
12,
31
],
"type": "field"
},
{
"name": "Naive Bayes classifier",
"pos": [
36,
58
],
"type": "algorithm"
},
{
"name": "Support vector machine",
"pos": [
61,
83
],
"type": "algorithm"
},
{
"name": "mixtures of Gaussians",
"pos": [
86,
107
],
"type": "algorithm"
},
{
"name": "network",
"pos": [
114,
121
],
"type": "algorithm"
}
] |
One can use the OSD algorithm to derive math O ( \ sqrt { T } ) / math regret bounds for the online version of Support vector machine for classification , which use the hinge loss math v _ t ( w ) = \ max \ { 0 , 1 - y _ t ( w \ cdot x _ t ) \ } / math | [
{
"name": "OSD algorithm",
"pos": [
16,
29
],
"type": "algorithm"
},
{
"name": "Support vector machine",
"pos": [
111,
133
],
"type": "algorithm"
},
{
"name": "classification",
"pos": [
138,
152
],
"type": "task"
},
{
"name": "hinge loss",
"pos": [
169,
179
],
"type": "metrics"
}
] |
Applications include object recognition , robotic mapping and navigation , image stitching , 3D modeling , gesture recognition , video tracking , individual identification of wildlife and match moving . | [
{
"name": "object recognition",
"pos": [
21,
39
],
"type": "task"
},
{
"name": "robotic mapping",
"pos": [
42,
57
],
"type": "task"
},
{
"name": "navigation",
"pos": [
62,
72
],
"type": "task"
},
{
"name": "image stitching",
"pos": [
75,
90
],
"type": "task"
},
{
"name": "3D modeling",
"pos": [
93,
104
],
"type": "task"
},
{
"name": "gesture recognition",
"pos": [
107,
126
],
"type": "task"
},
{
"name": "video tracking",
"pos": [
129,
143
],
"type": "task"
},
{
"name": "individual identification of wildlife",
"pos": [
146,
183
],
"type": "task"
},
{
"name": "match moving",
"pos": [
188,
200
],
"type": "task"
}
] |
A number of groups and companies are researching pose estimation , including groups at Brown University , Carnegie Mellon University , MPI Saarbruecken , Stanford University , the University of California , San Diego , the University of Toronto , the École Centrale Paris , ETH Zurich , National University of Sciences and Technology ( NUST ) , and the University of California , Irvine . | [
{
"name": "pose estimation",
"pos": [
49,
64
],
"type": "task"
},
{
"name": "Brown University",
"pos": [
87,
103
],
"type": "university"
},
{
"name": "Carnegie Mellon University",
"pos": [
106,
132
],
"type": "university"
},
{
"name": "MPI Saarbruecken",
"pos": [
135,
151
],
"type": "university"
},
{
"name": "Stanford University",
"pos": [
154,
173
],
"type": "university"
},
{
"name": "University of California , San Diego",
"pos": [
180,
216
],
"type": "university"
},
{
"name": "University of Toronto",
"pos": [
223,
244
],
"type": "university"
},
{
"name": "École Centrale Paris",
"pos": [
251,
271
],
"type": "university"
},
{
"name": "ETH Zurich",
"pos": [
274,
284
],
"type": "university"
},
{
"name": "National University of Sciences and Technology",
"pos": [
287,
333
],
"type": "university"
},
{
"name": "NUST",
"pos": [
336,
340
],
"type": "university"
},
{
"name": "University of California , Irvine",
"pos": [
353,
386
],
"type": "university"
}
] |
Sigmoid function Cross entropy loss is used for predicting K independent probability values in math 0,1 / math . | [
{
"name": "Sigmoid function Cross entropy loss",
"pos": [
0,
35
],
"type": "metrics"
}
] |
He held the Johann Bernoulli Chair of Mathematics and Informatics at the University of Groningen in the Netherlands , and the Toshiba Endowed Chair at the Tokyo Institute of Technology in Japan before becoming Professor at Cambridge . | [
{
"name": "Johann Bernoulli Chair",
"pos": [
12,
34
],
"type": "else"
},
{
"name": "Mathematics",
"pos": [
38,
49
],
"type": "field"
},
{
"name": "Informatics",
"pos": [
54,
65
],
"type": "field"
},
{
"name": "University of Groningen",
"pos": [
73,
96
],
"type": "university"
},
{
"name": "Netherlands",
"pos": [
104,
115
],
"type": "country"
},
{
"name": "Toshiba Endowed Chair",
"pos": [
126,
147
],
"type": "else"
},
{
"name": "Tokyo Institute of Technology",
"pos": [
155,
184
],
"type": "university"
},
{
"name": "Japan",
"pos": [
188,
193
],
"type": "country"
},
{
"name": "Cambridge",
"pos": [
223,
232
],
"type": "university"
}
] |
Another technique particularly used for recurrent neural network s is the long short-term memory ( LSTM ) network of 1997 by Sepp Hochreiter & Jürgen Schmidhuber . | [
{
"name": "recurrent neural network",
"pos": [
40,
64
],
"type": "algorithm"
},
{
"name": "long short-term memory",
"pos": [
74,
96
],
"type": "algorithm"
},
{
"name": "LSTM",
"pos": [
99,
103
],
"type": "algorithm"
},
{
"name": "Sepp Hochreiter",
"pos": [
125,
140
],
"type": "researcher"
},
{
"name": "Jürgen Schmidhuber",
"pos": [
143,
161
],
"type": "researcher"
}
] |
The inclusion of a C + + interpreter ( CINT until version 5.34 , Cling from version 6 ) makes this package very versatile as it can be used in interactive , scripted and compiled modes in a manner similar to commercial products like MATLAB . | [
{
"name": "C + +",
"pos": [
19,
24
],
"type": "program language"
},
{
"name": "CINT",
"pos": [
39,
43
],
"type": "product"
},
{
"name": "Cling",
"pos": [
65,
70
],
"type": "product"
},
{
"name": "MATLAB",
"pos": [
233,
239
],
"type": "product"
}
] |
Voice user interfaces that interpret and manage conversational state are challenging to design due to the inherent difficulty of integrating complex natural language processing tasks like coreference resolution , named-entity recognition , information retrieval , and dialog management . | [
{
"name": "Voice user interfaces",
"pos": [
0,
21
],
"type": "product"
},
{
"name": "natural language processing",
"pos": [
149,
176
],
"type": "field"
},
{
"name": "coreference resolution",
"pos": [
188,
210
],
"type": "task"
},
{
"name": "named-entity recognition",
"pos": [
213,
237
],
"type": "task"
},
{
"name": "information retrieval",
"pos": [
240,
261
],
"type": "task"
},
{
"name": "dialog management",
"pos": [
268,
285
],
"type": "task"
}
] |
Between 2009 and 2012 , the recurrent neural network s and deep feedforward neural network s developed in the research group of Jürgen Schmidhuber at the Swiss AI Lab IDSIA have won eight international competitions in pattern recognition and machine learning . | [
{
"name": "recurrent neural network",
"pos": [
28,
52
],
"type": "algorithm"
},
{
"name": "deep feedforward neural network",
"pos": [
59,
90
],
"type": "algorithm"
},
{
"name": "Jürgen Schmidhuber",
"pos": [
128,
146
],
"type": "researcher"
},
{
"name": "Swiss AI Lab IDSIA",
"pos": [
154,
172
],
"type": "organization"
},
{
"name": "pattern recognition",
"pos": [
218,
237
],
"type": "field"
},
{
"name": "machine learning",
"pos": [
242,
258
],
"type": "field"
}
] |
Modern Windows desktop systems can use SAPI 4 and SAPI 5 components to support speech synthesis and speech . | [
{
"name": "Windows desktop systems",
"pos": [
7,
30
],
"type": "product"
},
{
"name": "SAPI 4",
"pos": [
39,
45
],
"type": "product"
},
{
"name": "SAPI 5",
"pos": [
50,
56
],
"type": "product"
},
{
"name": "speech synthesis",
"pos": [
79,
95
],
"type": "task"
},
{
"name": "speech",
"pos": [
100,
106
],
"type": "task"
}
] |
He received two honorary degree s , one S. V. della laurea ad honorem in Psychology from the University of Padua in 1995 and one doctorate in Industrial Design and Engineering from Delft University of Technology . | [
{
"name": "S. V. della laurea ad honorem",
"pos": [
40,
69
],
"type": "else"
},
{
"name": "Psychology",
"pos": [
73,
83
],
"type": "field"
},
{
"name": "University of Padua",
"pos": [
93,
112
],
"type": "university"
},
{
"name": "Industrial Design and Engineering",
"pos": [
142,
175
],
"type": "field"
},
{
"name": "Delft University of Technology",
"pos": [
181,
211
],
"type": "university"
}
] |
With long-time collaborator Laurent Cohen , a neurologist at the Pitié-Salpêtrière Hospital in Paris , Dehaene also identified patients with lesions in different regions of the parietal lobe with impaired multiplication , but preserved subtraction ( associated with lesions of the inferior parietal lobule ) and others with impaired subtraction , but preserved multiplication ( associated with lesions to the intraparietal sulcus ) . | [
{
"name": "Laurent Cohen",
"pos": [
28,
41
],
"type": "researcher"
},
{
"name": "Pitié-Salpêtrière Hospital",
"pos": [
65,
91
],
"type": "organization"
},
{
"name": "Paris",
"pos": [
95,
100
],
"type": "location"
},
{
"name": "Dehaene",
"pos": [
103,
110
],
"type": "researcher"
},
{
"name": "parietal lobe",
"pos": [
177,
190
],
"type": "else"
},
{
"name": "inferior parietal lobule",
"pos": [
281,
305
],
"type": "else"
},
{
"name": "intraparietal sulcus",
"pos": [
409,
429
],
"type": "else"
}
] |
More recently , fictional representations of artificially intelligent robots in films such as A.I. Artificial Intelligence and Ex Machina and the 2016 TV adaptation of Westworld have engaged audience sympathy for the robots themselves . | [
{
"name": "artificially intelligent robots",
"pos": [
45,
76
],
"type": "product"
},
{
"name": "A.I. Artificial Intelligence",
"pos": [
94,
122
],
"type": "else"
},
{
"name": "Ex Machina",
"pos": [
127,
137
],
"type": "else"
},
{
"name": "Westworld",
"pos": [
168,
177
],
"type": "else"
}
] |
Two of the main methods used in unsupervised learning are principal component analysis and cluster analysis . | [
{
"name": "unsupervised learning",
"pos": [
32,
53
],
"type": "field"
},
{
"name": "principal component analysis",
"pos": [
58,
86
],
"type": "algorithm"
},
{
"name": "cluster analysis",
"pos": [
91,
107
],
"type": "task"
}
] |
The Walt Disney Company also began more prominent use of 3D films in special venues to impress audiences with Magic Journeys ( 1982 ) and Captain EO ( Francis Ford Coppola , 1986 , starring Michael Jackson ) being notable examples . | [
{
"name": "The Walt Disney Company",
"pos": [
0,
23
],
"type": "organization"
},
{
"name": "Magic Journeys",
"pos": [
110,
124
],
"type": "else"
},
{
"name": "Captain EO",
"pos": [
138,
148
],
"type": "else"
},
{
"name": "Francis Ford Coppola",
"pos": [
151,
171
],
"type": "person"
},
{
"name": "Michael Jackson",
"pos": [
190,
205
],
"type": "person"
}
] |
Since 2002 , perceptron training has become popular in the field of natural language processing for such tasks as part-of-speech tagging and syntactic parsing ( Collins , 2002 ) . | [
{
"name": "natural language processing",
"pos": [
68,
95
],
"type": "field"
},
{
"name": "part-of-speech tagging",
"pos": [
114,
136
],
"type": "task"
},
{
"name": "syntactic parsing",
"pos": [
141,
158
],
"type": "task"
},
{
"name": "Collins",
"pos": [
161,
168
],
"type": "researcher"
}
] |
The first palletizing robot was introduced in 1963 by the Fuji Yusoki Kogyo Company. by KUKA robotics in Germany , and the Programmable Universal Machine for Assembly was invented by Victor Scheinman in 1976 , and the design was sold to Unimation . | [
{
"name": "palletizing robot",
"pos": [
10,
27
],
"type": "product"
},
{
"name": "Fuji Yusoki Kogyo Company.",
"pos": [
58,
84
],
"type": "organization"
},
{
"name": "KUKA robotics",
"pos": [
88,
101
],
"type": "organization"
},
{
"name": "Germany",
"pos": [
105,
112
],
"type": "country"
},
{
"name": "Programmable Universal Machine for Assembly",
"pos": [
123,
166
],
"type": "product"
},
{
"name": "Victor Scheinman",
"pos": [
183,
199
],
"type": "researcher"
},
{
"name": "Unimation",
"pos": [
237,
246
],
"type": "organization"
}
] |
In the middle of the 1990s , while serving as president of the AAAI , Hayes began a series of attacks on critics of AI , mostly phrased in an ironic light , and ( together with his colleague Kenneth Ford ) invented an award named after Simon Newcomb to be given for the most ridiculous argument disproving the possibility of AI . | [
{
"name": "AAAI",
"pos": [
63,
67
],
"type": "conference"
},
{
"name": "Hayes",
"pos": [
70,
75
],
"type": "researcher"
},
{
"name": "AI",
"pos": [
116,
118
],
"type": "field"
},
{
"name": "Kenneth Ford",
"pos": [
191,
203
],
"type": "researcher"
},
{
"name": "Simon Newcomb",
"pos": [
236,
249
],
"type": "researcher"
},
{
"name": "AI",
"pos": [
325,
327
],
"type": "field"
}
] |
An optimal value for math \ alpha / math can be found by using a line search algorithm , that is , the magnitude of math \ alpha / math is determined by finding the value that minimizes S , usually using a line search in the interval math0 \ alpha 1 / math or a backtracking line search such as Armijo-line search . | [
{
"name": "line search algorithm",
"pos": [
65,
86
],
"type": "algorithm"
},
{
"name": "line search",
"pos": [
206,
217
],
"type": "algorithm"
},
{
"name": "backtracking line search",
"pos": [
262,
286
],
"type": "algorithm"
},
{
"name": "Armijo-line search",
"pos": [
295,
313
],
"type": "algorithm"
}
] |
He discusses Breadth-first search and Depth-first search techniques , but eventually concludes that the results represent expert system s that incarnate a lot of technical knowledge but don 't shine much light on the mental processes that humans use to solve such puzzles . | [
{
"name": "Breadth-first search",
"pos": [
13,
33
],
"type": "algorithm"
},
{
"name": "Depth-first search",
"pos": [
38,
56
],
"type": "algorithm"
},
{
"name": "expert system",
"pos": [
122,
135
],
"type": "product"
}
] |
Speech recognition and speech synthesis deal with how spoken language can be understood or created using computers . | [
{
"name": "Speech recognition",
"pos": [
0,
18
],
"type": "task"
},
{
"name": "speech synthesis",
"pos": [
23,
39
],
"type": "task"
}
] |
This math \ theta ^ { * } / math is normally estimated using a Maximum Likelihood ( math \ theta ^ { * } = \ theta ^ { ML } / math ) or Maximum A Posteriori ( math \ theta ^ { * } = \ theta ^ { MAP } / math ) procedure . | [
{
"name": "Maximum Likelihood",
"pos": [
63,
81
],
"type": "algorithm"
},
{
"name": "Maximum A Posteriori",
"pos": [
136,
156
],
"type": "algorithm"
},
{
"name": "MAP",
"pos": [
194,
197
],
"type": "algorithm"
}
] |
Some less widely spoken languages use the open-source eSpeak synthesizer for their speech ; producing a robotic , awkward voice that may be difficult to understand . | [
{
"name": "eSpeak synthesizer",
"pos": [
54,
72
],
"type": "product"
}
] |
Although used mainly by statisticians and other practitioners requiring an environment for statistical computation and software development , R can also operate as a general matrix calculation toolbox - with performance benchmarks comparable to GNU Octave or MATLAB . | [
{
"name": "R",
"pos": [
142,
143
],
"type": "program language"
},
{
"name": "GNU Octave",
"pos": [
245,
255
],
"type": "program language"
},
{
"name": "MATLAB",
"pos": [
259,
265
],
"type": "product"
}
] |
Heterodyning is a signal processing technique invented by Canadian inventor-engineer Reginald Fessenden that creates new frequencies by combining mixing two frequencies . | [
{
"name": "Heterodyning",
"pos": [
0,
12
],
"type": "algorithm"
},
{
"name": "signal processing",
"pos": [
18,
35
],
"type": "field"
},
{
"name": "Canadian",
"pos": [
58,
66
],
"type": "else"
},
{
"name": "Reginald Fessenden",
"pos": [
85,
103
],
"type": "researcher"
}
] |
Several other features that helped put 3D back on the map that month were the John Wayne feature Hondo ( distributed by Warner Bros. ) , Columbia 's Miss Sadie Thompson with Rita Hayworth , and Paramount 's Money From Home with Dean Martin and Jerry Lewis . | [
{
"name": "John Wayne",
"pos": [
78,
88
],
"type": "person"
},
{
"name": "Hondo",
"pos": [
97,
102
],
"type": "else"
},
{
"name": "Warner Bros.",
"pos": [
120,
132
],
"type": "organization"
},
{
"name": "Columbia",
"pos": [
137,
145
],
"type": "organization"
},
{
"name": "Miss Sadie Thompson",
"pos": [
149,
168
],
"type": "else"
},
{
"name": "Rita Hayworth",
"pos": [
174,
187
],
"type": "person"
},
{
"name": "Paramount",
"pos": [
194,
203
],
"type": "organization"
},
{
"name": "Money From Home",
"pos": [
207,
222
],
"type": "else"
},
{
"name": "Dean Martin",
"pos": [
228,
239
],
"type": "person"
},
{
"name": "Jerry Lewis",
"pos": [
244,
255
],
"type": "person"
}
] |
DeepFace is a deep learning facial recognition system created by a research group at Facebook . | [
{
"name": "DeepFace",
"pos": [
0,
8
],
"type": "product"
},
{
"name": "deep learning",
"pos": [
14,
27
],
"type": "field"
},
{
"name": "facial recognition",
"pos": [
28,
46
],
"type": "task"
},
{
"name": "Facebook",
"pos": [
85,
93
],
"type": "organization"
}
] |
Geometry processing is a common research topic at SIGGRAPH , the premier computer graphics academic conference , and the main topic of the annual Symposium on Geometry Processing . | [
{
"name": "Geometry processing",
"pos": [
0,
19
],
"type": "field"
},
{
"name": "SIGGRAPH",
"pos": [
50,
58
],
"type": "conference"
},
{
"name": "computer graphics",
"pos": [
73,
90
],
"type": "field"
},
{
"name": "Symposium on Geometry Processing",
"pos": [
146,
178
],
"type": "conference"
}
] |
Feature extraction and dimension reduction can be combined in one step using Principal Component Analysis ( PCA ) , linear discriminant analysis ( LDA ) , or canonical correlation analysis ( CCA ) techniques as a pre-processing step , followed by clustering by k -NN on feature vectors in reduced-dimension space . | [
{
"name": "Feature extraction",
"pos": [
0,
18
],
"type": "task"
},
{
"name": "dimension reduction",
"pos": [
23,
42
],
"type": "task"
},
{
"name": "Principal Component Analysis",
"pos": [
77,
105
],
"type": "algorithm"
},
{
"name": "PCA",
"pos": [
108,
111
],
"type": "algorithm"
},
{
"name": "linear discriminant analysis",
"pos": [
116,
144
],
"type": "algorithm"
},
{
"name": "LDA",
"pos": [
147,
150
],
"type": "algorithm"
},
{
"name": "canonical correlation analysis",
"pos": [
158,
188
],
"type": "algorithm"
},
{
"name": "CCA",
"pos": [
191,
194
],
"type": "algorithm"
},
{
"name": "pre-processing",
"pos": [
213,
227
],
"type": "else"
},
{
"name": "k -NN",
"pos": [
261,
266
],
"type": "algorithm"
}
] |
Artificial neural networks are computational models that excel at machine learning and pattern recognition . | [
{
"name": "Artificial neural networks",
"pos": [
0,
26
],
"type": "algorithm"
},
{
"name": "machine learning",
"pos": [
66,
82
],
"type": "field"
},
{
"name": "pattern recognition",
"pos": [
87,
106
],
"type": "field"
}
] |
, C. Papageorgiou and T. Poggio , A Trainable Pedestrian Detection system , International Journal of Computer Vision ( IJCV ) , pages 1 : 15-33 , 2000 others uses local features like histogram of oriented gradients N. Dalal , B. Triggs , Histograms of oriented gradients for human detection , IEEE Computer Society Conference on Computer Vision and Pattern Recognition ( CVPR ) , pages 1 : 886-893 , 2005 descriptors . | [
{
"name": "C. Papageorgiou",
"pos": [
2,
17
],
"type": "researcher"
},
{
"name": "T. Poggio",
"pos": [
22,
31
],
"type": "researcher"
},
{
"name": "Trainable Pedestrian Detection system",
"pos": [
36,
73
],
"type": "product"
},
{
"name": "International Journal of Computer Vision",
"pos": [
76,
116
],
"type": "conference"
},
{
"name": "IJCV",
"pos": [
119,
123
],
"type": "conference"
},
{
"name": "histogram of oriented gradients",
"pos": [
183,
214
],
"type": "algorithm"
},
{
"name": "N. Dalal",
"pos": [
215,
223
],
"type": "researcher"
},
{
"name": "B. Triggs",
"pos": [
226,
235
],
"type": "researcher"
},
{
"name": "Histograms of oriented gradients",
"pos": [
238,
270
],
"type": "algorithm"
},
{
"name": "human detection",
"pos": [
275,
290
],
"type": "task"
},
{
"name": "IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"pos": [
293,
368
],
"type": "conference"
},
{
"name": "CVPR",
"pos": [
371,
375
],
"type": "conference"
}
] |
An autoencoder is a type of artificial neural network used to learn Feature learning in an unsupervised learning manner . | [
{
"name": "autoencoder",
"pos": [
3,
14
],
"type": "algorithm"
},
{
"name": "artificial neural network",
"pos": [
28,
53
],
"type": "algorithm"
},
{
"name": "Feature learning",
"pos": [
68,
84
],
"type": "task"
},
{
"name": "unsupervised learning",
"pos": [
91,
112
],
"type": "field"
}
] |
Haralick is a Fellow of IEEE for his contributions in computer vision and image processing and a Fellow of the International Association for Pattern Recognition ( IAPR ) for his contributions in pattern recognition , image processing , and for service to IAPR . | [
{
"name": "Haralick",
"pos": [
0,
8
],
"type": "researcher"
},
{
"name": "IEEE",
"pos": [
24,
28
],
"type": "organization"
},
{
"name": "computer vision",
"pos": [
54,
69
],
"type": "field"
},
{
"name": "image processing",
"pos": [
74,
90
],
"type": "field"
},
{
"name": "International Association for Pattern Recognition",
"pos": [
111,
160
],
"type": "organization"
},
{
"name": "IAPR",
"pos": [
163,
167
],
"type": "organization"
},
{
"name": "pattern recognition",
"pos": [
195,
214
],
"type": "field"
},
{
"name": "image processing",
"pos": [
217,
233
],
"type": "field"
},
{
"name": "IAPR",
"pos": [
255,
259
],
"type": "organization"
}
] |
The first attempt at end-to-end ASR was with Connectionist Temporal Classification ( CTC ) -based systems introduced by Alex Graves of Google DeepMind and Navdeep Jaitly of the University of Toronto in 2014 . | [
{
"name": "end-to-end ASR",
"pos": [
21,
35
],
"type": "task"
},
{
"name": "Connectionist Temporal Classification",
"pos": [
45,
82
],
"type": "algorithm"
},
{
"name": "CTC",
"pos": [
85,
88
],
"type": "algorithm"
},
{
"name": "Alex Graves",
"pos": [
120,
131
],
"type": "researcher"
},
{
"name": "Google DeepMind",
"pos": [
135,
150
],
"type": "organization"
},
{
"name": "Navdeep Jaitly",
"pos": [
155,
169
],
"type": "researcher"
},
{
"name": "University of Toronto",
"pos": [
177,
198
],
"type": "university"
}
] |
Linear-fractional programming ( LFP ) is a generalization of linear programming ( LP ) . | [
{
"name": "Linear-fractional programming",
"pos": [
0,
29
],
"type": "algorithm"
},
{
"name": "LFP",
"pos": [
32,
35
],
"type": "algorithm"
},
{
"name": "linear programming",
"pos": [
61,
79
],
"type": "algorithm"
},
{
"name": "LP",
"pos": [
82,
84
],
"type": "algorithm"
}
] |
Lafferty received numerous awards , including two Test-of-Time awards at the International Conference on Machine Learning 2011 & 2012 , | [
{
"name": "Lafferty",
"pos": [
0,
8
],
"type": "researcher"
},
{
"name": "Test-of-Time awards",
"pos": [
50,
69
],
"type": "else"
},
{
"name": "International Conference on Machine Learning 2011 & 2012",
"pos": [
77,
133
],
"type": "conference"
}
] |
With the advent of component-based frameworks such as .NET and Java , component based development environments are capable of deploying the developed neural network to these frameworks as inheritable components . | [
{
"name": ".NET",
"pos": [
54,
58
],
"type": "product"
},
{
"name": "Java",
"pos": [
63,
67
],
"type": "program language"
},
{
"name": "neural network",
"pos": [
150,
164
],
"type": "algorithm"
}
] |
As with BLEU , the basic unit of evaluation is the sentence , the algorithm first creates an alignment ( see illustrations ) between two sentence s , the candidate translation string , and the reference translation string . | [
{
"name": "BLEU",
"pos": [
8,
12
],
"type": "metrics"
}
] |
One of the metrics used in NIST ' s annual Document Understanding Conferences , in which research groups submit their systems for both summarization and translation tasks , is the ROUGE metric ( Recall-Oriented Understudy for Gisting Evaluation , In Advances of Neural Information Processing Systems ( NIPS ) , Montreal , Canada , December - 2014 . | [
{
"name": "NIST ' s annual Document Understanding Conferences",
"pos": [
27,
77
],
"type": "conference"
},
{
"name": "summarization",
"pos": [
135,
148
],
"type": "task"
},
{
"name": "translation tasks",
"pos": [
153,
170
],
"type": "task"
},
{
"name": "ROUGE metric",
"pos": [
180,
192
],
"type": "metrics"
},
{
"name": "Recall-Oriented Understudy for Gisting Evaluation",
"pos": [
195,
244
],
"type": "metrics"
},
{
"name": "Neural Information Processing Systems",
"pos": [
262,
299
],
"type": "conference"
},
{
"name": "NIPS",
"pos": [
302,
306
],
"type": "conference"
},
{
"name": "Montreal",
"pos": [
311,
319
],
"type": "location"
},
{
"name": "Canada",
"pos": [
322,
328
],
"type": "country"
}
] |
Same implementation , to run in Java with JShell ( Java 9 minimum ) : codejshell scriptfile / codesyntaxhighlight lang = java | [
{
"name": "Java",
"pos": [
32,
36
],
"type": "program language"
},
{
"name": "JShell",
"pos": [
42,
48
],
"type": "product"
},
{
"name": "Java 9",
"pos": [
51,
57
],
"type": "program language"
},
{
"name": "codejshell",
"pos": [
70,
80
],
"type": "product"
}
] |
The NIST metric is based on the BLEU metric , but with some alterations . | [
{
"name": "NIST metric",
"pos": [
4,
15
],
"type": "metrics"
},
{
"name": "BLEU metric",
"pos": [
32,
43
],
"type": "metrics"
}
] |
In the late 1980s , two Netherlands universities , University of Groningen and University of Twente , jointly began a project called Knowledge Graphs , which are semantic networks but with the added constraint that edges are restricted to be from a limited set of possible relations , to facilitate algebras on the graph . | [
{
"name": "Netherlands",
"pos": [
24,
35
],
"type": "country"
},
{
"name": "University of Groningen",
"pos": [
51,
74
],
"type": "university"
},
{
"name": "University of Twente",
"pos": [
79,
99
],
"type": "university"
},
{
"name": "Knowledge Graphs",
"pos": [
133,
149
],
"type": "product"
},
{
"name": "semantic networks",
"pos": [
162,
179
],
"type": "algorithm"
}
] |
Grammar checkers are most often implemented as a feature of a larger program , such as a word processor , but are also available as a stand-alone application that can be activated from within programs that work with editable text . | [
{
"name": "Grammar checkers",
"pos": [
0,
16
],
"type": "product"
},
{
"name": "word processor",
"pos": [
89,
103
],
"type": "product"
}
] |
He is a Fellow of the American Association for the Advancement of Science , Association for the Advancement Artificial Intelligence , and Cognitive Science Society , and an editor of the J. Automated Reasoning , J. Learning Sciences , and J. Applied Ontology . | [
{
"name": "American Association for the Advancement of Science",
"pos": [
22,
73
],
"type": "organization"
},
{
"name": "Association for the Advancement Artificial Intelligence",
"pos": [
76,
131
],
"type": "conference"
},
{
"name": "Cognitive Science Society",
"pos": [
138,
163
],
"type": "organization"
},
{
"name": "J. Automated Reasoning",
"pos": [
187,
209
],
"type": "conference"
},
{
"name": "J. Learning Sciences",
"pos": [
212,
232
],
"type": "conference"
},
{
"name": "J. Applied Ontology",
"pos": [
239,
258
],
"type": "conference"
}
] |
Linear predictive coding ( LPC ) , a form of speech coding , began development with the work Fumitada Itakura of Nagoya University and Shuzo Saito of Nippon Telegraph and Telephone ( NTT ) in 1966 . | [
{
"name": "Linear predictive coding",
"pos": [
0,
24
],
"type": "algorithm"
},
{
"name": "LPC",
"pos": [
27,
30
],
"type": "algorithm"
},
{
"name": "speech coding",
"pos": [
45,
58
],
"type": "task"
},
{
"name": "Fumitada Itakura",
"pos": [
93,
109
],
"type": "researcher"
},
{
"name": "Nagoya University",
"pos": [
113,
130
],
"type": "university"
},
{
"name": "Shuzo Saito",
"pos": [
135,
146
],
"type": "researcher"
},
{
"name": "Nippon Telegraph and Telephone",
"pos": [
150,
180
],
"type": "university"
},
{
"name": "NTT",
"pos": [
183,
186
],
"type": "university"
}
] |
If the signal is further ergodic , all sample paths exhibits the same time-average and thus mathR _ x ^ { n / T _ 0 } ( \ tau ) = \ widehat { R } _ x ^ { n / T _ 0 } ( \ tau ) / math in mean square error sense . | [
{
"name": "mean square error",
"pos": [
186,
203
],
"type": "metrics"
}
] |
Feature extraction and dimension reduction can be combined in one step using principal component analysis ( PCA ) , linear discriminant analysis ( LDA ) , canonical correlation analysis ( CCA ) , or non-negative matrix factorization ( NMF ) techniques as a pre-processing step followed by clustering by K-NN on feature vectors in reduced-dimension space . | [
{
"name": "Feature extraction",
"pos": [
0,
18
],
"type": "task"
},
{
"name": "dimension reduction",
"pos": [
23,
42
],
"type": "task"
},
{
"name": "principal component analysis",
"pos": [
77,
105
],
"type": "algorithm"
},
{
"name": "PCA",
"pos": [
108,
111
],
"type": "algorithm"
},
{
"name": "linear discriminant analysis",
"pos": [
116,
144
],
"type": "algorithm"
},
{
"name": "LDA",
"pos": [
147,
150
],
"type": "algorithm"
},
{
"name": "canonical correlation analysis",
"pos": [
155,
185
],
"type": "algorithm"
},
{
"name": "CCA",
"pos": [
188,
191
],
"type": "algorithm"
},
{
"name": "non-negative matrix factorization",
"pos": [
199,
232
],
"type": "algorithm"
},
{
"name": "NMF",
"pos": [
235,
238
],
"type": "algorithm"
},
{
"name": "pre-processing step",
"pos": [
257,
276
],
"type": "else"
},
{
"name": "K-NN",
"pos": [
303,
307
],
"type": "algorithm"
},
{
"name": "feature vectors",
"pos": [
311,
326
],
"type": "else"
}
] |
Libraries written in Perl , Java , ActiveX or .NET can be directly called from MATLAB , | [
{
"name": "Perl",
"pos": [
21,
25
],
"type": "program language"
},
{
"name": "Java",
"pos": [
28,
32
],
"type": "program language"
},
{
"name": "ActiveX",
"pos": [
35,
42
],
"type": "program language"
},
{
"name": ".NET",
"pos": [
46,
50
],
"type": "program language"
},
{
"name": "MATLAB",
"pos": [
79,
85
],
"type": "product"
}
] |
The task of recognizing named entities in text is Named Entity Recognition while the task of determining the identity of the named entities mentioned in text is called Entity Linking . | [
{
"name": "recognizing named entities in text",
"pos": [
12,
46
],
"type": "task"
},
{
"name": "Named Entity Recognition",
"pos": [
50,
74
],
"type": "task"
},
{
"name": "Entity Linking",
"pos": [
168,
182
],
"type": "task"
}
] |
The sigmoid function s and derivatives used in the package were originally included in the package , from version 0.8.0 onwards , these were released in a separate R package sigmoid , with the intention to enable more general use . | [
{
"name": "sigmoid function",
"pos": [
4,
20
],
"type": "algorithm"
},
{
"name": "R",
"pos": [
164,
165
],
"type": "program language"
},
{
"name": "sigmoid",
"pos": [
174,
181
],
"type": "algorithm"
}
] |
Logo was created in 1967 at Bolt , Beranek and Newman ( BBN ) , a Cambridge , Massachusetts research firm , by Wally Feurzeig , Cynthia Solomon , and Seymour Papert . | [
{
"name": "Logo",
"pos": [
0,
4
],
"type": "program language"
},
{
"name": "Bolt , Beranek and Newman",
"pos": [
28,
53
],
"type": "organization"
},
{
"name": "BBN",
"pos": [
56,
59
],
"type": "organization"
},
{
"name": "Cambridge",
"pos": [
66,
75
],
"type": "university"
},
{
"name": "Massachusetts",
"pos": [
78,
91
],
"type": "university"
},
{
"name": "Wally Feurzeig",
"pos": [
111,
125
],
"type": "researcher"
},
{
"name": "Cynthia Solomon",
"pos": [
128,
143
],
"type": "researcher"
},
{
"name": "Seymour Papert",
"pos": [
150,
164
],
"type": "researcher"
}
] |
Neuroevolution is commonly used as part of the reinforcement learning paradigm , and it can be contrasted with conventional deep learning techniques that use gradient descent on a neural network with a fixed topology . | [
{
"name": "Neuroevolution",
"pos": [
0,
14
],
"type": "else"
},
{
"name": "reinforcement learning",
"pos": [
47,
69
],
"type": "field"
},
{
"name": "deep learning",
"pos": [
124,
137
],
"type": "field"
},
{
"name": "gradient descent",
"pos": [
158,
174
],
"type": "algorithm"
},
{
"name": "neural network",
"pos": [
180,
194
],
"type": "algorithm"
}
] |
If we use least squares to fit a function in the form of a hyperplane ŷ = a + β supT / sup x to the data ( x sub i / sub , y sub i / sub ) sub 1 ≤ i ≤ n / sub , we could then assess the fit using the mean squared error ( MSE ) . | [
{
"name": "least squares",
"pos": [
10,
23
],
"type": "algorithm"
},
{
"name": "mean squared error",
"pos": [
200,
218
],
"type": "metrics"
},
{
"name": "MSE",
"pos": [
221,
224
],
"type": "metrics"
}
] |
The company has international locations in Australia , Brazil , Canada , China , Germany , India , Italy , Japan , Korea , Lithuania , Poland , Malaysia , the Philippines , Russia , Singapore , South Africa , Spain , Taiwan , Thailand , Turkey and the United Kingdom . | [
{
"name": "Australia",
"pos": [
43,
52
],
"type": "country"
},
{
"name": "Brazil",
"pos": [
55,
61
],
"type": "country"
},
{
"name": "Canada",
"pos": [
64,
70
],
"type": "country"
},
{
"name": "China",
"pos": [
73,
78
],
"type": "country"
},
{
"name": "Germany",
"pos": [
81,
88
],
"type": "country"
},
{
"name": "India",
"pos": [
91,
96
],
"type": "country"
},
{
"name": "Italy",
"pos": [
99,
104
],
"type": "country"
},
{
"name": "Japan",
"pos": [
107,
112
],
"type": "country"
},
{
"name": "Korea",
"pos": [
115,
120
],
"type": "country"
},
{
"name": "Lithuania",
"pos": [
123,
132
],
"type": "country"
},
{
"name": "Poland",
"pos": [
135,
141
],
"type": "country"
},
{
"name": "Malaysia",
"pos": [
144,
152
],
"type": "country"
},
{
"name": "Philippines",
"pos": [
159,
170
],
"type": "country"
},
{
"name": "Russia",
"pos": [
173,
179
],
"type": "country"
},
{
"name": "Singapore",
"pos": [
182,
191
],
"type": "country"
},
{
"name": "South Africa",
"pos": [
194,
206
],
"type": "country"
},
{
"name": "Spain",
"pos": [
209,
214
],
"type": "country"
},
{
"name": "Taiwan",
"pos": [
217,
223
],
"type": "country"
},
{
"name": "Thailand",
"pos": [
226,
234
],
"type": "country"
},
{
"name": "Turkey",
"pos": [
237,
243
],
"type": "country"
},
{
"name": "United Kingdom",
"pos": [
252,
266
],
"type": "country"
}
] |
He holds a D.Sc. degree in electrical and computer engineering ( 2000 ) from Inria and the University of Nice Sophia Antipolis , and has held permanent positions at Siemens Corporate Technology , École des ponts ParisTech as well as visiting positions at Rutgers University , Yale University and University of Houston . | [
{
"name": "D.Sc. degree",
"pos": [
11,
23
],
"type": "else"
},
{
"name": "electrical and computer engineering",
"pos": [
27,
62
],
"type": "field"
},
{
"name": "Inria",
"pos": [
77,
82
],
"type": "organization"
},
{
"name": "University of Nice Sophia Antipolis",
"pos": [
91,
126
],
"type": "university"
},
{
"name": "Siemens Corporate Technology",
"pos": [
165,
193
],
"type": "organization"
},
{
"name": "École des ponts ParisTech",
"pos": [
196,
221
],
"type": "university"
},
{
"name": "Rutgers University",
"pos": [
255,
273
],
"type": "university"
},
{
"name": "Yale University",
"pos": [
276,
291
],
"type": "university"
},
{
"name": "University of Houston",
"pos": [
296,
317
],
"type": "university"
}
] |
Licensing the original patent awarded to inventor George Devol , Engelberger developed the first industrial robot in the United States , the Unimate , in the 1950s . | [
{
"name": "George Devol",
"pos": [
50,
62
],
"type": "researcher"
},
{
"name": "Engelberger",
"pos": [
65,
76
],
"type": "researcher"
},
{
"name": "industrial robot",
"pos": [
97,
113
],
"type": "product"
},
{
"name": "United States",
"pos": [
121,
134
],
"type": "country"
},
{
"name": "Unimate",
"pos": [
141,
148
],
"type": "product"
}
] |
The input is called speech recognition and the output is called speech synthesis . | [
{
"name": "speech recognition",
"pos": [
20,
38
],
"type": "task"
},
{
"name": "speech synthesis",
"pos": [
64,
80
],
"type": "task"
}
] |
Descendants of the CLIPS language include Jess ( rule-based portion of CLIPS rewritten in Java , it later grew up in different direction ) , JESS was originally inspired | [
{
"name": "CLIPS",
"pos": [
19,
24
],
"type": "program language"
},
{
"name": "Jess",
"pos": [
42,
46
],
"type": "program language"
},
{
"name": "CLIPS",
"pos": [
71,
76
],
"type": "program language"
},
{
"name": "Java",
"pos": [
90,
94
],
"type": "program language"
},
{
"name": "JESS",
"pos": [
141,
145
],
"type": "program language"
}
] |
It also created flexible intelligent AGV applications , designing the Motivity control system used by RMT Robotics to develop its ADAM iAGV ( Self-Guided Vehicle ) , used for complex pick and place operations , in conjunction with gantry systems and industrial robot arms , used in first-tier auto supply factories to move products from process to process in non-linear layouts . | [
{
"name": "AGV",
"pos": [
37,
40
],
"type": "product"
},
{
"name": "Motivity control system",
"pos": [
70,
93
],
"type": "product"
},
{
"name": "RMT Robotics",
"pos": [
102,
114
],
"type": "organization"
},
{
"name": "ADAM iAGV",
"pos": [
130,
139
],
"type": "product"
},
{
"name": "gantry systems",
"pos": [
231,
245
],
"type": "product"
},
{
"name": "industrial robot arms",
"pos": [
250,
271
],
"type": "product"
},
{
"name": "non-linear layouts",
"pos": [
359,
377
],
"type": "else"
}
] |
The parameters β are typically estimated by maximum likelihood . | [
{
"name": "maximum likelihood",
"pos": [
44,
62
],
"type": "metrics"
}
] |
The information retrieval metrics such as precision and recall or DCG are useful to assess the quality of a recommendation method . | [
{
"name": "information retrieval",
"pos": [
4,
25
],
"type": "task"
},
{
"name": "precision",
"pos": [
42,
51
],
"type": "metrics"
},
{
"name": "recall",
"pos": [
56,
62
],
"type": "metrics"
},
{
"name": "DCG",
"pos": [
66,
69
],
"type": "metrics"
}
] |
A typical factory contains hundreds of industrial robot s working on fully automated production lines , with one robot for every ten human workers . | [
{
"name": "industrial robot",
"pos": [
39,
55
],
"type": "product"
}
] |
Over the past decade , PCNNs have been used in a variety of image processing applications , including : image segmentation , feature generation , face extraction , motion detection , region growing , and noise reduction . | [
{
"name": "PCNNs",
"pos": [
23,
28
],
"type": "product"
},
{
"name": "image processing",
"pos": [
60,
76
],
"type": "field"
},
{
"name": "image segmentation",
"pos": [
104,
122
],
"type": "task"
},
{
"name": "feature generation",
"pos": [
125,
143
],
"type": "task"
},
{
"name": "face extraction",
"pos": [
146,
161
],
"type": "task"
},
{
"name": "motion detection",
"pos": [
164,
180
],
"type": "task"
},
{
"name": "region growing",
"pos": [
183,
197
],
"type": "task"
},
{
"name": "noise reduction",
"pos": [
204,
219
],
"type": "task"
}
] |
Xu has published more than 50 papers at international conferences and in journals in the field of computer vision and won the Best Paper Award at the international conference on Non-Photorealistic Rendering and Animation ( NPAR ) 2012 and the Best Reviewer Award at the international conferences Asian Conference on Computer Vision ACCV 2012 and International Conference on Computer Vision ( ICCV ) 2015 . | [
{
"name": "Xu",
"pos": [
0,
2
],
"type": "researcher"
},
{
"name": "computer vision",
"pos": [
98,
113
],
"type": "field"
},
{
"name": "Best Paper Award",
"pos": [
126,
142
],
"type": "else"
},
{
"name": "international conference on Non-Photorealistic Rendering and Animation",
"pos": [
150,
220
],
"type": "conference"
},
{
"name": "NPAR",
"pos": [
223,
227
],
"type": "conference"
},
{
"name": "Best Reviewer Award",
"pos": [
243,
262
],
"type": "else"
},
{
"name": "international conferences Asian Conference on Computer Vision",
"pos": [
270,
331
],
"type": "conference"
},
{
"name": "ACCV 2012",
"pos": [
332,
341
],
"type": "conference"
},
{
"name": "International Conference on Computer Vision",
"pos": [
346,
389
],
"type": "conference"
},
{
"name": "ICCV",
"pos": [
392,
396
],
"type": "conference"
}
] |
CycL in computer science and artificial intelligence is an ontology language used by Doug Lenat 's Cyc artificial project . | [
{
"name": "CycL",
"pos": [
0,
4
],
"type": "program language"
},
{
"name": "computer science",
"pos": [
8,
24
],
"type": "field"
},
{
"name": "artificial intelligence",
"pos": [
29,
52
],
"type": "field"
},
{
"name": "ontology language",
"pos": [
59,
76
],
"type": "else"
},
{
"name": "Doug Lenat",
"pos": [
85,
95
],
"type": "researcher"
},
{
"name": "Cyc artificial project",
"pos": [
99,
121
],
"type": "else"
}
] |
Also in regression analysis , mean squared error , often referred to as mean squared prediction error or out-of-sample mean squared error , can refer to the mean value of the squared deviations of the predictions from the TRUE values , over an out-of-sample test space , generated by a model estimated over a particular sample space . | [
{
"name": "regression analysis",
"pos": [
8,
27
],
"type": "task"
},
{
"name": "mean squared error",
"pos": [
30,
48
],
"type": "metrics"
},
{
"name": "mean squared prediction error",
"pos": [
72,
101
],
"type": "metrics"
},
{
"name": "out-of-sample mean squared error",
"pos": [
105,
137
],
"type": "metrics"
},
{
"name": "squared deviations",
"pos": [
175,
193
],
"type": "else"
}
] |
As for the results , the C-HOG and R-HOG block descriptors perform comparably , with the C-HOG descriptors maintaining a slight advantage in the detection miss rate at fixed FALSE positive rate s across both data sets . | [
{
"name": "C-HOG",
"pos": [
25,
30
],
"type": "algorithm"
},
{
"name": "R-HOG",
"pos": [
35,
40
],
"type": "algorithm"
},
{
"name": "C-HOG descriptors",
"pos": [
89,
106
],
"type": "algorithm"
},
{
"name": "FALSE positive rate",
"pos": [
174,
193
],
"type": "metrics"
}
] |
Popular recognition algorithms include principal component analysis using eigenface s , linear discriminant analysis , Elastic matching using the Fisherface algorithm , the hidden Markov model , the multilinear subspace learning using tensor representation , and the neuronal motivated dynamic link matching . | [
{
"name": "principal component analysis",
"pos": [
39,
67
],
"type": "algorithm"
},
{
"name": "eigenface",
"pos": [
74,
83
],
"type": "else"
},
{
"name": "linear discriminant analysis",
"pos": [
88,
116
],
"type": "algorithm"
},
{
"name": "Elastic matching",
"pos": [
119,
135
],
"type": "algorithm"
},
{
"name": "Fisherface algorithm",
"pos": [
146,
166
],
"type": "algorithm"
},
{
"name": "hidden Markov model",
"pos": [
173,
192
],
"type": "algorithm"
},
{
"name": "multilinear subspace learning",
"pos": [
199,
228
],
"type": "algorithm"
},
{
"name": "tensor representation",
"pos": [
235,
256
],
"type": "else"
},
{
"name": "dynamic link matching",
"pos": [
286,
307
],
"type": "algorithm"
}
] |
Beginning at the 2019 Toronto International Film Festival , films may now be restricted from screening at Scotiabank Theatre Toronto - one of the festival 's main venues - and screened elsewhere ( such as TIFF Bell Lightbox and other local cinemas ) if distributed by a service such as Netflix . | [
{
"name": "2019 Toronto International Film Festival",
"pos": [
17,
57
],
"type": "else"
},
{
"name": "Scotiabank Theatre Toronto",
"pos": [
106,
132
],
"type": "location"
},
{
"name": "TIFF Bell Lightbox",
"pos": [
205,
223
],
"type": "location"
},
{
"name": "Netflix",
"pos": [
286,
293
],
"type": "organization"
}
] |
Unimation purchased Victor Scheinman ' s Vicarm Inc. in 1977 , and with Scheinman 's help , the company created and began producing the Programmable Universal Machine for Assembly , a new model of robotic arm , and using Scheinman 's cutting-edge VAL programming language . | [
{
"name": "Unimation",
"pos": [
0,
9
],
"type": "organization"
},
{
"name": "Victor Scheinman",
"pos": [
20,
36
],
"type": "researcher"
},
{
"name": "Vicarm Inc.",
"pos": [
41,
52
],
"type": "organization"
},
{
"name": "Scheinman",
"pos": [
72,
81
],
"type": "researcher"
},
{
"name": "Programmable Universal Machine for Assembly",
"pos": [
136,
179
],
"type": "product"
},
{
"name": "Scheinman",
"pos": [
221,
230
],
"type": "researcher"
},
{
"name": "VAL programming language",
"pos": [
247,
271
],
"type": "program language"
}
] |
J48 is an open source Java implementation of the C4.5 algorithm in the Weka data mining tool . | [
{
"name": "J48",
"pos": [
0,
3
],
"type": "product"
},
{
"name": "Java",
"pos": [
22,
26
],
"type": "program language"
},
{
"name": "C4.5 algorithm",
"pos": [
49,
63
],
"type": "algorithm"
},
{
"name": "Weka data mining tool",
"pos": [
71,
92
],
"type": "product"
}
] |
The 2004 SSIM paper has been cited over 20,000 times according to Google Scholar , It also received the IEEE Signal Processing Society Sustained Impact Award for 2016 , indicative of a paper having an unusually high impact for at least 10 years following its publication . | [
{
"name": "SSIM",
"pos": [
9,
13
],
"type": "metrics"
},
{
"name": "Google Scholar",
"pos": [
66,
80
],
"type": "product"
},
{
"name": "IEEE Signal Processing Society Sustained Impact Award",
"pos": [
104,
157
],
"type": "else"
}
] |
The speech synthesis is verging on being completely indistinguishable from a real human 's voice with the 2016 introduction of the voice editing and generation software Adobe Voco , a prototype slated to be a part of the Adobe Creative Suite and DeepMind WaveNet , a prototype from Google . | [
{
"name": "speech synthesis",
"pos": [
4,
20
],
"type": "task"
},
{
"name": "Adobe Voco",
"pos": [
169,
179
],
"type": "product"
},
{
"name": "Adobe Creative Suite",
"pos": [
221,
241
],
"type": "product"
},
{
"name": "DeepMind",
"pos": [
246,
254
],
"type": "organization"
},
{
"name": "WaveNet",
"pos": [
255,
262
],
"type": "product"
},
{
"name": "Google",
"pos": [
282,
288
],
"type": "organization"
}
] |
Poggio is an honorary member of the Neuroscience Research Program , a member of the American Academy of Arts and Sciences and a founding fellow of AAAI and a founding member of the McGovern Institute for Brain Research . | [
{
"name": "Poggio",
"pos": [
0,
6
],
"type": "researcher"
},
{
"name": "Neuroscience Research Program",
"pos": [
36,
65
],
"type": "organization"
},
{
"name": "American Academy of Arts and Sciences",
"pos": [
84,
121
],
"type": "organization"
},
{
"name": "AAAI",
"pos": [
147,
151
],
"type": "conference"
},
{
"name": "McGovern Institute for Brain Research",
"pos": [
181,
218
],
"type": "organization"
}
] |
During the 1990s , encouraged by successes in speech recognition and speech synthesis , research began into speech translation with the development of the German Verbmobil project . | [
{
"name": "speech recognition",
"pos": [
46,
64
],
"type": "task"
},
{
"name": "speech synthesis",
"pos": [
69,
85
],
"type": "task"
},
{
"name": "speech translation",
"pos": [
108,
126
],
"type": "task"
},
{
"name": "German",
"pos": [
155,
161
],
"type": "else"
},
{
"name": "Verbmobil project",
"pos": [
162,
179
],
"type": "else"
}
] |
In 1999 , Felix Gers and his advisor Jürgen Schmidhuber and Fred Cummins introduced the forget gate ( also called keep gate ) into LSTM architecture , | [
{
"name": "Felix Gers",
"pos": [
10,
20
],
"type": "researcher"
},
{
"name": "Jürgen Schmidhuber",
"pos": [
37,
55
],
"type": "researcher"
},
{
"name": "Fred Cummins",
"pos": [
60,
72
],
"type": "researcher"
},
{
"name": "forget gate",
"pos": [
88,
99
],
"type": "algorithm"
},
{
"name": "keep gate",
"pos": [
114,
123
],
"type": "algorithm"
},
{
"name": "LSTM",
"pos": [
131,
135
],
"type": "algorithm"
}
] |
In digital signal processing and information theory , the normalized sinc function is commonly defined for by | [
{
"name": "digital signal processing",
"pos": [
3,
28
],
"type": "field"
},
{
"name": "information theory",
"pos": [
33,
51
],
"type": "field"
},
{
"name": "normalized sinc function",
"pos": [
58,
82
],
"type": "algorithm"
}
] |
The term computational linguistics itself was first coined by David Hays , a founding member of both the Association for Computational Linguistics and the International Committee on Computational Linguistics ( ICCL ) . | [
{
"name": "computational linguistics",
"pos": [
9,
34
],
"type": "field"
},
{
"name": "David Hays",
"pos": [
62,
72
],
"type": "researcher"
},
{
"name": "Association for Computational Linguistics",
"pos": [
105,
146
],
"type": "conference"
},
{
"name": "International Committee on Computational Linguistics",
"pos": [
155,
207
],
"type": "organization"
},
{
"name": "ICCL",
"pos": [
210,
214
],
"type": "organization"
}
] |
59 , pp. 2547-2553 , Oct. 2011 In one dimensional polynomial-based memory ( or memoryless ) DPD , in order to solve for the digital pre-distorter polynomials coefficients and minimize the mean squared error ( MSE ) , the distorted output of the nonlinear system must be over-sampled at a rate that enables the capture of the nonlinear products of the order of the digital pre-distorter . | [
{
"name": "one dimensional polynomial-based memory",
"pos": [
34,
73
],
"type": "else"
},
{
"name": "DPD",
"pos": [
92,
95
],
"type": "else"
},
{
"name": "mean squared error",
"pos": [
188,
206
],
"type": "metrics"
},
{
"name": "MSE",
"pos": [
209,
212
],
"type": "metrics"
}
] |
Boris Katz , ( born October 5 , 1947 , Chișinău , Moldavian SSR , Soviet Union , ( now Chișinău , Moldova ) ) is a principal American research scientist ( computer scientist ) at the MIT Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology in Cambridge and head of the Laboratory 's InfoLab Group . | [
{
"name": "Boris Katz",
"pos": [
0,
10
],
"type": "researcher"
},
{
"name": "Chișinău",
"pos": [
39,
47
],
"type": "location"
},
{
"name": "Moldavian SSR",
"pos": [
50,
63
],
"type": "location"
},
{
"name": "Soviet Union",
"pos": [
66,
78
],
"type": "country"
},
{
"name": "Chișinău",
"pos": [
87,
95
],
"type": "location"
},
{
"name": "Moldova",
"pos": [
98,
105
],
"type": "country"
},
{
"name": "MIT Computer Science and Artificial Intelligence Laboratory",
"pos": [
183,
242
],
"type": "organization"
},
{
"name": "Massachusetts Institute of Technology",
"pos": [
250,
287
],
"type": "organization"
},
{
"name": "Cambridge",
"pos": [
291,
300
],
"type": "university"
},
{
"name": "InfoLab Group",
"pos": [
331,
344
],
"type": "organization"
}
] |
End of preview. Expand
in Dataset Viewer.
No dataset card yet
New: Create and edit this dataset card directly on the website!
Contribute a Dataset Card- Downloads last month
- 2