Equivalence Classes Ps625 Concept Formation Dr. Ken Reeve Caldwell College Grad ABA Programs.

Slides:



Advertisements
Similar presentations
Chapter 1 Review In Algebra, we use symbols to stand for various numbers. One type of symbol used is a variable. An expression that contains at least one.
Advertisements

Rules of Matrix Arithmetic
Deductive Reasoning, 2-3 9/1/02 …\sec2_3.ppt.
Equivalence: Connecting Concepts in Networks Efficiently Daniel C. DeRosa Behavior Analysis.
Developing Stimulus Control. Peak Shift Phenomena where the peak of the generalization curve shifts AWAY from the S- – Means that the most responding.
Math for Elementary Teachers
CSE115/ENGR160 Discrete Mathematics 05/03/11 Ming-Hsuan Yang UC Merced 1.
Stimulus Control Advanced Applied Behavior Analysis
1 Chapter 2 – Methods for Changing Target Behaviors Ps534 Dr. Ken Reeve Caldwell College Post-Bac Program in ABA.
Stimulus Control and Language. Why is Understanding Stimulus Control so Important in Teaching Children with Autism? “Because the aim of virtually all.
Chapter 5: Learning and Behavior Presented by: Heather Hays.
1 Probability Parts of life are uncertain. Using notions of probability provide a way to deal with the uncertainty.
Learning Complex Concepts II Attributes The following notation system is used to represent the structure of concepts. Notation Rules These are represented.
1 Chapters 10 & 11 (Richards text) CHANGING CRITERION Designs in Single-Subject Research Ps534 Dr. Ken Reeve Caldwell College Graduate Programs in ABA.
Stimulus Control.
1 Chapter 3 – Methods for Recording Target Behaviors Ps534 Dr. Ken Reeve Caldwell College Post-Bac Program in ABA.
Identity and Equality Properties. Properties refer to rules that indicate a standard procedure or method to be followed. A proof is a demonstration of.
2.1 The Addition Property of Equality
Relations Chapter 9.
Stimulus Control Chapter 17.
Stimulus Control.
Doing the Right Thing at the Right Time and Place: Stimulus Discrimination and Generalization Chapter 8.
Antecedent Control Procedures
College Algebra Prerequisite Topics Review
Derived Relational Responding and Horse Track Betting Seth W. Whiting Mark R. Dixon.
Developing New Behavior Week 9. Non Contingent Reinforcement Potency (e.g. amount/quality) of “R+” Include Extinction Vary “Reinforcement”
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 20 By Herbert I. Gross and Richard A. Medeiros next.
Complex Numbers MATH 018 Combined Algebra S. Rook.
Basic Concepts of Algebra
Copyright © 2010 Pearson Education, Inc
Research Methods in Psychology
SOLVING INEQUALITIES Chapter 3. Introduction In this chapter we will extend the skills learned in the previous chapter for solving equalities to inequalities.
Math 002 College Algebra Final Exam Review.
Behavior Intervention Prompting and Prompt Fading: Teaching Children with Autism 1 This software is licensed under the BC Commons LicenseBC Commons License.
Cognitive Development Chapter 7 Novak and Pelaez.
Classical & Operant Conditioning. 1.Classical Conditioning A.Pavlov's Conditioning Experiments Experiment on salivation turns into research on learning.
1 10 Essential Rules for Teaching Concepts to Children With Autism Sharon A. Reeve, Ph.D., BCBA Kenneth F. Reeve, Ph.D., BCBA January 16, 2009 Presented.
Whole numbers and numeration Math 123 September 17-19, 2008.
Graduate Programs in ABA
Cognitive Development. 2 CONSTRUCTIVISM A view of learning + development that emphasizes active role of learner in “building” understanding + making sense.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
1 ABA 635 Concept Formation Caldwell College Applied Behavior Analysis Dr. Ken Reeve.
Inequalities Section 10.2 Solving Inequalities. Property of Comparison For all real numbers a and b, one and only one of the following must be true: a
Chapter 3 Identifying, Developing, and Managing Operant Antecedents.
Perceptual Classes (Concepts; Categories) ABA 635 Concept Formation Dr. Ken Reeve Caldwell College Grad ABA Programs.
Discrimination & Complex Stimulus Control Chs12 & 13.
Conferina Naională de Analiză Aplicată a Comportamentului (ABA), Ediia a III-a Conditional Discrimination Procedures: Understanding to Application Conferina.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 17 part 2 By Herbert I. Gross and Richard A. Medeiros next.
Classical Conditioning.  Consists of repeated trials in which the CS and US are paired and the CR gradually develops  Most efficient conditioning occurs.
Copyright © 2011 Pearson Education, Inc. All rights reserved.
Advanced ABA for Teachers ED 556. Today… Quiz Article Presentation by Lauren Questions about course requirements PsychINFO assignment questions Review:
Chapter 7 Stimulus Control.
PSY 402 Theories of Learning Chapter 8 – Stimulus Control How Stimuli Guide Instrumental Action.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Mathematical Foundations of Computer Science Chapter 3: Regular Languages and Regular Grammars.
§R1∪R2§R1∪R2 §R 1 ∩R 2 R1-R2R1-R2 2.4 Operations on Relations.
Stimulus Control Justin Daigle, MA, BCBA, LBA. Review of Terms Antecedent – Any event that occurs directly before a target behavior - Could be a MO -
Stimulus Control Justin Daigle, BCBA, LBA. Stimulus “An energy change that affects an organism through is receptor cells” (Michael, 2004, p.7) Note: Stimulus.
MATRICES. Introduction Matrix algebra has several uses in economics as well as other fields of study. One important application of Matrices is that it.
Complex Numbers and Equation Solving 1. Simple Equations 2. Compound Equations 3. Systems of Equations 4. Quadratic Equations 5. Determining Quadratic.
Week 1 Real Numbers and Their Properties (Section 1.6, 1.7, 1.8)
Seminar 4 Applied Behavior Analysis I PS 360 Israel A. Sarasti, Ph.D.
Cognitive Development
Identity and Equality Properties
2.4 Sequences and Summations
2. Definition of congruent segments AB = CD 2.
Stimulus Control.
Properties of Equality
Presentation transcript:

Equivalence Classes Ps625 Concept Formation Dr. Ken Reeve Caldwell College Grad ABA Programs

Definition a finite group of physically disparate stimuli (no perceptual similarity) a finite group of physically disparate stimuli (no perceptual similarity) stimuli become related as a function of training (Fields, Adams, Buffington, Yang, & Verhave, 1996; Fields & Verhave, 1987; Sidman & Tailby, 1982; Sidman, 1990) stimuli become related as a function of training (Fields, Adams, Buffington, Yang, & Verhave, 1996; Fields & Verhave, 1987; Sidman & Tailby, 1982; Sidman, 1990) An equivalence class must contain at least three stimuli An equivalence class must contain at least three stimuli To establish a class of N stimuli, N-1 stimulus- stimulus relations are trained such that each stimulus in the potential class is used in at least one relation To establish a class of N stimuli, N-1 stimulus- stimulus relations are trained such that each stimulus in the potential class is used in at least one relation

Example Written word DOG Written word DOG The spoken word “DOG” The spoken word “DOG” A picture of a dog A picture of a dog DOG

Another Example Written word CAT Written word CAT The spoken word “CAT” The spoken word “CAT” A picture of a cat A picture of a cat CAT

Training & Testing Procedures Usually with conditional discrimination or match- to-sample (but other methods will also be discussed) Usually with conditional discrimination or match- to-sample (but other methods will also be discussed) Symbolic notation is often used to outline training/testing procedures: Symbolic notation is often used to outline training/testing procedures: A, B, C, …N represent each of the disparate stimuli that will make up the class A, B, C, …N represent each of the disparate stimuli that will make up the class 1, 2, 3, etc. notate the number of classes to be established 1, 2, 3, etc. notate the number of classes to be established Thus, A1 = first stimulus in class 1; B3 = third stimulus in class 2; etc. Thus, A1 = first stimulus in class 1; B3 = third stimulus in class 2; etc.

Training & Testing Procedures To establish equivalence classes, at least two potential classes must be trained concurrently To establish equivalence classes, at least two potential classes must be trained concurrently training establishes both substitutability of all stimuli within a particular equivalence class in addition to discrimination between classes training establishes both substitutability of all stimuli within a particular equivalence class in addition to discrimination between classes

Training & Testing Procedures To establish equivalence classes with three members, at least two relations must be trained for each potential class (remember the N-1 rule) To establish equivalence classes with three members, at least two relations must be trained for each potential class (remember the N-1 rule) Let’s consider our DOG and CAT potential equivalence classes Let’s consider our DOG and CAT potential equivalence classes First train the AB relation (given stimulus A select stimulus B) First train the AB relation (given stimulus A select stimulus B) the word DOG (A1) is presented as a sample the word DOG (A1) is presented as a sample The positive comparison (Co+) would be the spoken word dog (B1) (Selection would result in positive feedback or reinforcement) The positive comparison (Co+) would be the spoken word dog (B1) (Selection would result in positive feedback or reinforcement) the negative comparison (Co-) would be the spoken word cat (B2) (Selection would result in corrective feedback or extinction) the negative comparison (Co-) would be the spoken word cat (B2) (Selection would result in corrective feedback or extinction)

DOG CAT Training AB relation A1 B2 B1

Training & Testing Procedures In addition, to train the AB relation In addition, to train the AB relation the word CAT (A2) is presented as a sample the word CAT (A2) is presented as a sample The positive comparison (Co+) would be the spoken word cat (B2) (Selection would result in positive feedback or reinforcement) The positive comparison (Co+) would be the spoken word cat (B2) (Selection would result in positive feedback or reinforcement) the negative comparison (Co-) would be the spoken word dog (B2) (Selection would result in corrective feedback or extinction) the negative comparison (Co-) would be the spoken word dog (B2) (Selection would result in corrective feedback or extinction)

Training AB relation CAT DOGCAT A2 B2 B1

Training & Testing Procedures Once responding is 100% correct, we can conclude that the learner has formed the AB conditional relation Once responding is 100% correct, we can conclude that the learner has formed the AB conditional relation also demonstrates that learner can discriminate between the two different “A” stimuli, the two different “B” stimuli, and the A stimuli from the B stimuli also demonstrates that learner can discriminate between the two different “A” stimuli, the two different “B” stimuli, and the A stimuli from the B stimuli At this point we can either continue training more conditional discriminations or we can do our first test for an EMERGENT (DERIVED) RELATION (a conditional discrimination that emerges with no direct training history) At this point we can either continue training more conditional discriminations or we can do our first test for an EMERGENT (DERIVED) RELATION (a conditional discrimination that emerges with no direct training history) If the learner “knows” that A goes with B, can they demonstrate the reverse? (B goes with A) If the learner “knows” that A goes with B, can they demonstrate the reverse? (B goes with A) This emergent relation shows SYMMETRY This emergent relation shows SYMMETRY

TESTING BA symmetry relation CAT B2 A2 A1 DOG

TESTING BA symmetry relation CAT DOG B1 A2 A1 DOG

Training & Testing Procedures If BA TESTING is 100% correct, we can conclude that the learner has formed the BA conditional symmetry relation with no direct training If BA TESTING is 100% correct, we can conclude that the learner has formed the BA conditional symmetry relation with no direct training It is called “symmetry” because the relation is a mirror image or reversal of the one directly trained It is called “symmetry” because the relation is a mirror image or reversal of the one directly trained At this point, we can continue training more conditional discriminations At this point, we can continue training more conditional discriminations Let’s train the BC conditional relation Let’s train the BC conditional relation

Training BC relation DOG B1 C2C1

Training BC relation CAT B2 C2C1

Training & Testing Procedures Once responding is 100% correct, we can conclude that the learner has formed the BC conditional relation Once responding is 100% correct, we can conclude that the learner has formed the BC conditional relation Now we can either continue training more conditional discriminations or we can do our 2 nd test for an EMERGENT (DERIVED) RELATION Now we can either continue training more conditional discriminations or we can do our 2 nd test for an EMERGENT (DERIVED) RELATION If the learner “knows” that B goes with C, can they demonstrate the reverse? (C goes with B) If the learner “knows” that B goes with C, can they demonstrate the reverse? (C goes with B) This emergent relation would show a SECOND SYMMETRY relation This emergent relation would show a SECOND SYMMETRY relation

TESTING CB symmetry relation DOG C1 B1B2 CAT

TESTING CB symmetry relation DOG C2 B1B2 CAT

Training & Testing Procedures If TEST responding is 100% correct, we can conclude that the learner has formed the CB symmetry conditional relation If TEST responding is 100% correct, we can conclude that the learner has formed the CB symmetry conditional relation At this point, we have trained our N-1 relations (3 members subtract 1 equals 2!) At this point, we have trained our N-1 relations (3 members subtract 1 equals 2!) Now we can continue testing for another EMERGENT (DERIVED) RELATION Now we can continue testing for another EMERGENT (DERIVED) RELATION If the learner “knows” that A goes with B, and B goes with C, can they demonstrate that A goes with C? If the learner “knows” that A goes with B, and B goes with C, can they demonstrate that A goes with C? This emergent relation would show a TRANSITIVE relation This emergent relation would show a TRANSITIVE relation

TESTING AC transitive relation A1 C2C1 DOG

TESTING AC transitive relation A2 C2C1 CAT

Training & Testing Procedures If TEST responding is 100% correct, we can conclude that the learner has formed the AC transitive conditional relation If TEST responding is 100% correct, we can conclude that the learner has formed the AC transitive conditional relation We have one last test for another EMERGENT (DERIVED) RELATION We have one last test for another EMERGENT (DERIVED) RELATION If the learner “knows” that A goes with B, and B goes with C, can they demonstrate that C goes with A? If the learner “knows” that A goes with B, and B goes with C, can they demonstrate that C goes with A? This emergent relation would shows a combination of symmetry and transitivity; it is called an EQUIVALENCE relation This emergent relation would shows a combination of symmetry and transitivity; it is called an EQUIVALENCE relation

TESTING CA equivalence relation A1 A2 C1 CAT DOG

TESTING CA equivalence relation A1 A2 C2 CAT DOG

Training & Testing Summary If TEST responding is 100% correct, we can conclude that the learner has formed two equivalence classes (one for dogs and one for cats) If TEST responding is 100% correct, we can conclude that the learner has formed two equivalence classes (one for dogs and one for cats) We TRAINED 2 relations: We TRAINED 2 relations: A  B A  B B  C B  C We TESTED 4 EMERGENT (DERIVED) relations: We TESTED 4 EMERGENT (DERIVED) relations: B  A symmetry B  A symmetry C  B symmetry C  B symmetry A  C transitivity A  C transitivity C  A equivalence C  A equivalence Another set of tests for REFLEXIVITY (IDENTITY) is usually omitted unless the learner is less skilled: Another set of tests for REFLEXIVITY (IDENTITY) is usually omitted unless the learner is less skilled: A  A A  A B  B B  B C  C C  C

Training & Testing Summary Now each member of each class occasions the selection of all the other members of the class Now each member of each class occasions the selection of all the other members of the class This occurs for all combinations even though we only directly trained a subset of all possible relations This occurs for all combinations even though we only directly trained a subset of all possible relations

Equivalence Class Expansions Once we have 3-member equivalence classes, we can continue to expand them in a number of ways Once we have 3-member equivalence classes, we can continue to expand them in a number of ways One way is by training additional conditional relations and testing for additional emergent conditional relations One way is by training additional conditional relations and testing for additional emergent conditional relations For example, train the relation CD in which stimulus D is the Spanish word PERRO for the dog class and GATO for the cat class For example, train the relation CD in which stimulus D is the Spanish word PERRO for the dog class and GATO for the cat class

Training CD relation D1 D2 C2 GATO PERRO

Training CD relation D1 D2 C1 GATO PERRO

Training & Testing Summary Then we would test for all possible new emergent relations Then we would test for all possible new emergent relations D  C symmetry D  C symmetry A  D transitivity A  D transitivity B  D transitivity B  D transitivity D  A equivalence D  A equivalence D  B equivalence D  B equivalence If test results are 100%, then we can now conclude that we have two 4-member equivalence classes If test results are 100%, then we can now conclude that we have two 4-member equivalence classes And so on… And so on…

More Equivalence Class Expansions Once we have equivalence classes, we can also expand them by using them as “transfer networks” Once we have equivalence classes, we can also expand them by using them as “transfer networks” This means that we train an operant response (different from the previous selection response) in the presence of only 1 member of each equivalence class This means that we train an operant response (different from the previous selection response) in the presence of only 1 member of each equivalence class For example, train a child to say WOOF in the presence of A1 and MEOW in the presence of A2 For example, train a child to say WOOF in the presence of A1 and MEOW in the presence of A2

DOG WOOF! Training response transfer A1

MEOW! Training response transfer A2 CAT

More Equivalence Class Expansions If we now present stimuli B, C, or D, the child should also say WOOF (in the presence of the dog class members) and MEOW (in the presence of the cat class members) If we now present stimuli B, C, or D, the child should also say WOOF (in the presence of the dog class members) and MEOW (in the presence of the cat class members) This should occur without direct training This should occur without direct training As such, it demonstrates another type of emergent behavior As such, it demonstrates another type of emergent behavior

MEOW! TESTING response transfer GATO CAT

WOOF! TESTING response transfer PERRO DOG

And…um, victory is mine!

More Equivalence Class Expansions Once we have equivalence classes, we can also expand them by testing to see whether physical variations (“variants”) of each equivalence class member will still occasion selection of all other members Once we have equivalence classes, we can also expand them by testing to see whether physical variations (“variants”) of each equivalence class member will still occasion selection of all other members For example, what if we present emergent relations in which the dog or cat picture used in training (stimulus C1 and C2) is substituted with DIFFERENT pictures? (notated as C’1 or C’2) For example, what if we present emergent relations in which the dog or cat picture used in training (stimulus C1 and C2) is substituted with DIFFERENT pictures? (notated as C’1 or C’2) Will these “variants” still occasion class- consistent responding? Will these “variants” still occasion class- consistent responding?

TESTING C’A “generalized” equivalence relation A1 A2 C’2 CAT DOG

A1 A2 C’2 CAT DOG TESTING C’A “generalized” equivalence relation

A1 A2 C’2 CAT DOG TESTING C’A “generalized” equivalence relation

A1 A2 C’2 CAT DOG TESTING C’A “generalized” equivalence relation

Generalized Equivalence Class Note that many cat pictures occasion selection of the other members of the equivalence class Note that many cat pictures occasion selection of the other members of the equivalence class Thus, the class-consistent selections made by the learner have generalized to variants of one member of the equivalence class Thus, the class-consistent selections made by the learner have generalized to variants of one member of the equivalence class So we call this a “generalized equivalence class” So we call this a “generalized equivalence class” It is actually a merger of an equivalence class with a perceptual class… It is actually a merger of an equivalence class with a perceptual class…

CAT One equivalence class + one linked perceptual class = CAT GATO

CAT Generalized equivalence class CAT GATO

Generalized Equivalence Class We can also present variants of EACH equivalence class member to see if they occasion selection of the other members of the equivalence class We can also present variants of EACH equivalence class member to see if they occasion selection of the other members of the equivalence class This would produce an even larger generalized equivalence class This would produce an even larger generalized equivalence class It would be a merger of an equivalence class with perceptual classes linked to each equivalence class member… It would be a merger of an equivalence class with perceptual classes linked to each equivalence class member…

CAT Generalized equivalence class (expanded further) CAT GATO CAT

Training Structures for Equivalence Class Refers to how the training relations and derived relations are “situated” relative to one another Refers to how the training relations and derived relations are “situated” relative to one another Can affect likelihood of class formation Can affect likelihood of class formation See next See next

Linear Training Structure A  B B  C C  D

One-to-Many Training Structure A  B  C  D

Many-to-One Training Structure B  A C  D 

Training/Testing Variations This refers to when you train and test for various conditional relations This refers to when you train and test for various conditional relations See next… See next…

Simultaneous Procedure First, train ALL training relations in one trial block until you reach criterion First, train ALL training relations in one trial block until you reach criterion Then, test ALL derived (emergent) relations in another trial block Then, test ALL derived (emergent) relations in another trial block This procedure tends to produce poor performance This procedure tends to produce poor performance

Simple-to-Complex Procedure First, train only 1 relation to criterion in a trial block (e.g., A  B) First, train only 1 relation to criterion in a trial block (e.g., A  B) Then, test the “simplest” derived (emergent) relation in another trial block (e.g., B  A) Then, test the “simplest” derived (emergent) relation in another trial block (e.g., B  A) Then, train the next 1 relation to criterion in a trial block (e.g., B  C) Then, train the next 1 relation to criterion in a trial block (e.g., B  C) Then, test the next “simplest” derived (emergent) relation in another trial block (e.g., C  B) Then, test the next “simplest” derived (emergent) relation in another trial block (e.g., C  B) Followed by A  C testing Followed by A  C testing Followed by C  A testing Followed by C  A testing