ISSN 0439-755X
CN 11-1911/B
主办:中国心理学会
   中国科学院心理研究所
出版:科学出版社

心理学报 ›› 2003, Vol. 35 ›› Issue (04): 504-513.

• • 上一篇    下一篇

关系-表征复杂性模型的检验

辛自强   

  1. 北京师范大学发展心理研究所,北京100875
  • 收稿日期:2002-11-28 修回日期:1900-01-01 发布日期:2003-07-30 出版日期:2003-07-30
  • 通讯作者: 辛自强

VALIDATION OF RELATIONAL-REPRESENTATIONAL COMPLEXITY MODEL

Xin-Ziqiang   

  1. Institute of Developmental Psychology, Beijing Normal University, Beijing,China 100875
  • Received:2002-11-28 Revised:1900-01-01 Online:2003-07-30 Published:2003-07-30
  • Contact: Xin Ziqiang

摘要: 目前有关问题难度的观点多是不全面的,在综合前人研究的基础上提出了关系-表征复杂性模型。在该模型里,区分了问题难度和问题解决难度两个概念,二者的本质分别是关系复杂性和表征复杂性;关系复杂性包括水平复杂性和等级复杂性,表征复杂性相应地包括表征广度和表征深度。以172名小学高年级学生为被试,以长方形面积问题方面的三种测验收集的数据对该模型的内部和外部效度进行了检验,结果表明它能够有效解释问题(解决)难度,区分优、中、差三类学生所能达到的表征复杂性。这说明该模型有理论价值

关键词: 关系-表征复杂性模型, 问题(解决)难度, 知识基础, 内、外部检验

Abstract: At present many viewpoints on problem difficulty are partial. Based on these viewpoints a Relational-Representational Complexity Model (RRCM) was developed. In this model, two concepts of "problem difficulty" and "problem solving difficulty" were distinguished. The essence are relational complexity and representational complexity respectively. Relational complexity includes horizontal and hierarchical complexity; Representational complexity includes width and depth of representation. Test of internal and external validation of this model based on the data from 172 4~6th graders’ performance on constructing problems and judging the conditions of calculating area-of-rectangle and solving this kind of problems suggested which could interpret the order of problem (-solving) difficulty and discriminate the levels of representational complexity of excellent, normal and poor students. Indicating that this model has theoretical value

Key words: relational-representational complexity model, problem (-solving) difficulty, knowledge base, internal or external validation

中图分类号: