%0 Journal Article %1 citeulike:3080763 %A Kemp, Charles %A Tenenbaum, Joshua B B. %C Department of Psychology, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213. %D 2008 %J Proceedings of the National Academy of Sciences of the United States of America %K bayesian concept constraints imported learning structure unsupervised %R http://dx.doi.org/10.1073/pnas.0802631105 %T The discovery of structural form. %U http://dx.doi.org/10.1073/pnas.0802631105 %X Algorithms for finding structure in data have become increasingly important both as tools for scientific data analysis and as models of human learning, yet they suffer from a critical limitation. Scientists discover qualitatively new forms of structure in observed data: For instance, Linnaeus recognized the hierarchical organization of biological species, and Mendeleev recognized the periodic structure of the chemical elements. Analogous insights play a pivotal role in cognitive development: Children discover that object category labels can be organized into hierarchies, friendship networks are organized into cliques, and comparative relations (e.g., "bigger than" or "better than") respect a transitive order. Standard algorithms, however, can only learn structures of a single form that must be specified in advance: For instance, algorithms for hierarchical clustering create tree structures, whereas algorithms for dimensionality-reduction create low-dimensional spaces. Here, we present a computational model that learns structures of many different forms and that discovers which form is best for a given dataset. The model makes probabilistic inferences over a space of graph grammars representing trees, linear orders, multidimensional spaces, rings, dominance hierarchies, cliques, and other forms and successfully discovers the underlying structure of a variety of physical, biological, and social domains. Our approach brings structure learning methods closer to human abilities and may lead to a deeper computational understanding of cognitive development.

@article{citeulike:3080763, abstract = {Algorithms for finding structure in data have become increasingly important both as tools for scientific data analysis and as models of human learning, yet they suffer from a critical limitation. Scientists discover qualitatively new forms of structure in observed data: For instance, Linnaeus recognized the hierarchical organization of biological species, and Mendeleev recognized the periodic structure of the chemical elements. Analogous insights play a pivotal role in cognitive development: Children discover that object category labels can be organized into hierarchies, friendship networks are organized into cliques, and comparative relations (e.g., "bigger than" or "better than") respect a transitive order. Standard algorithms, however, can only learn structures of a single form that must be specified in advance: For instance, algorithms for hierarchical clustering create tree structures, whereas algorithms for dimensionality-reduction create low-dimensional spaces. Here, we present a computational model that learns structures of many different forms and that discovers which form is best for a given dataset. The model makes probabilistic inferences over a space of graph grammars representing trees, linear orders, multidimensional spaces, rings, dominance hierarchies, cliques, and other forms and successfully discovers the underlying structure of a variety of physical, biological, and social domains. Our approach brings structure learning methods closer to human abilities and may lead to a deeper computational understanding of cognitive development.}, added-at = {2009-03-06T14:41:46.000+0100}, address = {Department of Psychology, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213.}, author = {Kemp, Charles and Tenenbaum, Joshua B B.}, biburl = {https://www.bibsonomy.org/bibtex/23db27296cebabfa229b29c9e42422fcf/okohonen}, citeulike-article-id = {3080763}, doi = {http://dx.doi.org/10.1073/pnas.0802631105}, interhash = {d0121d4f7b9c005eaa8e65b33cf3961c}, intrahash = {3db27296cebabfa229b29c9e42422fcf}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, keywords = {bayesian concept constraints imported learning structure unsupervised}, month = {July}, posted-at = {2008-08-07 21:40:11}, priority = {2}, timestamp = {2009-03-06T14:41:46.000+0100}, title = {The discovery of structural form.}, url = {http://dx.doi.org/10.1073/pnas.0802631105}, year = 2008 }