Switch to: References

Citations of:

Category-based similarity

In Garrison W. Cottrell (ed.), Proceedings of the Eighteenth Annual Conference of the Cognitive Science Society. Lawrence Erlbaum. pp. 290 (1996)

Add citations

You must login to add citations.
  1. Relational learning re-examined.Chris Thornton & Andy Clark - 1997 - Behavioral and Brain Sciences 20 (1):83-83.
    We argue that existing learning algorithms are often poorly equipped to solve problems involving a certain type of important and widespread regularity that we call “type-2 regularity.” The solution in these cases is to trade achieved representation against computational search. We investigate several ways in which such a trade-off may be pursued including simple incremental learning, modular connectionism, and the developmental hypothesis of “representational redescription.”.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  • Detecting anomalous features in complex stimuli: The role of structured comparison.Kenneth J. Kurtz & Dedre Gentner - 2013 - Journal of Experimental Psychology: Applied 19 (3):219.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Altering object representations through category learning.Robert L. Goldstone, Yvonne Lippa & Richard M. Shiffrin - 2001 - Cognition 78 (1):27-43.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  • Motion events in language and cognition.S. Gennari - 2002 - Cognition 83 (1):49-79.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  • Trading spaces: Computation, representation, and the limits of uninformed learning.Andy Clark & Chris Thornton - 1997 - Behavioral and Brain Sciences 20 (1):57-66.
    Some regularities enjoy only an attenuated existence in a body of training data. These are regularities whose statistical visibility depends on some systematic recoding of the data. The space of possible recodings is, however, infinitely large – it is the space of applicable Turing machines. As a result, mappings that pivot on such attenuated regularities cannot, in general, be found by brute-force search. The class of problems that present such mappings we call the class of “type-2 problems.” Type-1 problems, by (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   44 citations