Business Applications And Computational Intelligence

Computational intelligence consists of those techniques that imitate the human brain and nature to adopt the decision-making approach. This book contains selected papers from the 8th International Conference on Computers, Management and Mathematical Sciences (ICCM) 2022 about fuzzy systems, neural networks and evolutionary computation that can address stochastic environments where reasoning is a significant attribute to derive potential solutions and focus on the business domain's computational aspects.

Computational intelligence paradigms have attracted the growing interest of researchers, scientists, engineers and application engineers in a number of everyday applications. These applications are not limited to any particular field and include engineering, business, banking and consumer electronics. Computational intelligence paradigms include artificial intelligence, artificial neural networks, fuzzy systems and evolutionary computing. Artificial neural networks can mimic the biological information processing mechanism in a very limited sense. Evolutionary computing algorithms are used for optimisation applications, and fuzzy logic provides a basis for representing uncertain and imprecise knowledge.

Foundations of Computational Intelligence Volume 6: Data Mining: Theoretical Foundations and Applications Finding information hidden in data is as theoretically difficult as it is practically important. With the objective of discovering unknown patterns from data, the methodologies of data mining were derived from statistics, machine learning, and artificial intelligence, and are being used successfully in application areas such as bioinformatics, business, health care, banking, retail, and many others.

“Life on earth is filled with many mysteries, but perhaps the most challenging of these is the nature of Intelligence.”
– Prof. Terrence J. Sejnowski, Computational Neurobiologist

Foundations of Computational Intelligence Volume 1: Learning and Approximation: Theoretical Foundations and Applications Learning methods and approximation algorithms are fundamental tools that deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems have a large number of applications arising from a variety of fields, such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approxi- tion and online algorithms, randomization techniques, real-world applications, scheduling problems and so on.