COMPUTATIONAL INTELLIGENCE

Sibarama Panigrahi

What is CI

Computational Intelligence (CI) is a successor of artificial intelligence. Computational intelligence is a branch of computer science studying problems for which there are no effective computational algorithms.

CI Paradigm

Neural networks are based on their biological counterparts in the human nervous system. Evolutionary computing draws heavily on the principles of Darwinian evolution observed in nature. Swarm intelligence, in turn, is modeled on the social behavior of insects and the choreography of birds flocking. Finally, human reasoning using imprecise, or fuzzy, linguistic terms is approximated by fuzzy systems.

Primary Classes of Problems for CI Techniques

The major classes of problems in CI are grouped into five categories as

1. 2.

3.
4. 5.

Optimization Problems NP Complete Problems Classification Problems Regression Problems Control Problems

1. Optimization Problems

An optimization problem can be represented in the following way Given: A function f : A R from some set A to the real numbers Sought: An element x0 in A such that

f(x0) f(x) for all x in A (minimization) or such that f(x0) f(x) for all x in A (maximization).

Several real life and theoretical problems perhaps may be modeled in this comprehensive framework.
e.g. Energy Minimization

2. NP-Complete Problems

Non-Deterministic Polynomial Time (NP) problems are one of the most common underlying complexity assorts In computational theory. Intuitively, NP contains all determination problems for which the solutions have mere proofs of the fact that the answer is indeed yes. More precisely, these validations have to be confirmable in polynomial time by a deterministic Turing machine. In an equivalent elegant definition, NP is the set of determination problems solvable in polynomial time by a non-deterministic Turing machine. The complexity class P is contained in NP, but NP contains many important problems, called NP-complete problems, for which no polynomial-time algorithms are known. The most important open question in complexity theory, the P = NP problem, asks whether such algorithms actually exist for NP-complete problems. It is widely believed that this is not the case. Several biological computer science problems are covered by the class NP. In specific, the decision versions of many interesting search problems and optimization problems are contained in NP.

2. NP-Complete Problems
Verifier-Based Definition
e.g. subset sum problem: Assume that we are given some integers, such as 7, 3, 2, 5, 8, and we wish to know whether some of these integers sum up to zero. In this example, the answer is yes, since the subset of integers 3, 2, 5 corresponds to the sum (3) + (2) + 5 = 0. Note: It is an exponential time solvable problem(since A set contains 2n elements) The verifier-based definition of NP does not require an easy-to-verify certificate for the no-answers. The class of problems with such certificates for the noanswers is called co-NP. In fact, it is an open question whether all problems in NP also have certificates for the no-answers and thus are in co-NP.

NPC

Machine Definition NP is the set of decision problems solvable in polynomial time by a non-deterministic Turing machine. e.g. Integer factorization problem Graph isomorphism problem Traveling salesman problem Boolean satisfiability problem