• Login
    View Item 
    •   SMARTech Home
    • Georgia Tech Theses and Dissertations
    • Georgia Tech Theses and Dissertations
    • View Item
    •   SMARTech Home
    • Georgia Tech Theses and Dissertations
    • Georgia Tech Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A computational model for solving raven’s progressive matrices intelligence test

    Thumbnail
    View/Open
    SHEGHEVA-THESIS-2018.pdf (654.3Kb)
    Date
    2018-05-11
    Author
    Shegheva, Snejana
    Metadata
    Show full item record
    Abstract
    Graphical models offer techniques for capturing the structure of many problems in real- world domains and provide means for representation, interpretation, and inference. The modeling framework provides tools for discovering rules for solving problems by exploring structural relationships. We present the Structural Affinity method that uses graphical models for first learning and subsequently recognizing the pattern for solving problems on the Raven’s Progressive Matrices Test of general human intelligence. Recently there has been considerable work on computational models of addressing the Raven’s test using various representations ranging from fractals to symbolic structures. In contrast, our method uses Markov Random Fields parameterized by affinity factors to discover the structure in the geometric problems and induce the rules of Carpenter et al.’s cognitive model of problem-solving on the Raven’s Progressive Matrices Test. We provide a computational account that first learns the structure of Raven’s problem and then predicts the solution by computing the probability of the correct answer by recognizing patterns corresponding to Carpenter et al.’s rules. We demonstrate that the performance of our model on the Standard Raven Progressive Matrices is comparable with existing state of the art models. In this report, we raise and attempt to address research questions about the knowledge representation that provides a sufficient opportunity to capture a pattern in geometrical intelligence tests such as Raven Progressive Matrices. We show how a minimal representation facilitates pattern extraction process by proposing a method for organizing the representational units using the framework of probabilistic graphical models. By orchestrating techniques from mathematics, data science and computer science, we design an agent that can explain its responses while still predicting accurate solutions. And finally, we discuss the key takeaways about knowledge representation, structure discoveries, heuristic reasoning, and a possible connection to the cognitive thinking process.
    URI
    http://hdl.handle.net/1853/60191
    Collections
    • College of Computing Theses and Dissertations [1071]
    • Georgia Tech Theses and Dissertations [22401]
    • School of Computer Science Theses and Dissertations [79]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology