Analogical inferences in the family trees task: A review

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We reviewed the performance results on a generalization test obtained by Hinton in a pioneering study of perceptrons' capacity to make analogical inferences. In that test, a five-layer feed-forward network was exposed to items that were not part of its training set (i.e., four relationships between members of two genealogically identical fa-milies), to see whether it could nevertheless generalize and produce the correct output. The good performance showed by two simulations was interpreted by Hinton as an evidence of its ability to detect the common structure shared by both families and make analogical inferences from one family tree to the other. However, we claim that this work's good results were clouded by unsuitable test items, and that it also lacked a control condition to prove that analogical inferences were actually done. Our study, which tackled these two aspects through experimental manipulation, provides stronger evidence supporting Hinton's conclusions. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Varona-Moya, S., & Cobos, P. L. (2012). Analogical inferences in the family trees task: A review. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7553 LNCS, pp. 221–228). https://doi.org/10.1007/978-3-642-33266-1_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free