Abstract

This article is an overview of the SP theory of intelligence, which aims to simplify and integrate concepts across artificial intelligence, mainstream computing and human perception and cognition, with information compression as a unifying theme. It is conceived of as a brain-like system that receives "New" information and stores some or all of it in compressed form as "Old" information; and it is realised in the form of a computer model, a first version of the SP machine. The matching and unification of patterns and the concept of multiple alignment are central ideas. Using heuristic techniques, the system builds multiple alignments that are "good" in terms of information compression. For each multiple alignment, probabilities may be calculated for associated inferences. Unsupervised learning is done by deriving new structures from partial matches between patterns and via heuristic search for sets of structures that are "good" in terms of information compression. These are normally ones that people judge to be "natural", in accordance with the "DONSVIC" principle—the discovery of natural structures via information compression. The SP theory provides an interpretation for concepts and phenomena in several other areas, including "computing", aspects of mathematics and logic, the representation of knowledge, natural language processing, pattern recognition, several kinds of reasoning, information storage and retrieval, planning and problem solving, information compression, neuroscience and human perception and cognition. Examples include the parsing and production of language with discontinuous dependencies in syntax, pattern recognition at multiple levels of abstraction and its integration with part-whole relations, nonmonotonic reasoning and reasoning with default values, reasoning in Bayesian networks, including "explaining away", causal diagnosis, and the solving of a geometric analogy problem.

Highlights

  • The SP theory of intelligence, which has been under development since about 1987 [1], aims to simplify and integrate concepts across artificial intelligence, mainstream computing and human perception and cognition, with information compression as a unifying theme

  • The key differences between the SP theory and earlier theories of computing are that the SP theory has a lot more to say about the nature of intelligence than earlier theories, that the theory is founded on principles of information compression via the matching and unification of patterns (“computing as compression”), and that it includes mechanisms for building multiple alignments and for heuristic search that are not present in earlier models

  • The SP framework provides a means of planning a route between two places, and, with the translation of geometric patterns into textual form, it can solve the kind of geometric analogy problem that may be seen in some puzzle books and IQ tests (BK, Chapter 8)

Read more

Summary

Introduction

The SP theory of intelligence, which has been under development since about 1987 [1], aims to simplify and integrate concepts across artificial intelligence, mainstream computing and human perception and cognition, with information compression as a unifying theme. As it has developed, have been described in several peer-reviewed articles [2]. The most comprehensive description of the theory as it stands with many examples, is in [3]. With more than 450 pages, is too long to serve as an introduction to the theory. This article aims to meet that need, with a fairly full description of the theory and a selection of examples [4]. The section describes the origins and motivation for the SP theory.

Information Compression
The Matching and Unification of Patterns
Simplification and Integration of Concepts
Transparency in the Representation of Knowledge
Development of the Theory
Introduction to the SP Theory
The SP Computer Model
The SP Machine
Unfinished Business
The Multiple Alignment Concept
Coding and the Evaluation of an Alignment in Terms of Compression
Compression Difference and Compression Ratio
The Building of Multiple Alignments
Finding Good Matches between Patterns
Noisy Data
Computational Complexity
Calculation of Probabilities Associated with Multiple Alignments
Absolute Probabilities
Relative Probabilities
Relative Probabilities of Patterns and Symbols
One System for Both the Analysis and the Production of Information
Unsupervised Learning
Outline of Unsupervised Learning in the SP Model
Deriving Old Patterns from Multiple Alignments
Evaluating and Selecting Sets of Newly-Created Old Patterns
Limitations in the SP Model and How They May Be Overcome
One-Trial Learning and Its Implications
Conventional Computing Systems
Mathematics and Logic
Computing and Probabilities
Representation of Knowledge
Natural Language Processing
Discontinuous Dependencies in Syntax
Two Quasi-Independent Patterns of Constraint in English Auxiliary Verbs
Multiple Alignments and English Auxiliary Verbs
Pattern Recognition
Inference and Inheritance
10. Probabilistic Reasoning
10.1. Nonmonotonic Reasoning and Reasoning with Default Values
10.2.1. Representing Contingencies with Patterns and Frequencies
10.2.2. Approximating the Temporal Order of Events
10.2.3. Other Considerations
10.2.4. Formation of Alignments
10.3. Formation of Alignments
10.3.1. Other Possibilities
10.4. The SP framework and Bayesian Networks
10.5. Causal Diagnosis
10.6. An SP Approach to Causal Diagnosis
10.7. Multiple Alignments in Causal Diagnosis
11. Information Storage and Retrieval
12. Planning and Problem Solving
13. Compression of Information
Findings
15. Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.