2 Opposition - Based Computing

نویسندگان

  • Shahryar Rahnamayan
  • S. Rahnamayan
چکیده

Diverse forms of opposition are already existent virtually everywhere around us but the nature and significance of oppositeness is well understood only in specific contexts within the fields of philosophy, linguistics, psychology, logic and physics. The interplay between entities and opposite entities is apparently fundamental for maintaining universal balance. However, it seems that there is a gap regarding oppositional thinking in engineering, mathematics and computer science. Although many opposition-based techniques exist in these fields, the oppositional properties they employ are not usually directly studied. A better understanding of opposition could potentially establish new search, reasoning, optimization and learning schemes with a wide range of applications. For instance, improving convergence rate for hyperdimensional problems could be improved through the use of oppositional strategies. A large number of problems in engineering and science cannot be approached with conventional schemes and are generally handled with intelligent techniques such as evolutionary, neural, reinforcing and swarm-based techniques. These methodologies, however, suffer from high computational costs. In this work, the outlines of opposition-based computing, a proposed framework for computational intelligence, will be introduced. The underlying idea is simultaneous consideration of guess and opposite guess, estimate and opposite estimate, viewpoint and opposite viewpoint and so on in order to make better decisions in a shorter time, something that all aforementioned techniques could benefit from. The goal is to better understand the role of opposition within a computational intelligence context with the intention of improving existing or developing more powerful and robust approaches to handle complex problems. Due to its diversity, it is difficult, if not impossible, to uniquely and universally define the nature and the scope of what we call opposition. However, there is no doubt that we need a mathematical formalism if we are going to, at least to some degree, exploit the oppositional relationships in real-world systems. Hence, we attempt to establish a generic framework for computing with opposites in this chapter, a framework which may not mathematically capture the very essence of oppositeness in all systems accurately but it will be, as we hope, a point of departure for moving toward opposition-based computing. The ideas put forward in this chapter may not be shared by all those who work on some aspect of opposition (and usually without labeling it opposition), nevertheless, we believe that this framework can be useful for understanding and employing opposition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STATIC AND DYNAMIC OPPOSITION-BASED LEARNING FOR COLLIDING BODIES OPTIMIZATION

Opposition-based learning was first introduced as a solution for machine learning; however, it is being extended to other artificial intelligence and soft computing fields including meta-heuristic optimization. It not only utilizes an estimate of a solution but also enters its counter-part information into the search process. The present work applies such an approach to Colliding Bodies Optimiz...

متن کامل

An intuitive distance-based explanation of opposition-based sampling

The impact of the opposition concept can be observed in many areas around us. This concept has sometimes been called by different names, such as, opposite particles in physics, complement of an event in probability, absolute or relative complement in set theory, and theses and antitheses in dialectic. Recently, opposition-based learning (OBL) was proposed and has been utilized in different soft...

متن کامل

Centroid Opposition-Based Differential Evolution

The capabilities of evolutionary algorithms (EAs) in solving nonlinear and non-convex optimization problems are significant. Differential evolution (DE) is an effective population-based EA, which has emerged as very competitive. Since its inception in 1995, multiple variants of DE have been proposed with higher performance. Among these DE variants, opposition-based differential evolution (ODE) ...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

Elite Opposition-Based Social Spider Optimization Algorithm for Global Function Optimization

Abstract: The Social Spider Optimization algorithm (SSO) is a novel metaheuristic optimization algorithm. To enhance the convergence speed and computational accuracy of the algorithm, in this paper, an elite opposition-based Social Spider Optimization algorithm (EOSSO) is proposed; we use an elite opposition-based learning strategy to enhance the convergence speed and computational accuracy of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008