Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 155))

Summary

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The American Heritage Dictionary of the English Language. Houghton Mifflin (2000)

    Google Scholar 

  2. Carlin, B.P., Louis, T.A., Carlin, B.: Bayes and Empirical Bayes Methods for Data Analysis. Chapman and Hall/CRC, Boca Raton (2000)

    MATH  Google Scholar 

  3. Cervellera, C., Muselli, M.: Deterministic Design for Neural Network Learning: An Approach based on Discrepancy. IEEE Transactions on Neural Networks 15(3), 533–544 (2004)

    Article  Google Scholar 

  4. Chapra, S.C., Canale, R.P.: Numerical Methods for Engineers. McGraw-Hill Education, New York (2005)

    Google Scholar 

  5. Cheng, V., Li, C.H., Kwok, J.T., Li, C.K.: Dissimilarity learning for nominal data. Pattern Recognition 37(7), 1471–1477 (2004)

    Article  Google Scholar 

  6. Jordanov, I., Brown, R.: Neural Network Learning Using Low-Discrepancy Sequence. In: Foo, N.Y. (ed.) Canadian AI 1999. LNCS, vol. 1747, pp. 255–267. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Kimura, S., Matsumura, K.: Genetic Algorithms using Low-Discrepancy Sequences. In: Genetic and Evolutionary Computation Conference, pp. 1341–1346 (2005)

    Google Scholar 

  8. Kucherenko, S.: Application of Quasi Monte Carlo Methods in Global Optimization. In: Global Optimization, pp. 111–133 (2006)

    Google Scholar 

  9. Kucherenko, S., Sytsko, Y.: Application of Deterministic Low-Discrepancy Sequences in Global Optimization. Computational Optimization and Applications 30, 297–318 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Li, M., Chen, X., Li, X., Ma, B., Vitanyi, P.M.B.: The similarity metric. IEEE Transactions on Information Theory 50(12), 3250–3264 (2004)

    Article  MathSciNet  Google Scholar 

  11. Maaranen, H., Miettinen, K., Makela, M.M.: Quasi-random Initial Population for Genetic Algorithms. Computers and Mathematics with Applications 47(12), 1885–1895 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Maaranen, H., Miettinen, K., Penttinen, A.: On Initial Populations of a Genetic Algorithm for Continuous Optimization Problems. Journal of Global Optimization 37, 405–436 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Nguyen, Q., Nguyen, X., McKay, R., Tuan, P.: Initialising PSO with Randomised Low-Discrepancy Sequences: The Comparative Results. In: Congress on Evolutionary Computation, pp. 1985–1992 (2007)

    Google Scholar 

  14. Nguyen, X., Nguyen, Q., McKay, R.: Pso with Randomized Low-Discrepancy Sequences. In: Genetic and Evolutionary Computation Conference, p. 173 (2007)

    Google Scholar 

  15. Niederreiter, H., McCurley, K.: Optimization of Functions by Quasi-random Search Methods. Computing 22(2), 119–123 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pant, M., Thangaraj, R., Grosan, C., Abraham, A.: Improved Particle Swarm Optimization with Low-Discrepancy Sequences. In: Congress on Evolutionary Computation (to appear, 2008)

    Google Scholar 

  17. Rahnamayana, S., Tizhoosh, H.R., Salamaa, M.: A Novel Population Initialization Method for Accelerating Evolutionary Algorithms. Computers and Mathematics with Applications 53(10), 1605–1614 (2007)

    Article  MathSciNet  Google Scholar 

  18. Rahnamayana, S., Tizhoosh, H.R., Salamaa, M.: Opposition versus randomness in soft computing techniques. Applied Soft Computing 8(2), 906–918 (2008)

    Article  Google Scholar 

  19. Sarker, B.R., Saiful Islam, K.M.: Relative performances of similarity and dissimilarity measures. Computers and Industrial Engineering 37(4), 769–807 (1999)

    Article  Google Scholar 

  20. Stewart, N., Brown, G.D.A.: Similarity and dissimilarity as evidence in perceptual categorization. Journal of Mathematical Psychology 49(5), 403–409 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  21. Tizhoosh, H.R.: Opposition-Based Learning: A New Scheme for Machine Intelligence. In: International Conference on Computational Intelligence for Modelling Control and Automation, vol. 1, pp. 695–701 (2005)

    Google Scholar 

  22. Tizhoosh, H.R.: Opposition-based reinforcement learning. Journal of Advanced Computational Intelligence and Intelligent Informatics (JACIII) 10(4), 578–585 (2006)

    MathSciNet  Google Scholar 

  23. Yaochen, Z.: On the Convergence of Sequential Number-Theoretic Method for Optimization. Acta Mathematicae Applicatae Sinica 17(4), 532–538 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hamid R. Tizhoosh Mario Ventresca

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tizhoosh, H.R., Ventresca, M., Rahnamayan, S. (2008). Opposition-Based Computing. In: Tizhoosh, H.R., Ventresca, M. (eds) Oppositional Concepts in Computational Intelligence. Studies in Computational Intelligence, vol 155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70829-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70829-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70826-1

  • Online ISBN: 978-3-540-70829-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics