Concepts & Categorisation (Week 5) Flashcards

1
Q

Knowledge

A

Concepts: mental representation useful for cognitive efficiency.
- logical concepts.
- natural concepts.
Categorisation: the process by which things are placed into groups.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why categorise?

A

Reduces complexity of the environment (cognitive economy)- when we see new things we haven’t seen before, if we can assign them to a concept/category it allows us to infer a number of things similar to them.
Allows us to recognise novel patterns.
Allows us to establish hierarchies of objects.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Logical concepts: the strict rule based version.

A

Concept identification: defined by logical rules:

  • conjunctive rule: use the logical relation ‘and’ (striped and square).
  • disjunctive rule: used the logical relation ‘or’ (striped or square).
  • conditional rule: used the logical ‘if’, ‘then’ relation (if striped it must be a square).
  • biconditional rule: used the logical ‘if’, ‘then’ in both directions (if striped then square; if square then striped).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Logical concepts: attributes + rule

A
Attributes= distinct features of objects. 
Rule= logical relationship between attributes. 
Exemplar= an object that satisfies a concept.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Conjunctive rule: AND (for two attributes)

A

Both relevant attributes must be present to be a representative of the concept.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Disjunctive rule: OR (for two attributes)

A

Either of the relevant attributes must be present to be a representative of the concept. An object may have both attributes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Conditional rule: IF 1 THEN 2

A

If the first attribute is present, the other must be present. Any object that doesn’t include the first attribute also fits the category.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Biconditional rule: IF 1 THEN 2; IF 2, THEN 1

A

The conditional rule applies both ways. Both attributes must be present, or both absent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

This strict rule based version

A

One task in concept identification involved rule learning: figure out the rule given attributes.
Bourne (1970) tested this using a rule learning procedure.
Findings:
- across successive problems, people get better at this task.
- on the very first trial- it takes quite a bit of time, especially biconditional relationships.

Another task: give the rule and let them discover the attributes.

  • studies show attribute learning is also affected by the rule.
  • frequency theory explains these differences as a function of exposure to the attributes.
  • different rules provide different amounts of exposure to the attributes.
  • more exposure= quicker learning.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Criticisms of logical concept identification

A

Highly artificial and not like natural categories.
Natural categories are not as clear cut:
- natural categories are characterised by typicality gradients (eg. a robin is more bird like than a penguin; RTs support this).
Natural categories are organised hierarchically.
Many natural categories are continuous.
Some categories have fuzzy boundaries.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Natural categories: as a hierarchy

A

Superordinate level:

  • highest level of abstraction.
  • consists of general categories.
  • consists of only a few defining attributes.
  • eg. furniture, bird etc).

Subordinate level:

  • lowest level of abstraction.
  • consists of specific types of objects.
  • consists of many attributes.
  • eg. end table, song-sparrow etc.

Basic level: exists in between the two extremes.

  • is a balance between informativeness (number of attributes the concept conveys) and economy (the summary of the important attributes).
  • usually acquired first by children.
  • recognised more quickly by non experts (Rosch et al, 76).
  • eg. table, sparrow etc
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Evidence that basic-level is special

A

People almost exclusively use basic-level names in free-naming tasks.
Quicker to identify basic-level category member as a member of a category.
Children learn basic-level concepts sooner than other levels.
Basic-level is much more common in adult discourse than names for superordinate categories.
Different cultures tend to use the same basic-level categories, at least for living things.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Characteristics within a category

A

Family resemblance: proposed by Wittgenstein (1953).
- continuous variable.
- measure of the overlap between members with a category.
- is measured by number of shared attributes.
Typicality:
- refers to the differences in how well members relate to their category (eg. collie vs. dachshund).
- the higher the family resemblance the more typical the item is for common taxonomic categories.
- Barsalou (1985) argues that family resemblance and typicality are not correlated for goal-derived categories (eg. make people happy when you give a birthday present).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

The defining-attribute view

A

Frege (1952) said a concept can be characterised by a set of defining attributes.
- intension: the set of attributes that define what it is to be a member of the concept (eg. bachelor- male, single, adult).
- extension: the set of entitites that are members of the concept (eg. bachelor- every bachelor).
All of the attributes must be present.
Assumes categories are clearly defined and rigid.
Defining attributes vs. characteristic attributes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Definitional approach to categorisation

A

Determine category membership based on whether the object meets the definition of the category.
Does not work well.
Not all members of everyday categories have the same defining features (eg. chairs all look very different- some have legs and arms and some don’t).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The prototype view

A

Categorisation occurs by finding the best prototype/TBD item match.
Types of prototype:
- an average of all the members (Reed’s view).
- a set of characteristic attributes.
- a specific instance of the category.
- regardless, the prototype is the most typical.
Evidence for prototypes:
- the typicality gradient is a good predictor of categorisation time.
- the most typical member is usually named first.
- children learn the typical members first.

17
Q

The prototype approach

A

Typicality effect: prototypical objects are processed preferentially.

  • prototypical category members are more affected by a priming stimulus.
  • Rosch (1975)- hearing “green” primes a highly prototypical “green”.
18
Q

The exemplar approach

A

Concept is represented by multiple examples (rather than a single prototype).
Examples are actual category members (not abstract averages).
To categorise, compare the new item to stored examples.
Similar to prototype view- representing a category is not defining it.
Different: representation is not abstract- descriptions of specific examples.
The more similar a specific exemplar is to a known category member, the faster it will be categorised.
Explains typicality effect.
Easily takes into account atypical cases.
Easily deals with variable categories.

19
Q

Prototypes or examplars?

A

May use both.
Exemplars may work best for small categories.
Prototypes may work best for larger categories.

20
Q

Semantic networks

A

Concepts are arranged in networks that represent the way concepts are organised in the mind.
Collins and Quillian (1969):
- node = category/concept.
- concepts are linked.
- model for how concept and priorities are associated in the mind.
Cognitive economy: shared properties are only stored at higher-level nodes.
Exceptions are stored at lower nodes.
Inheritance: lower-level items share properties of higher-level items.
Spreading activation:
- activation is the arousal level of a node.
- when a node is activated, activity spreads out along all connected links.
- concepts that receive activation are primed and more easily accessed from memory.

21
Q

Semantic networks: Myer and Schvaneveldt (1971)

A

“Yes” if both strings are words; “no” if not.
Some pairs were closely associated.
Reaction time was faster for those pairs- spreading activation.

Criticism of Collins & Quillian:

  • cannot explain typicality effect.
  • cognitive economy?
  • some sentence-verification results are problematic for the model.
22
Q

Semantic networks: Collins & Loftus (1975) modifications

A

Shorter links to connect closely related concepts.
Longer linkers for less closely related concepts.
No hierarchical structure; based on person’s experience.

23
Q

Assessment of semantic networkd

A

Is predictive and explanatory of some results, but not all.
Generated multiple experiments.
Lack of falsifiability:
- no rules for determining link of length or how long activation will spread.
- therefore, there is no experiment that would “prove it wrong”
- circular reasoning.

24
Q

The connectionist approach

A

“Neuron-like units”:

  • input units: activated by stimulation from environment.
  • hidden units: receive input from input units.
  • output units: receive input from hidden units.

Parallel distributed processing.
Knowledge represented in the distributed activity of many units.
Weights determine at each connection how strongly an incoming signal will activate the next unit.

How leaning occurs:

  • network responds to stimulus.
  • provided with correct response.
  • modifies responding to match correct response.

Error signal:
- difference between actual activity of each output unit and the correct activity.

Back-propagation: error signal transmitted back through the circuit.
Indicated how weights should be changed to allow the output signal to match the correct signal.
The process repeats until the error signal is zero.

Slow learning process that creates a network capable of handling a wide range of inputs.
Learning can be generalised.
Graceful degradation: disruption or performance occurs gradually as parts of the system are damaged.