Advertisement

Granular Computing and Computational Complexity

  • Bo Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6401)

Abstract

Granular computing is to imitate human’s multi-granular computing strategy to problem solving in order to endow computers with the same capability. Its final goal is to reduce the computational complexity. To the end, based on the simplicity principle the problem at hand should be represented as simpler as possible. From structural information theory, it’s known that if a problem is represented at different granularities, the hierarchical description of the problem will be a simpler one. The simpler the representation the lower the computational complexity of problem solving should be. We presented a quotient space theory to multi-granular computing. Based on the theory a problem represented by quotient spaces will have a hierarchical structure. Therefore, the quotient space based multi-granular computing can reduce the computational complexity in problem solving. In the talk, we’ll discuss how the hierarchical representation can reduce the computational complexity in problem solving by using some examples.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Bo Zhang
    • 1
  1. 1.Computer Science and Technology Department of Tsinghua UniversityChina

Personalised recommendations