This book concentrates on mining networks, a subfield within data science. Data science uses scientific and computational tools to extract valuable knowledge from large data sets. Once data is processed and cleaned, it is analyzed and presented to support decision-making processes. Data science and machine learning tools have become widely used in companies of all sizes. Networks are often large-scale, decentralized, and evolve dynamically over time. Mining complex networks aim to understand the principles governing the organization and the behavior of such networks is crucial for a broad range of fields of study. Here are a few selected typical applications of mining networks: Community detection (which users on some social media platforms are close friends). Link prediction (who is likely to connect to whom on such platforms). Node attribute prediction (what advertisement should be shown to a given user of a particular platform to match their interests). Influential node detection (which social media users would be the best ambassadors of a specific product). This textbook is suitable for an upper-year undergraduate course or a graduate course in programs such as data science, mathematics, computer science, business, engineering, physics, statistics, and social science. This book can be successfully used by all enthusiasts of data science at various levels of sophistication to expand their knowledge or consider changing their career path. Jupiter notebooks (in Python and Julia) accompany the book and can be accessed on https://www.ryerson.ca/mining-complex-networks/. These not only contain all the experiments presented in the book, but also include additional material. Bogumil Kaminski is the Chairman of the Scientific Council for the Discipline of Economics and Finance at SGH Warsaw School of Economics. He is also an Adjunct Professor at the Data Science Laboratory at Ryerson University. Bogumil is an expert in applications of mathematical modeling to solving complex real-life problems. He is also a substantial open-source contributor to the development of the Julia language and its package ecosystem. Pawel Pralat is a Professor of Mathematics in Ryerson University, whose main research interests are in random graph theory, especially in modeling and mining complex networks. He is the Director of Fields-CQAM Lab on Computational Methods in Industrial Mathematics in The Fields Institute for Research in Mathematical Sciences and has pursued collaborations with various industry partners as well as the Government of Canada. He has written over 170 papers and three books with 130 plus collaborators. Francois Theberge holds a B.Sc. degree in applied mathematics from the University of Ottawa, a M.Sc. in telecommunications from INRS and a PhD in electrical engineering from McGill University. He has been employed by the Government of Canada since 1996 where he was involved in the creation of the data science team as well as the research group now known as the Tutte Institute for Mathematics and Computing. He also holds an adjunct professorial position in the Department of Mathematics and Statistics at the University of Ottawa. His current interests include relational-data mining and deep learning.

Modelling Transitions shows what computational, formal and data-driven approaches can and could mean for sustainability transitions research, presenting the state-of-the-art and exploring what lies beyond. Featuring contributions from many well-known authors, this book presents the various benefits of modelling for transitions research. More than just taking stock, it also critically examines what modelling of transformative change means and could mean for transitions research and for other disciplines that study societal changes. This includes identifying a variety of approaches currently not part of the portfolios of transitions modellers. Far from only singing praise, critical methodological and philosophical introspection are key aspects of this important book. This book speaks to modellers and non-modellers alike who value the development of robust knowledge on transitions to sustainability, including colleagues in congenial fields. Be they students, researchers or practitioners, everyone interested in transitions should find this book relevant as reference, resource and guide.

Based on the practical experiences of its authors, who collectively have spent several decades teaching software skills to scientists. Readers only need a basic understanding of Python includes over a hundred exercises to allow readers to practice their skills

The opportunistic network is an emerging and recent area of research. To make this research area more adaptable for practical and industrial use, there is a need to further investigate several research challenges in all aspects of opportunistic networks. Therefore, Opportunistic Networks: Fundamentals, Applications and Emerging Trends provides theoretical, algorithmic, simulation, and implementation-based research developments related to fundamentals, applications, and emerging research trends in opportunistic networks. The book follows a theoretical approach to describe fundamentals to beginners and incorporates a practical approach depicting the implementation of real-life applications to intermediate and advanced readers. This book is beneficial for academicians, researchers, developers, and engineers who work in or are interested in the fields related to opportunistic networks, delay tolerant networks, and intermittently connected ad hoc networks. This book also serves as a reference book for graduate and postgraduate courses in computer science, computer engineering, and information technology streams.

Machine Translation and Transliteration involving Related, Low-resource Languages discusses an important aspect of natural language processing that has received lesser attention: translation and transliteration involving related languages in a low-resource setting. This is a very relevant real-world scenario for people living in neighbouring states/provinces/countries who speak similar languages and need to communicate with each other, but training data to build supporting MT systems is limited. The book discusses different characteristics of related languages with rich examples and draws connections between two problems: translation for related languages and transliteration. It shows how linguistic similarities can be utilized to learn MT systems for related languages with limited data. It comprehensively discusses the use of subword-level models and multilinguality to utilize these linguistic similarities. The second part of the book explores methods for machine transliteration involving related languages based on multilingual and unsupervised approaches. Through extensive experiments over a wide variety of languages, the efficacy of these methods is established. Features Novel methods for machine translation and transliteration between related languages, supported with experiments on a wide variety of languages. An overview of past literature on machine translation for related languages. A case study about machine translation for related languages between 10 major languages from India, which is one of the most linguistically diverse country in the world. The book presents important concepts and methods for machine translation involving related languages. In general, it serves as a good reference to NLP for related languages. It is intended for students, researchers and professionals interested in Machine Translation, Translation Studies, Multilingual Computing Machine and Natural Language Processing. It can be used as reference reading for courses in NLP and machine translation. Anoop Kunchukuttan is a Senior Applied Researcher at Microsoft India. His research spans various areas on multilingual and low-resource NLP. Pushpak Bhattacharyya is a Professor at the Department of Computer Science, IIT Bombay. His research areas are Natural Language Processing, Machine Learning and AI (NLP-ML-AI). Prof. Bhattacharyya has published more than 350 research papers in various areas of NLP.

Covers deep learning fundamentals; Focuses on applications; Covers human emotion analysis and deep learning; Explains how to use web based techniques for deep learning applications; Includes coverage of autonomous vehicles and deep learning

Nature-based algorithms play an important role among artificial intelligence algorithms. Among them are global optimization algorithms called swarm intelligence algorithms. These algorithms that use the behavior of simple agents and various ways of cooperation between them, are used to solve specific problems that are defined by the so-called objective function. Swarm intelligence algorithms are inspired by the social behavior of various animal species, e.g. ant colonies, bird flocks, bee swarms, schools of fish, etc. The family of these algorithms is very large and additionally includes various types of modifications to enable swarm intelligence algorithms to solve problems dealing with areas other than those for which they were originally developed. This book presents 24 swarm algorithms together with their modifications and practical applications. Each chapter is devoted to one algorithm. It contains a short description along with a pseudo-code showing the various stages of its operation. In addition, each chapter contains a description of selected modifications of the algorithm and shows how it can be used to solve a selected practical problem. This book should also be useful for undergraduate and postgraduate students studying nature-based optimization algorithms, and can be a helpful tool for learning these algorithms, along with their modifications and practical applications. In addition, it can be a useful source of knowledge for scientists working in the field of artificial intelligence, as well as for engineers interested in using this type of algorithms in their work. If the reader wishes to expand his knowledge beyond the basics of swarm intelligence algorithms presented in this book and is interested in more detailed information, we recommend the book "Swarm Intelligence Algorithms: A Tutorial" (Edited by A. Slowik, CRC Press, 2020). It contains a detailed explanation of how each algorithm works, along with relevant program codes in Matlab and the C ++ programming language, as well as numerical examples illustrating step-by-step how individual algorithms work.

This book offers a self-contained guide to advanced algorithms and their applications in various fields of science. Gathering contributions by authoritative researchers in the field of mathematics, statistics and computer science, it aims at offering a comprehensive and up-to-date view of algorithms, including the theory behind them, as well as practical considerations, current limitations and solutions. It covers applications in energy management, decision making, computer networks, materials science, mechanics and process optimization. It offers an integrated and timely guide to important algorithms, and represents a valuable reference resource for graduate students and researchers in various fields of applied mathematics, statistics and engineering.

ALGORITHMS IN BIOINFORMATICS Explore a comprehensive and insightful treatment of the practical application of bioinformatic algorithms in a variety of fields Algorithms in Bioinformatics: Theory and Implementation delivers a fulsome treatment of some of the main algorithms used to explain biological functions and relationships. It introduces readers to the art of algorithms in a practical manner which is linked with biological theory and interpretation. The book covers many key areas of bioinformatics, including global and local sequence alignment, forced alignment, detection of motifs, Sequence logos, Markov chains or information entropy. Other novel approaches are also described, such as Self-Sequence alignment, Objective Digital Stains (ODSs) or Spectral Forecast and the Discrete Probability Detector (DPD) algorithm. The text incorporates graphical illustrations to highlight and emphasize the technical details of computational algorithms found within, to further the reader's understanding and retention of the material. Throughout, the book is written in an accessible and practical manner, showing how algorithms can be implemented and used in JavaScript on Internet Browsers. The author has included more than 120 open-source implementations of the material, as well as 33 ready-to-use presentations. The book contains original material that has been class-tested by the author and numerous cases are examined in a biological and medical context. Readers will also benefit from the inclusion of: A thorough introduction to biological evolution, including the emergence of life, classifications and some known theories and molecular mechanisms A detailed presentation of new methods, such as Self-sequence alignment, Objective Digital Stains and Spectral Forecast A treatment of sequence alignment, including local sequence alignment, global sequence alignment and forced sequence alignment with full implementations Discussions of position-specific weight matrices, including the count, weight, relative frequencies, and log-likelihoods matrices A detailed presentation of the methods related to Markov Chains as well as a description of their implementation in Bioinformatics and adjacent fields An examination of information and entropy, including sequence logos and explanations related to their meaning An exploration of the current state of bioinformatics, including what is known and what issues are usually avoided in the field A chapter on philosophical transactions that allows the reader a broader view of the prediction process Native computer implementations in the context of the field of Bioinformatics Extensive worked examples with detailed case studies that point out the meaning of different results Perfect for professionals and researchers in biology, medicine, engineering, and information technology, as well as upper level undergraduate students in these fields, Algorithms in Bioinformatics: Theory and Implementation will also earn a place in the libraries of software engineers who wish to understand how to implement bioinformatic algorithms in their products.

This book discusses link-state routing protocols (OSPF and IS-IS), and the path-vector routing protocol (BGP). It covers their most identifying characteristics, operations, and the databases they maintain. Material is presented from a practicing engineer's perspective, linking theory and fundamental concepts to common practices and real-world examples. Every aspect of the book is written to reflect current best practices using real-world examples. The book begins with a detailed description of the OSPF area types and hierarchical routing, and the different types of routers used in an OSPF autonomous system. The author goes on to describe in detail the different OSPF packet types, and inbound and outbound processing of OSPF link-state advertisements (LSAs). Next, the book gives an overview of the main features of IS-IS. The author then discusses the two-level routing hierarchy for controlling the distribution of intra-domain (Level 1) and inter-domain (Level 2) routing information within an IS-IS routing domain. He then describes in detail IS-IS network address formats, IS-IS routing metrics, IS-IS packet types, IS-IS network types and adjacency formation, IS-IS LSDB and synchronization, and IS-IS authentication. The book then reviews the main concepts of path-vector routing protocols, and describes BGP packet types, BGP session states and Finite State Machine, BGP path attributes types, and BGP Autonomous System Numbers (ASNs). Focuses solely on link-state routing protocols (OSPF and IS-IS), and the only path-vector routing protocol in use today (BGP). Reviews the basic concepts underlying the design of IS-IS and provides a detailed description of IS-IS area types and hierarchical routing, and the different types of routers used by IS-IS. Discusses the two-level routing hierarchy for controlling the distribution of intra-domain (Level 1) and inter-domain (Level 2) routing information within an IS-IS routing domain. Describes in detail BGP packet types, BGP session states and Finite State Machine, BGP path attributes types, and BGP ASNs, includes a high-level view of the typical BGP router and its components, and inbound and outbound message processing. James Aweya, PhD, is a chief research scientist at the Etisalat British Telecom Innovation Center (EBTIC), Khalifa University, Abu Dhabi, UAE. He has authored four books including this book and is a senior member of the Institute of Electrical and Electronics Engineers (IEEE).

This book focuses on the fundamental concepts of IP routing and distance-vector routing protocols (RIPv2 and EIGRP). It discusses routing protocols from a practicing engineer's perspective, linking theory and fundamental concepts to common practices and everyday examples. The book benefits and reflects the author's more than 22 years of designing and working with IP routing devices and protocols (and Telecoms systems, in general). Every aspect of the book is written to reflect current best practices using real-world examples. This book describes the various methods used by routers to learn routing information. The author includes discussion of the characteristics of the different dynamic routing protocols, and how they differ in design and operation. He explains the processing steps involved in forwarding IP packets through an IP router to their destination and discusses the various mechanisms IP routers use for controlling routing in networks. The discussion is presented in a simple style to make it comprehensible and appealing to undergraduate and graduate level students, research and practicing engineers, scientists, IT personnel, and network engineers. It is geared toward readers who want to understand the concepts and theory of IP routing protocols, through real-world example systems and networks. Focuses on the fundamental concepts of IP routing and distance-vector routing protocols (RIPv2 and EIGRP). Describes the various methods used by routers to learn routing information. Includes discussion of the characteristics of the different dynamic routing protocols, and how they differ in design and operation. Provides detailed descriptions of the most common distance-vector routing protocols RIPv2 and EIGRP. Discusses the various mechanisms IP routers use for controlling routing in networks. James Aweya, PhD, is a chief research scientist at the Etisalat British Telecom Innovation Center (EBTIC), Khalifa University, Abu Dhabi, UAE. He has authored four books including this book and is a senior member of the Institute of Electrical and Electronics Engineers (IEEE).

Understand the introductory concepts and design principles of algorithms and their complexities. Demonstrate the programming implementations of all the algorithms using C-Language. Be an excellent handbook on algorithms with self-explanatory chapters enriched with problems and solutions.

Resolves linear and non-linear data structures in C language using the algorithm, diagrammatically and its time and space complexity analysis. Covers interview questions and MCQs on all topics of campus readiness Identifies possible solutions to each problem. Includes real life and computational applications of linear and non-linear data structures

"High Performance Deformable Image Registration Algorithms for Manycore Processors" develops highly data-parallel image registration algorithms suitable for use on modern multi-core architectures, including graphics processing units (GPUs). Focusing on deformable registration, we show how to develop data-parallel versions of the registration algorithm suitable for execution on the GPU. Image registration is the process of aligning two or more images into a common coordinate frame and is a fundamental step to be able to compare or fuse data obtained from different sensor measurements. Extracting useful information from 2D/3D data is essential to realizing key technologies underlying our daily lives. Examples include autonomous vehicles and humanoid robots that can recognize and manipulate objects in cluttered environments using stereo vision and laser sensing and medical imaging to localize and diagnose tumors in internal organs using data captured by CT/MRI scans.

This book demonstrates:

How to redesign widely used image registration algorithms so as to best expose the underlying parallelism available in these algorithmsHow to pose and implement the parallel versions of the algorithms within the single instruction, multiple data (SIMD) model supported by GPUsProgramming "tricks" that can help readers develop other image processing algorithms, including registration algorithms for the GPU

This book presents watermarking algorithms derived from signal processing methods such as wavelet transform, matrix decomposition and cosine transform to address the limitations of current technologies. For each algorithm, mathematical foundations are explained with analysis conducted to evaluate performances on robotness and efficiency. Combining theories and practice, it is suitable for information security researchers and industrial engineers.

Soft computing techniques are no longer limited to the arena of computer science. The discipline has an exponentially growing demand in other branches of science and engineering and even into health and social science. This book contains theory and applications of soft computing in engineering, health, and social and applied sciences. Different soft computing techniques such as artificial neural networks, fuzzy systems, evolutionary algorithms and hybrid systems are discussed. It also contains important chapters in machine learning and clustering. This book presents a survey of the existing knowledge and also the current state of art development through original new contributions from the researchers. This book may be used as a one-stop reference book for a broad range of readers worldwide interested in soft computing. In each chapter, the preliminaries have been presented first and then the advanced discussion takes place. Learners and researchers from a wide variety of backgrounds will find several useful tools and techniques to develop their soft computing skills. This book is meant for graduate students, faculty and researchers willing to expand their knowledge in any branch of soft computing. The readers of this book will require minimum prerequisites of undergraduate studies in computation and mathematics.

This book proposes tools for analysis of multidimensional and metric data, by establishing a state-of-the-art of the existing solutions and developing new ones. It mainly focuses on visual exploration of these data by a human analyst, relying on a 2D or 3D scatter plot display obtained through Dimensionality Reduction. Performing diagnosis of an energy system requires identifying relations between observed monitoring variables and the associated internal state of the system. Dimensionality reduction, which allows to represent visually a multidimensional dataset, constitutes a promising tool to help domain experts to analyse these relations. This book reviews existing techniques for visual data exploration and dimensionality reduction such as tSNE and Isomap, and proposes new solutions to challenges in that field. In particular, it presents the new unsupervised technique ASKI and the supervised methods ClassNeRV and ClassJSE. Moreover, MING, a new approach for local map quality evaluation is also introduced. These methods are then applied to the representation of expert-designed fault indicators for smart-buildings, I-V curves for photovoltaic systems and acoustic signals for Li-ion batteries.

The increasing complexity of telecommunication networks requires us to develop adequate mathematical models. We must find their characteristics, optimize them subject to chosen criteria, and develop the corresponding control algorithms. Multidimensional queueing models are used to design and optimize modern and next-generation networks (NGN). The central problem of the related mathematical theory is to apply multidimensional and large-size queueing models to improve efficiency. In this book new methods are successively developed and applied to solve related problems. The book is recommended for researchers engaged with the mathematical theory of telecommunications traffic.

This book addresses the issue of improving the accuracy in exon prediction in DNA sequences using various adaptive techniques based on different performance measures that are crucial in disease diagnosis and therapy. First, the authors present an overview of genomics engineering, structure of DNA sequence and its building blocks, genetic information flow in a cell, gene prediction along with its significance, and various types of gene prediction methods, followed by a review of literature starting with the biological background of genomic sequence analysis. Next, they cover various theoretical considerations of adaptive filtering techniques used for DNA analysis, with an introduction to adaptive filtering, properties of adaptive algorithms, and the need for development of adaptive exon predictors (AEPs) and structure of AEP used for DNA analysis. Then, they extend the approach of least mean squares (LMS) algorithm and its sign-based realizations with normalization factor for DNA analysis. They also present the normalized logarithmic-based realizations of least mean logarithmic squares (LMLS) and least logarithmic absolute difference (LLAD) adaptive algorithms that include normalized LMLS (NLMLS) algorithm, normalized LLAD (NLLAD) algorithm, and their signed variants. This book ends with an overview of the goals achieved and highlights the primary achievements using all proposed techniques. This book is intended to provide rigorous use of adaptive signal processing algorithms for genetic engineering, biomedical engineering, and bioinformatics and is useful for undergraduate and postgraduate students. This will also serve as a practical guide for Ph.D. students and researchers and will provide a number of research directions for further work. Features Presents an overview of genomics engineering, structure of DNA sequence and its building blocks, genetic information flow in a cell, gene prediction along with its significance, and various types of gene prediction methods Covers various theoretical considerations of adaptive filtering techniques used for DNA analysis, introduction to adaptive filtering, properties of adaptive algorithms, need for development of adaptive exon predictors (AEPs), and structure of AEP used for DNA analysis Extends the approach of LMS algorithm and its sign-based realizations with normalization factor for DNA analysis Presents the normalized logarithmic-based realizations of LMLS and LLAD adaptive algorithms that include normalized LMLS (NLMLS) algorithm, normalized LLAD (NLLAD) algorithm, and their signed variants Provides an overview of the goals achieved and highlights the primary achievements using all proposed techniques Dr. Md. Zia Ur Rahman is a professor in the Department of Electronics and Communication Engineering at Koneru Lakshmaiah Educational Foundation (K. L. University), Guntur, India. His current research interests include adaptive signal processing, biomedical signal processing, genetic engineering, medical imaging, array signal processing, medical telemetry, and nanophotonics. Dr. Srinivasareddy Putluri is currently a Software Engineer at Tata Consultancy Services Ltd., Hyderabad. He received his Ph.D. degree (Genomic Signal Processing using Adaptive Signal Processing algorithms) from the Department of Electronics and Communication Engineering at Koneru Lakshmaiah Educational Foundation (K. L. University), Guntur, India. His research interests include genomic signal processing and adaptive signal processing. He has published 15 research papers in various journals and proceedings. He is currently a reviewer of publishers like the IEEE Access and IGI.

This book presents fundamental concepts of optimization problems and its real-world applications in various fields. The core concepts of optimization, formulations and solution procedures of various real-world problems are provided in an easy-to-read manner. The unique feature of this book is that it presents unified knowledge of the modelling of real-world decision-making problems and provides the solution procedure using the appropriate optimization techniques. The book will help students, researchers, and faculty members to understand the need for optimization techniques for obtaining optimal solution for the decision-making problems. It provides a sound knowledge of modelling of real-world problems using optimization techniques. It is a valuable compendium of several optimization techniques for solving real-world application problems using optimization software LINGO. The book is useful for academicians, practitioners, students and researchers in the field of OR. It is written in simple language with a detailed explanation of the core concepts of optimization techniques. Readers of this book will understand the formulation of real-world problems and their solution procedures obtained using the appropriate optimization techniques.

This book provides a platform for academics and practitioners for sharing innovative results, approaches, developments, and research projects in computer science and information technology, focusing on the latest challenges in advanced computing and solutions introducing mathematical and engineering approaches. The book presents discussions in the area of advances and challenges of modern computer science, including telecommunications and signal processing, machine learning and artificial intelligence, intelligent control systems, modeling and simulation, data science and big data, data visualization and graphics systems, distributed, cloud and high-performance computing, and software engineering. The papers included are presented at TELECCON 2019 organized by Peter the Great St. Petersburg University during November 18-19, 2019.

This book presents a unique, understandable view of machine learning using many practical examples and access to free professional software and open source code. The user-friendly software can immediately be used to apply everything you learn in the book without the need for programming. After an introduction to machine learning and artificial intelligence, the chapters in Part II present deeper explanations of machine learning algorithms, performance evaluation of machine learning models, and how to consider data in machine learning environments. In Part III the author explains automatic speech recognition, and in Part IV biometrics recognition, face- and speaker-recognition. By Part V the author can then explain machine learning by example, he offers cases from real-world applications, problems, and techniques, such as anomaly detection and root cause analyses, business process improvement, detecting and predicting diseases, recommendation AI, several engineering applications, predictive maintenance, automatically classifying datasets, dimensionality reduction, and image recognition. Finally, in Part VI he offers a detailed explanation of the AI-TOOLKIT, software he developed that allows the reader to test and study the examples in the book and the application of machine learning in professional environments. The author introduces core machine learning concepts and supports these with practical examples of their use, so professionals will appreciate his approach and use the book for self-study. It will also be useful as a supplementary resource for advanced undergraduate and graduate courses on machine learning and artificial intelligence.

This comprehensive reference text discusses evolutionary optimization techniques, to find optimal solutions for single and multi-objective problems. The text presents each evolutionary optimization algorithm along with its history and other working equations. It also discusses variants and hybrids of optimization techniques. The text presents step-by-step solution to a problem and includes software's like MATLAB and Python for solving optimization problems. It covers important optimization algorithms including single objective optimization, multi objective optimization, Heuristic optimization techniques, shuffled frog leaping algorithm, bacteria foraging algorithm and firefly algorithm. Aimed at senior undergraduate and graduate students in the field of electrical engineering, electronics engineering, mechanical engineering, and computer science and engineering, this text: Provides step-by-step solution for each evolutionary optimization algorithm. Provides flowcharts and graphics for better understanding of optimization techniques. Discusses popular optimization techniques include particle swarm optimization and genetic algorithm. Presents every optimization technique along with the history and working equations. Includes latest software like Python and MATLAB.

This book provides a comprehensive overview of the field of pattern mining with evolutionary algorithms. To do so, it covers formal definitions about patterns, patterns mining, type of patterns and the usefulness of patterns in the knowledge discovery process. As it is described within the book, the discovery process suffers from both high runtime and memory requirements, especially when high dimensional datasets are analyzed. To solve this issue, many pruning strategies have been developed. Nevertheless, with the growing interest in the storage of information, more and more datasets comprise such a dimensionality that the discovery of interesting patterns becomes a challenging process. In this regard, the use of evolutionary algorithms for mining pattern enables the computation capacity to be reduced, providing sufficiently good solutions. This book offers a survey on evolutionary computation with particular emphasis on genetic algorithms and genetic programming. Also included is an analysis of the set of quality measures most widely used in the field of pattern mining with evolutionary algorithms. This book serves as a review of the most important evolutionary algorithms for pattern mining. It considers the analysis of different algorithms for mining different type of patterns and relationships between patterns, such as frequent patterns, infrequent patterns, patterns defined in a continuous domain, or even positive and negative patterns. A completely new problem in the pattern mining field, mining of exceptional relationships between patterns, is discussed. In this problem the goal is to identify patterns which distribution is exceptionally different from the distribution in the complete set of data records. Finally, the book deals with the subgroup discovery task, a method to identify a subgroup of interesting patterns that is related to a dependent variable or target attribute. This subgroup of patterns satisfies two essential conditions: interpretability and interestingness.