Neural networks have become a well-established methodology as exempli?ed by their applications to identi?cation and control of general nonlinear and complex systems; the use of high order neural networks for modeling ...
ISBN:
(数字)9783540782896
ISBN:
(纸本)9783540782889;9783642096952
Neural networks have become a well-established methodology as exempli?ed by their applications to identi?cation and control of general nonlinear and complex systems; the use of high order neural networks for modeling and learning has recently increased. Usingneuralnetworks,controlalgorithmscanbedevelopedtoberobustto uncertainties and modeling errors. The most used NN structures are Feedf- ward networks and Recurrent networks. The latter type o?ers a better suited tool to model and control of nonlinear systems. There exist di?erent training algorithms for neural networks, which, h- ever, normally encounter some technical problems such as local minima, slow learning, and high sensitivity to initial conditions, among others. As a viable alternative, new training algorithms, for example, those based on Kalman ?ltering, have been proposed. There already exists publications about trajectory tracking using neural networks; however, most of those works were developed for continuous-time systems. On the other hand, while extensive literature is available for linear discrete-timecontrolsystem,nonlineardiscrete-timecontroldesigntechniques have not been discussed to the same degree. Besides, discrete-time neural networks are better ?tted for real-time implementations.
This book provides two general granular computing approaches to mining relational data, the first of which uses abstract descriptions of relational objects to build their granular representation, while the second exte...
ISBN:
(数字)9783319527512
ISBN:
(纸本)9783319527505;9783319849775
This book provides two general granular computing approaches to mining relational data, the first of which uses abstract descriptions of relational objects to build their granular representation, while the second extends existing granular data mining solutions to a relational case.;Both approaches make it possible to perform and improve popular data mining tasks such as classification, clustering, and association discovery. How can different relational data mining tasks best be unified? How can the construction process of relational patterns be simplified? How can richer knowledge from relational data be discovered? All these questions can be answered in the same way: by mining relational data in the paradigm of granular computing!;This book will allow readers with previous experience in the field of relational data mining to discover the many benefits of its granular perspective. In turn, those readers familiar with the paradigm of granular computing will find valuable insights on its application to mining relational data. Lastly, the book offers all readers interested in computationalintelligence in the broader sense the opportunity to deepen their understanding of the newly emerging field granular-relational data mining.
This book gathers the peer-reviewed proceedings of the 16th Annual Meeting of the Bulgarian Section of the Society for Industrial and Applied Mathematics, BGSIAM'21, held in Sofia, Bulgaria. The general theme of B...
ISBN:
(数字)9783031767821
ISBN:
(纸本)9783031767814;9783031767845
This book gathers the peer-reviewed proceedings of the 16th Annual Meeting of the Bulgarian Section of the Society for Industrial and Applied Mathematics, BGSIAM'21, held in Sofia, Bulgaria. The general theme of BGSIAM'21 was industrial and applied mathematics with particular focus on: mathematical physics, numerical analysis, high performance computing, optimization and control, mathematical biology, stochastic modeling, machine learning, digitization and imaging, advanced computing in environmental, biomedical and engineering applications.
I’m not usually a fan of edited volumes. Too often they are an incoherent hodgepodge of remnants, renegades, or rejects foisted upon an unsuspecting reading public under a misleading or fraudulent title. The volume S...
ISBN:
(数字)9783540349549
ISBN:
(纸本)9783540349532;9783642071164
I’m not usually a fan of edited volumes. Too often they are an incoherent hodgepodge of remnants, renegades, or rejects foisted upon an unsuspecting reading public under a misleading or fraudulent title. The volume Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications is a worthy addition to your library because it succeeds on exactly those dimensions where so many edited volumes fail. For example, take the title, Scalable Optimization via Probabilistic M- eling: From Algorithms to Applications. You need not worry that you’re going to pick up this book and ?nd stray articles about anything else. This book focuseslikealaserbeamononeofthehottesttopicsinevolutionary compu- tion over the last decade or so: estimation of distribution algorithms (EDAs). EDAs borrow evolutionary computation’s population orientation and sel- tionism and throw out the genetics to give us a hybrid of substantial power, elegance, and extensibility. The article sequencing in most edited volumes is hard to understand, but from the get go the editors of this volume have assembled a set of articles sequenced in a logical fashion. The book moves from design to e?ciency enhancement and then concludes with relevant applications. The emphasis on e?ciency enhancement is particularly important, because the data-mining perspectiveimplicitinEDAsopensuptheworldofoptimizationtonewme- ods of data-guided adaptation that can further speed solutions through the construction and utilization of e?ective surrogates, hybrids, and parallel and temporal decompositions.
Foundation of logic historically dates back to the times of Aristotle, who pioneered the concept of truth/falsehood paradigm in reasoning. Mathematical logic of propositions and predicates, which are based on the clas...
ISBN:
(数字)9783540334590
ISBN:
(纸本)9783540334583;9783642070082
Foundation of logic historically dates back to the times of Aristotle, who pioneered the concept of truth/falsehood paradigm in reasoning. Mathematical logic of propositions and predicates, which are based on the classical models of Aristotle, underwent a dramatic evolution during the last 50 years for its increasing applications in automated reasoning on digital computers. The subject of Logic Programming is concerned with automated reasoning with facts and knowledge to answer a user’s query following the syntax and semantics of the logic of propositions/predicates. The credit of automated reasoning by logic programs goes to Professor Robinson for his well-known resolution theorem that provides a general scheme to select two program clauses for deriving an inference. Until now Robinson’s theorem is being used in PROLOG/DATALOG compilers to automatically build a Select Linear Definite (SLD) clause based resolution tree for answering a user’s query. The SLD-tree based scheme for reasoning undoubtedly opened a new era in logic programming for its simplicity in implementation in the compilers. In fact, SLD-tree construction suffices the need for users with a limited set of program clauses. But with increase in the number of program clauses, the execution time of the program also increases linearly by the SLD-tree based approach. An inspection of a large number of logic programs, however, reveals that more than one pair of program clauses can be resolved simultaneously without violating the syntax and the semantics of logic programming. This book employs this principle to speed up the execution time of logic programs.
This book focuses on new research challenges in intelligent information filtering and retrieval. It collects invited chapters and extended research contributions from DART 2014 (the 8th International Workshop on Infor...
ISBN:
(数字)9783319461359
ISBN:
(纸本)9783319461335;9783319834498
This book focuses on new research challenges in intelligent information filtering and retrieval. It collects invited chapters and extended research contributions from DART 2014 (the 8th International Workshop on Information Filtering and Retrieval), held in Pisa (Italy), on December 10, 2014, and co-hosted with the XIII AI*IA Symposium on Artificial intelligence. The main focus of DART was to discuss and compare suitable novel solutions based on intelligent techniques and applied to real-world contexts. The chapters of this book present a comprehensive review of related works and the current state of the art. The contributions from both practitioners and researchers have been carefully reviewed by experts in the area, who also gave useful suggestions to improve the quality of the book.
暂无评论