Complexity in Analogy Tasks: An Analysis and Computational Model

被引:4
|
作者
Stahl, Philip [1 ]
Ragni, Marco [1 ]
机构
[1] Univ Freiburg, Freiburg, Germany
关键词
D O I
10.3233/978-1-60750-606-5-1041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this article, we introduce a complexity measure for matrix tasks which occur in IQ-tests with respect to the kind of functions necessary to solve such tasks. The aim is to capture human reasoning difficulty. We implemented a program which is able to solve matrix tasks and to evaluate their complexity by our measure. The results of the evaluation are compared with the empirical difficulty ranking from Cattell's Culture Fair Test.
引用
收藏
页码:1041 / 1042
页数:2
相关论文
共 50 条
  • [21] Computational Complexity and an Integer Programming Model of Shakashaka
    Demaine, Erik D.
    Okamoto, Yoshio
    Uehara, Ryuhei
    Uno, Yushi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (06): : 1213 - 1219
  • [22] Computational Model for Measuring Project Complexity in Construction
    Nguyen, Long D.
    Tran, Dai Q.
    Nguyen, An T.
    Long Le-Hoai
    2016 ANNUAL CONFERENCE OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY (NAFIPS), 2016,
  • [23] Model Interpretability through the Lens of Computational Complexity
    Barcelo, Pablo
    Monet, Mikael
    Perez, Jorge
    Subercaseaux, Bernardo
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [24] Computational Complexity of Avalanches in the Kadanoff Sandpile Model
    Formenti, Enrico
    Goles, Eric
    Martin, Bruno
    FUNDAMENTA INFORMATICAE, 2012, 115 (01) : 107 - 124
  • [25] THE INFLUENCE OF IMPULSIVITY ON THE SOLUTION OF ANALOGY TASKS
    HOLZLI, J
    ZEITSCHRIFT FUR PSYCHOLOGIE, 1983, 191 (03): : 271 - 281
  • [26] Computational complexity reduction of the support vector machine classifiers for image analysis tasks through the use of the discrete cosine transform
    Gordan, M.
    Georgakis, A.
    Tsatos, O.
    Oltean, G.
    Miclea, L.
    2006 IEEE-TTTC INTERNATIONAL CONFERENCE ON AUTOMATION, QUALITY AND TESTING, ROBOTICS, VOL 2, PROCEEDINGS, 2006, : 350 - 355
  • [27] ANALOGY MODEL AND ANALOGY CORRESPONDENCE
    伊波
    徐家福
    ScienceinChina,SerA., 1992, Ser.A.1992 (03) : 374 - 384
  • [28] Revolving Codes: Overhead and Computational Complexity Analysis
    Yazdani, Niloofar
    Lucani, Daniel E.
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (02) : 374 - 378
  • [29] On the computational complexity of cost efficiency analysis models
    Jahanshahloo, G. R.
    Soleimani-damaneh, M.
    Mostafaee, A.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) : 638 - 640
  • [30] On the complexity of fundamental computational problems in pedigree analysis
    Piccolboni, A
    Gusfield, D
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2003, 10 (05) : 763 - 773